Abstract is missing.
- MOTIF: (Almost) Free Branching in GMW - Via Vector-Scalar MultiplicationDavid Heath, Vladimir Kolesnikov, Stanislav Peceny. 3-30 [doi]
- Maliciously Secure Matrix Multiplication with Applications to Private Deep LearningHao Chen 0030, Miran Kim, Ilya P. Razenshteyn, Dragos Rotaru, Yongsoo Song, Sameer Wagh. 31-59 [doi]
- On the Exact Round Complexity of Best-of-Both-Worlds Multi-party ComputationArpita Patra, Divya Ravi, Swati Singla. 60-91 [doi]
- MPC with Synchronous Security and Asynchronous ResponsivenessChen-Da Liu Zhang, Julian Loss, Ueli Maurer, Tal Moran, Daniel Tschudi. 92-119 [doi]
- Secure MPC: Laziness Leads to GODSaikrishna Badrinarayanan, Aayush Jain, Nathan Manohar, Amit Sahai. 120-150 [doi]
- Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero 0001, Matthieu Rambaud, Chaoping Xing, Chen Yuan 0003. 151-180 [doi]
- Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation?Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain 0002. 181-212 [doi]
- Circuit Amortization Friendly Encodingsand Their Application to Statistically Secure Multiparty ComputationAnders P. K. Dalskov, Eysa Lee, Eduardo Soria-Vazquez. 213-243 [doi]
- Efficient Fully Secure Computation via Distributed Zero-Knowledge ProofsElette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof. 244-276 [doi]
- Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive SecurityRan Canetti, Pratik Sarkar, Xiao Wang. 277-308 [doi]
- ALBATROSS: Publicly AttestabLe BATched Randomness Based On Secret SharingIgnacio Cascudo, Bernardo David. 311-341 [doi]
- Secret-Shared ShuffleMelissa Chase, Esha Ghosh, Oxana Poburinnaya. 342-372 [doi]
- Adaptively Secure Inner Product Encryption from LWEShuichi Katsumata, Ryo Nishimaki, Shota Yamada 0001, Takashi Yamakawa. 375-404 [doi]
- Unbounded Dynamic Predicate Compositions in ABE from Standard AssumptionsNuttapong Attrapadung, Junichi Tomida. 405-436 [doi]
- Succinct and Adaptively Secure ABE for ABP from k-LinHuijia Lin, Ji Luo 0002. 437-466 [doi]
- Inner-Product Functional Encryption with Fine-Grained Access ControlMichel Abdalla, Dario Catalano, Romain Gay, Bogdan Ursu. 467-497 [doi]
- MoniPoly - An Expressive q-SDH-Based Anonymous Attribute-Based Credential SystemSyh-Yuan Tan, Thomas Groß 0001. 498-526 [doi]
- The Direction of Updatable Encryption Does Not Matter MuchYao Jiang. 529-558 [doi]
- Improving Speed and Security in Updatable Encryption SchemesDan Boneh, Saba Eskandarian, Sam Kim, Maurice Shih. 559-589 [doi]
- CCA Updatable Encryption Against Malicious Re-encryption AttacksLong Chen, Yanan Li, Qiang Tang 0005. 590-620 [doi]
- Determining the Core Primitive for Optimally Secure RatchetingFatih Balli, Paul Rösler, Serge Vaudenay. 621-650 [doi]
- Cryptography from One-Way Communication: On Completeness of Finite ChannelsShweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen. 653-685 [doi]
- Succinct Functional Commitment for a Large Class of Arithmetic CircuitsHelger Lipmaa, Kateryna Pavlyk. 686-716 [doi]
- Crowd Verifiable Zero-Knowledge and End-to-End Verifiable Multiparty ComputationFoteini Baldimtsi, Aggelos Kiayias, Thomas Zacharias 0001, Bingsheng Zhang. 717-748 [doi]
- Non-interactive Composition of Sigma-Protocols via Share-then-HashMasayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen. 749-773 [doi]
- Succinct Diophantine-Satisfiability ArgumentsPatrick Towa, Damien Vergnaud. 774-804 [doi]
- Individual SimulationsYi Deng. 805-836 [doi]
- KVaC: Key-Value Commitments for Blockchains and BeyondShashank Agrawal, Srinivasan Raghuraman. 839-869 [doi]
- Catalic: Delegated PSI Cardinality with Applications to Contact TracingThai Duong, Duong Hieu Phan, Ni Trieu. 870-899 [doi]