Auto-recoverable auto-certifiable cryptosystems

DOI10.1007/BFB0054114MaRDI QIDQ4249625zbMATH OpenOpenAlexFDO

Authors Adam L. Young, Moti Yung

Publication date 9 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0054114

zbMATH Keywords

auto-recoverable auto-certifiable cryptosystemspublic keyssoftware key escrow

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(13)

• Anamorphic encryption: private communication against a dictator
• scientific article; zbMATH DE number 1341884 (Why is no real title available?)
• scientific article; zbMATH DE number 2048544 (Why is no real title available?)
• scientific article; zbMATH DE number 1489844 (Why is no real title available?)
• scientific article; zbMATH DE number 1925558 (Why is no real title available?)
• scientific article; zbMATH DE number 1440062 (Why is no real title available?)
• scientific article; zbMATH DE number 1440066 (Why is no real title available?)
• Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
• One-shot verifiable encryption from lattices
• Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds)
• Universally composable auditable surveillance
• Anamorphic encryption, revisited
• Verifiable encryption from MPC-in-the-head

This page was built for publication: Auto-recoverable auto-certifiable cryptosystems

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