Adaptive Security with Quasi-Optimal Rate

DOI10.1007/978-3-662-49096-9_22zbMath1388.94059OpenAlexW2296729592MaRDI QIDQ2796140

Alon Rosen, Rafail Ostrovsky, Brett Hemenway, Silas Richelson

Publication date: 23 March 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_22

zbMATH Keywords

LWEadaptive securityring-LWEnon-committing encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

New and improved constructions for partially equivocable public key encryption ⋮ Non-committing encryption with constant ciphertext expansion from standard assumptions ⋮ Adaptively secure MPC with sublinear communication complexity

Uses Software

• ring-LWE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
• A Toolkit for Ring-LWE Cryptography
• Public-key cryptosystems from the worst-case shortest vector problem
• Non-committing Encryption from Φ-hiding
• Probability Inequalities for Sums of Bounded Random Variables
• Classical hardness of learning with errors
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Adaptive Security with Quasi-Optimal Rate