Abstract is missing.
- Towards Bidirectional Ratcheted Key ExchangeBertram Poettering, Paul Rösler. 3-32 [doi]
- Optimal Channel Security Against Fine-Grained State Compromise: The Safety of MessagingJoseph Jaeger, Igors Stepanovs. 33-62 [doi]
- Out-of-Band Authentication in Group Messaging: Computational, Statistical, OptimalLior Rotem, Gil Segev. 63-89 [doi]
- Faster Homomorphic Linear Transformations in HElibShai Halevi, Victor Shoup. 93-120 [doi]
- CAPA: The Spirit of Beaver Against Physical AttacksOscar Reparaz, Lauren De Meyer, Begül Bilgin, Victor Arribas, Svetla Nikova, Ventzislav Nikov, Nigel P. Smart. 121-151 [doi]
- Fast Message Franking: From Invisible Salamanders to EncryptmentYevgeniy Dodis, Paul Grubbs, Thomas Ristenpart, Joanne Woodage. 155-186 [doi]
- Indifferentiable Authenticated EncryptionManuel Barbosa, Pooya Farshim. 187-220 [doi]
- The Curse of Small Domains: New Attacks on Format-Preserving EncryptionViet Tung Hoang, Stefano Tessaro, Ni Trieu. 221-251 [doi]
- Cryptanalysis via Algebraic SpansAdi Ben-Zvi, Arkadius G. Kalka, Boaz Tsaban. 255-274 [doi]
- Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of SuperpolyQingju Wang, Yonglin Hao, Yosuke Todo, Chaoyun Li, Takanori Isobe, Willi Meier. 275-305 [doi]
- Generic Attacks Against Beyond-Birthday-Bound MACsGaëtan Leurent, Mridul Nandi, Ferdinand Sibleyras. 306-336 [doi]
- Structured Encryption and Leakage SuppressionSeny Kamara, Tarik Moataz, Olga Ohrimenko. 339-370 [doi]
- Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read EfficiencyIoannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou. 371-406 [doi]
- Tight Tradeoffs in Searchable Symmetric EncryptionGilad Asharov, Gil Segev, Ido Shahaf. 407-436 [doi]
- Hardness of Non-interactive Differential Privacy from One-Way FunctionsLucas Kowalczyk, Tal Malkin, Jonathan Ullman, Daniel Wichs. 437-466 [doi]
- Risky Traitor Tracing and New Differential Privacy Negative ResultsRishab Goyal, Venkata Koppula, Andrew Russell, Brent Waters. 467-497 [doi]
- Non-malleable Secret Sharing for General Access StructuresVipul Goyal, Ashutosh Kumar 0002. 501-530 [doi]
- On the Local Leakage Resilience of Linear Secret Sharing SchemesFabrice Benhamouda, Akshay Degwekar, Yuval Ishai, Tal Rabin. 531-561 [doi]
- Threshold Cryptosystems from Threshold Fully Homomorphic EncryptionDan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter M. R. Rasmussen, Amit Sahai. 565-596 [doi]
- Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without PairingsMichel Abdalla, Dario Catalano, Dario Fiore, Romain Gay, Bogdan Ursu. 597-627 [doi]
- Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MACNilanjan Datta, Avijit Dutta, Mridul Nandi, Kan Yasuda. 631-661 [doi]
- Rasta: A Cipher with Low ANDdepth and Few ANDs per BitChristoph Dobraunig, Maria Eichlseder, Lorenzo Grassi 0001, Virginie Lallemand, Gregor Leander, Eik List, Florian Mendel, Christian Rechberger. 662-692 [doi]
- Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group ModelsSandro Coretti, Yevgeniy Dodis, Siyao Guo. 693-721 [doi]
- Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation NetworksBenoît Cogliati, Yevgeniy Dodis, Jonathan Katz, Jooyoung Lee, John P. Steinberger, Aishwarya Thiruvengadam, Zhe Zhang. 722-753 [doi]
- Verifiable Delay FunctionsDan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch. 757-788 [doi]
- Proofs of Work From Worst-Case AssumptionsMarshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan. 789-819 [doi]