14 search results - page 1 / 3 » Quantum commitments from complexity assumptions |
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
TCC
2004
Springer
13 years 10 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
EUROCRYPT
2010
Springer
13 years 9 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...