Everlasting Multi-party Computation
From MaRDI portal
Publication:2849407
DOI10.1007/978-3-642-40084-1_22zbMath1317.81068OpenAlexW11539944WikidataQ62038919 ScholiaQ62038919MaRDI QIDQ2849407
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
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (7)
Everlasting UC commitments from fully malicious PUFs ⋮ Certified everlasting zero-knowledge proof for QMA ⋮ Cryptography with certified deletion ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Circuit amortization friendly encodingsand their application to statistically secure multiparty computation ⋮ Quantum cryptography beyond quantum key distribution ⋮ Everlasting multi-party computation
This page was built for publication: Everlasting Multi-party Computation
