Papers

• Public-Key Encryption and Variants
  • [Abdalla, M. Bellare and P. Rogaway; CT-RSA'01] DHIES: An encryption scheme based on the Diffie-Hellman Problem (Full version)
  • [Cash, Kiltz, Shoup; EUROCRYPT'08] The Twin Diffie-Hellman Problem and Applications
  • [Peikert, Waters; STOC'08] Lossy Trapdoor Functions and Their Applications
  • [Boneh, Franklin; CRYPTO'01] Identity-Based Encryption from the Weil Pairing
  • [Goyal, Pandey, Sahai, Waters; CCS'06] Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data
  • [Koppula, Waters; CRYPTO'19] Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption.
• Digital Signatures
  • [Cramer, Shoup; ACM TISC'00] Signature schemes based on the strong RSA assumption
  • [Hohenberger, Waters; CRYPTO'09] Short and Stateless Signatures from the RSA Assumption
• Zero-Knowledge Proofs
  • [Bellare; Lecture Notes'20] Lectures on NIZKs: A Concrete Security Treatment
  • [Heath, Kolesnikov; EUROCRYPT'20] Stacked Garbling for Disjunctive Zero-Knowledge Proofs
  • [Sahai; FOCS'99] Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
• (Secure) Two-Party Computation
  • [Rosulek; Slides'18] Overview of secure computation (applications and definitions) and textbook Yao's protocol
  • [Bellare, Hoang, Rogaway; CCS'12] Foundations of garbled circuits
  • [Bellare, Hoang, Rogaway; ASIACRYPT'12] Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
  • [Cho, Döttling, Garg, Gupta, Miao, Antigoni Polychroniadou; CRYPTO'17] Laconic Oblivious Transfer and its Applications
• Password-Authenticated Key Exchange
  • [Abdalla, Pointcheval; CT-RSA'05] Simple Password-Based Encrypted Key Exchange Protocols
  • [Jarecki, Krawczyk, Xu; EUROCRYPT'18] OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-Computation Attacks
  • [Abdalla, Barbosa; EPRINT'19] Perfect Forward Security of SPAKE2
  • [Shoup; EPRINT'20] Security Analysis of SPAKE2+
• The Generic Group Model
  • [Shoup; EUROCRYPT'97] Lower Bounds for Discrete Logarithms and Related Problems
  • [Yun; EUROCRYPT'15] Generic Hardness of the Multiple Discrete Logarithm Problem
  • [Coretti, Dodis, Guo; CRYPTO'18] Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models
  • [Corrigan-Gibbs, Kogan; EUROCRYPT'18] The Discrete-Logarithm Problem with Preprocessing
• Oblivious RAM
  • [Goldreich, Ostrovsky; JACM'96] Software Protection and Simulation on Oblivious RAM
  • [Larsen, Nielsen; CRYPTO'18] Yes, There is an Oblivious RAM Lower Bound!
  • [Weiss, Wichs; TCC'18] Is There an Oblivious RAM Lower Bound for Online Reads?
  • [Asharov et al.; IACR Eprint'18] OptORAMa: Optimal Oblivious RAM
  • [Jafargholi, Larsen, Simkin; IACR Eprint'19] Optimal Oblivious Priority Queues and Offline Oblivious RAM
  • [Patel, Persiano, Raykova, Yeo; FOCS'18] PanORAMa: Oblivious RAM with Logarithmic Overhead
  • [Shi, Chan, Stefanov, Li; ASIACRYPT'11] Oblivious RAM with O((log N)^3) Worst-Case Cost
  • [Boyle, Chung, Pass; TCC'16] Oblivious Parallel RAM and Applications
• Bounded-Retrieval/Storage Model (a.k.a. "Big-Key Crypto")
  • [Bellare, Kane, Rogaway; CRYPTO'16] Big-Key Symmetric Encryption: Resisting Key Exfiltration
  • [Bellare, Dai; ACM CCS'17] Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction
  • [Guan, Zhandry; EUROCRYPT'19] Simple Schemes in the Bounded Storage Model