Everlasting multi-party computation

DOI10.1007/S00145-018-9278-ZzbMath1442.94047OpenAlexW2792145984MaRDI QIDQ1994636

Dominique Unruh

Publication date: 1 November 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-018-9278-z

zbMATH Keywords

quantum cryptographyuniversal composabilitymulti-party computationeverlasting security

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Long-term security and universal composability
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Everlasting Multi-party Computation
• Quantum Proofs of Knowledge
• Zero-knowledge against quantum attacks
• Concurrent Composition in the Bounded Quantum Storage Model
• Improving the Security of Quantum Protocols via Commit-and-Open
• Universally Composable Quantum Multi-party Computation
• On Everlasting Security in the Hybrid Bounded Storage Model
• Universally Composable Security with Global Setup
• Founding Cryptography on Oblivious Transfer – Efficiently
• Foundations of Cryptography
• Oblivious-Transfer Amplification
• SOFSEM 2005: Theory and Practice of Computer Science
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography

This page was built for publication: Everlasting multi-party computation