Practical Everlasting Privacy

DOI10.1007/978-3-642-36830-1_2zbMATH Open1390.68273OpenAlexW2132001155MaRDI QIDQ5326751FDOQ5326751

Authors: Myrto Arapinis, Véronique Cortier, Steve Kremer, M. D. Ryan 

Publication date: 6 August 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-36830-1_2

Recommendations

• Perfect anonymity
• scientific article; zbMATH DE number 2086371
• scientific article
• Privacy, patience, and protection
• Persistent private information
• scientific article; zbMATH DE number 4191075
• A universal approach to guarantee data privacy

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (3)

• Automated verification of equivalence properties of cryptographic protocols
• Efficient universally-verifiable electronic voting with everlasting privacy
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols

This page was built for publication: Practical Everlasting Privacy

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