125
click to vote
TCC
15 years 2 months ago
2004 Springer 
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
121
click to vote
ASIACRYPT
15 years 2 months ago
2004 Springer 
We propose a public-key traitor tracing scheme in which (1) the size of a ciphertext is sublinear in the number of receivers and (2) black-box tracing is efficiently achieved again...
121
click to vote
CRYPTO
15 years 2 months ago
2004 Springer 
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
113
click to vote
CAU
14 years 10 months ago
2004 
Protecting data is not simply a case of encrypt and forget: even data with full cryptographic confidentiality and integrity protection can still be subject to information leakage. ...
103
click to vote
AES
15 years 2 months ago
2004 Springer 
Abstract. While it is known previously that the cycle lengths of individual components of the AES round function are very small, we demonstrate here that the cycle length of the S-...
|
Cryptology