31 search results - page 1 / 7 » Efficient Non-malleable Commitment Schemes |
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
ASIACRYPT
2010
Springer
13 years 2 months ago
2010
Springer
We study security amplification for weak bit-commitment schemes and improve the efficiency of (black-box) transformations in both the information-theoretic and computational setti...
ASIACRYPT
2010
Springer
13 years 2 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
TCS
2010
12 years 11 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...
MICRO
2010
IEEE
13 years 2 months ago
2010
IEEE
Recently-proposed architectures that continuously operate on atomic blocks of instructions (also called chunks) can boost the programmability and performance of shared-memory mult...