TCS
2010
13 years 5 months ago
2010
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theor...
CORR
2011
Springer
13 years 5 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 ...
EUROCRYPT
2010
Springer
14 years 3 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...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...