Everlasting multi-party computation

DOI10.1007/S00145-018-9278-ZMaRDI QIDQ1994636zbMATH OpenOpenAlexFDO

Authors Dominique Unruh

Publication date 1 November 2018

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

everlasting securitymulti-party computationquantum cryptographyuniversal composability

Mathematics Subject Classification ID

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

Cites work

• Concurrent composition in the bounded quantum storage model
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Everlasting multi-party computation
• Foundations of Cryptography
• Founding Cryptography on Oblivious Transfer – Efficiently
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 1942445 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Improving the Security of Quantum Protocols via Commit-and-Open
• Long-term security and universal composability
• Oblivious-Transfer Amplification
• On Everlasting Security in the Hybrid Bounded Storage Model
• On lattices, learning with errors, random linear codes, and cryptography
• Quantum cryptography: public key distribution and coin tossing
• Quantum proofs of knowledge
• SOFSEM 2005: Theory and Practice of Computer Science
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Universally composable quantum multi-party computation
• Universally Composable Security with Global Setup
• Universally composable zero-knowledge arguments and commitments from signature cards

Cited in

(1)

• Everlasting multi-party computation

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 Q1994636)