ASIACRYPT
2005
Springer
14 years 5 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
ASIACRYPT
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
ASIACRYPT
2005
Springer
14 years 5 months ago
2005
Springer
ASIACRYPT
2005
Springer
14 years 5 months ago
2005
Springer
CTRSA
2007
Springer
14 years 5 months ago
2007
Springer
We mathematically explore a model for the shortness and security for passwords that are stored in hashed form. The model is implicitly in the NIST publication [8] and is based on c...
CTRSA
2007
Springer
14 years 5 months ago
2007
Springer
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
CTRSA
2007
Springer
14 years 5 months ago
2007
Springer
FORK-256 is a hash function presented at FSE 2006. Whereas SHA-like designs process messages in one stream, FORK-256 uses four parallel streams for hashing. In this article, we pre...
CTRSA
2007
Springer
14 years 5 months ago
2007
Springer
CTRSA
2007
Springer
14 years 5 months ago
2007
Springer
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
CTRSA
2007
Springer
14 years 5 months ago
2007
Springer
SHACAL-1 is a 160-bit block cipher with variable key length