Sciweavers

62 search results - page 6 / 13
» Classical Knowledge for Quantum Security
Sort
View
FOCS
2006
IEEE
15 years 4 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
15 years 4 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 4 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
81
Voted
CORR
2007
Springer
150views Education» more  CORR 2007»
14 years 10 months ago
Composable Security in the Bounded-Quantum-Storage Model
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...
Stephanie Wehner, Jürg Wullschleger
QUANTUMCOMM
2009
Springer
15 years 4 months ago
The Case for Quantum Key Distribution
Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. We argue that QKD will be an important part of future cryptographic infrastructur...
Douglas Stebila, Michele Mosca, Norbert Lütke...