Abstract is missing.
- More Efficient Digital Signatures with Tight Multi-user SecurityDenis Diemert, Kai Gellert, Tibor Jager, Lin Lyu. 1-31 [doi]
- Multiparty Cardinality Testing for Threshold Private IntersectionPedro Branco 0005, Nico Döttling, Sihang Pu. 32-60 [doi]
- Verifiable Random Functions with Optimal TightnessDavid Niehues. 61-91 [doi]
- A Geometric Approach to Homomorphic Secret SharingYuval Ishai, Russell W. F. Lai, Giulio Malavolta. 92-119 [doi]
- Generic Negation of Pair EncodingsMiguel Ambrona. 120-146 [doi]
- On Selective-Opening Security of Deterministic PrimitivesAdam O'Neill, Mohammad-Zaheri. 147-172 [doi]
- Revisiting (R)CCA Security and Replay ProtectionChristian Badertscher, Ueli Maurer, Christopher Portmann, Guilherme Rito. 173-202 [doi]
- Single-to-Multi-theorem Transformations for Non-interactive Statistical Zero-KnowledgeMarc Fischlin, Felix Rohrbach. 205-234 [doi]
- On the CCA Compatibility of Public-Key InfrastructureDakshita Khurana, Brent Waters. 235-260 [doi]
- Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal LatticesMartin R. Albrecht, Alex Davidson, Amit Deo, Nigel P. Smart. 261-289 [doi]
- BETA: Biometric-Enabled Threshold AuthenticationShashank Agrawal, Saikrishna Badrinarayanan, Payman Mohassel, Pratyay Mukherjee, Sikhar Patranabis. 290-318 [doi]
- Masked Triples - Amortizing Multiplication Triples Across ConditionalsDavid Heath, Vladimir Kolesnikov, Stanislav Peceny. 319-348 [doi]
- Multi-party Threshold Private Set Intersection with Sublinear CommunicationSaikrishna Badrinarayanan, Peihan Miao, Srinivasan Raghuraman, Peter Rindal. 349-379 [doi]
- On the (In)Security of the Diffie-Hellman Oblivious PRF with Multiplicative BlindingStanislaw Jarecki, Hugo Krawczyk, Jiayu Xu. 380-409 [doi]
- An Efficient and Generic Construction for Signal's Handshake (X3DH): Post-Quantum, State Leakage Secure, and DeniableKeitaro Hashimoto, Shuichi Katsumata, Kris Kwiatkowski, Thomas Prest. 410-440 [doi]
- Cryptographic Pseudorandom Generators Can Make Cryptosystems ProblematicKoji Nuida. 441-468 [doi]
- Publicly Verifiable Zero Knowledge from (Collapsing) BlockchainsAlessandra Scafuro, Luisa Siniscalchi, Ivan Visconti. 469-498 [doi]
- Two-Server Distributed ORAM with Sublinear Computation and Constant RoundsAriel Hamlin, Mayank Varia. 499-527 [doi]
- Flexible and Efficient Verifiable Computation on Encrypted DataAlexandre Bois, Ignacio Cascudo, Dario Fiore 0001, Dongwoo Kim. 528-558 [doi]
- Transferable E-Cash: A Cleaner Model and the First Practical InstantiationBalthazar Bauer, Georg Fuchsbauer, Chen Qian. 559-590 [doi]
- Private Set Operations from Oblivious SwitchingGayathri Garimella, Payman Mohassel, Mike Rosulek, Saeed Sadeghian, Jaspal Singh. 591-617 [doi]
- On Publicly-Accountable Zero-Knowledge and Small Shuffle ArgumentsNils Fleischhacker, Mark Simkin 0001. 618-648 [doi]
- Beyond Security and Efficiency: On-Demand Ratcheting with Security AwarenessAndrea Caforio, F. Betül Durak, Serge Vaudenay. 649-677 [doi]
- Group Encryption: Full Dynamicity, Message Filtering and Code-Based InstantiationKhoa Nguyen, Reihaneh Safavi-Naini, Willy Susilo, Huaxiong Wang, Yanhong Xu, Neng Zeng. 678-708 [doi]
- Steel: Composable Hardware-Based Stateful and Randomised Functional EncryptionPramod Bhatotia, Markulf Kohlweiss, Lorenzo Martinico, Yiannis Tselekounis. 709-736 [doi]
- Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom FunctionsJung Hee Cheon, Wonhee Cho, Jeong Han Kim, Jiseung Kim 0001. 739-760 [doi]