Efficient laconic cryptography from learning with errors

Cites Work

Unnamed Item
Unnamed Item
Registration-based encryption: removing private-key generator from IBE
Anonymous IBE, leakage resilience and circular security from new assumptions
Two-round multiparty secure computation from minimal assumptions
\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
Adaptively secure garbling with near optimal online complexity
Identity-based encryption from the Diffie-Hellman assumption
Laconic oblivious transfer and its applications
From selective IBE to full IBE and selective HIBE
New constructions of identity-based and key-dependent message secure encryption schemes
Trapdoor functions from the computational Diffie-Hellman assumption
Verifiable registration-based encryption
Hardness of LWE on general entropic distributions
Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
Registration-based encryption from standard assumptions
Trapdoor hash functions and their applications
Towards classical hardness of module-LWE: the linear rank case
Laconic private set intersection and applications
FHE Circuit Privacy Almost for Free
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Circular and KDM Security for Identity-Based Encryption
Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
Collision-Free Hashing from Lattice Problems
Trapdoors for hard lattices and new cryptographic constructions
Bonsai Trees, or How to Delegate a Lattice Basis
An Efficient and Parallel Gaussian Sampler for Lattices
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
A Pseudorandom Generator from any One-way Function
Fully homomorphic encryption using ideal lattices
Bi-Deniable Public-Key Encryption
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
On lattices, learning with errors, random linear codes, and cryptography