Public Key Cryptography
Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage
Non-Committing Encryption with Constant Ciphertext Expansion from Standard Assumptions
Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions
Subvert KEM to Break DEM: Practical Algorithm-Substitution Attacks on Public-Key Encryption
Unbounded HIBE with Tight Security
Multi-Client Oblivious RAM with Poly-Logarithmic Communication
Privacy-Preserving Pattern Matching on Encrypted Data
Efficient Homomorphic Comparison Methods with Optimal Complexity
Lattice-Based Cryptography
Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings
Towards Classical Hardness of Module-LWE: The Linear Rank Case
Lattice-Based E-Cash, Revisited
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers
Isogeny-Based Cryptography
Cryptographic Group Actions and Applications
B-SIDH: supersingular isogeny Di e-Hellman using twisted torsion
Calamari and Fala : Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices
Radical Isogenies
Oblivious Pseudorandom Functions from Isogenies
SiGamal: A supersingular isogeny-based PKE and its application to a PRF
Quantum Algorithms
Estimating quantum speedups for lattice sieves
A Combinatorial Approach to Quantum Random Functions
Improved Classical and Quantum Algorithms for Subset-Sum
Security Limitations of Classical-Client Delegated Quantum Computing
Quantum Circuit Implementations of AES with Fewer Qubits
Quantum Collision Attacks on AES-like Hashing with Low Quantum Random Access Memories
Authenticated Key Exchange
Fuzzy Asymmetric Password-Authenticated Key Exchange
Two-Pass Authenticated Key Exchange with Explicit Authentication and Tight Security.