36 search results - page 3 / 8 » Statistically-hiding commitment from any one-way function |
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
NDSS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we present an approach for realizing a safe execution environment (SEE) that enables users to “try out” new software (or configuration changes to existing soft...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
The existence of encryption and commitment schemes secure under selective opening attack (SOA) has remained open despite considerable interest and attention. We provide the rst pub...