Everlasting multi-party computation

DOI10.1007/978-3-642-40084-1_22MaRDI QIDQ2849407zbMATH OpenOpenAlexWikidataFDO

Authors Dominique Unruh

Publication date 17 September 2013

Published in Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Everlasting multi-party computation
• Long-term security and universal composability
• On Everlasting Security in the Hybrid Bounded Storage Model
• Everlasting security in the bounded storage model
• Universally composable quantum multi-party computation

Cited in

(11)

• Everlasting multi-party computation
• Everlasting UC commitments from fully malicious PUFs
• Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
• Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
• Modeling Computational Security in Long-Lived Systems
• Certified everlasting zero-knowledge proof for QMA
• Cryptography with certified deletion
• Signature schemes with randomized verification
• Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
• Post-quantum zero-knowledge with space-bounded simulation
• Quantum cryptography beyond quantum key distribution

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

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