Everlasting multi-party computation
type: Item
instance of: scholarly article
title: Everlasting multi-party computation
zbMATH Open document ID: 1442.94047
author: Dominique Unruh
published in: Journal of Cryptology
publication date: 2018-11-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81P94
zbMATH DE Number: 6970571
zbMATH Keywords: quantum cryptography
zbMATH Keywords: everlasting security
zbMATH Keywords: multi-party computation
zbMATH Keywords: universal composability
MaRDI profile type: Publication
full work available at URL: s00145-018-9278-z
OpenAlex ID: W2792145984
cites work: Quantum cryptography: public key distribution and coin tossing
cites work: Theory of Cryptography
cites work: Universally Composable Security with Global Setup
cites work: Q4783717
cites work: Improving the Security of Quantum Protocols via Commit-and-Open
cites work: Q4409144
cites work: Foundations of Cryptography
cites work: On Everlasting Security in the Hybrid Bounded Storage Model
cites work: Q5445491
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: Conditionally-perfect secrecy and a provably-secure randomized cipher
cites work: Long-term security and universal composability
cites work: Q2706552
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: SOFSEM 2005: Theory and Practice of Computer Science
cites work: Universally Composable Quantum Multi-party Computation
cites work: Concurrent Composition in the Bounded Quantum Storage Model
cites work: Quantum Proofs of Knowledge
cites work: Everlasting Multi-party Computation
cites work: Zero-knowledge against quantum attacks
cites work: Oblivious-Transfer Amplification
DOI: 10.1007/S00145-018-9278-Z
description: scientific article; zbMATH DE number 6970571