Sciweavers

64 search results - page 6 / 13
» Secure multi-party quantum computation
Sort
View
EUROCRYPT
2003
Springer
14 years 18 days ago
Two-Threshold Broadcast and Detectable Multi-party Computation
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
Matthias Fitzi, Martin Hirt, Thomas Holenstein, J&...
INDOCRYPT
2003
Springer
14 years 17 days ago
On Multiplicative Linear Secret Sharing Schemes
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
14 years 1 months ago
Improving the Security of Quantum Protocols via Commit-and-Open
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
Ivan Damgård, Serge Fehr, Carolin Lunemann, ...
EUROCRYPT
2005
Springer
14 years 27 days ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
CORR
1999
Springer
138views Education» more  CORR 1999»
13 years 7 months ago
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtle...
Hoi-Kwong Lo