From laconic zero-knowledge to public-key cryptography. Extended abstract

DOI10.1007/978-3-319-96878-0_23MaRDI QIDQ776009zbMATH OpenOpenAlexFDO

Authors Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan

Publication date 30 June 2020

Full work available at URL https://doi.org/10.1007/978-3-319-96878-0_23

zbMATH Keywords

laconic zero-knowledge protocolspublic-key encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public-key cryptography from different assumptions
• The Complexity of Public-Key Cryptography
• Public-key cryptography in the fine-grained setting
• Automata, Languages and Programming
• Towards non-interactive zero-knowledge for NP from LWE

Cited in

(11)

• Placing conditional disclosure of secrets in the communication complexity universe
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• On succinct arguments and witness encryption from groups
• Public-key cryptography from different assumptions
• A Brief History of Provably-Secure Public-Key Encryption
• Public-key cryptosystems from the worst-case shortest vector problem
• scientific article; zbMATH DE number 6938298 (Why is no real title available?)
• Minicrypt primitives with algebraic structure and applications
• Succinct interactive oracle proofs: applications and limitations
• PIR with client-side preprocessing: information-theoretic constructions and lower bounds
• On witness encryption and laconic zero-knowledge arguments

This page was built for publication: From laconic zero-knowledge to public-key cryptography. Extended abstract

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776009)