Sciweavers

CRYPTO
2004
Springer
205views Cryptology» more  CRYPTO 2004»
15 years 6 months ago
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
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...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
ASIACRYPT
2004
Springer
15 years 6 months ago
A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size Against Self-Defensive Pirates
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...
Tatsuyuki Matsushita, Hideki Imai
158
Voted
TCC
2004
Springer
835views Cryptology» more  TCC 2004»
15 years 6 months ago
On the Possibility of One-Message Weak Zero-Knowledge
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 ...
Boaz Barak, Rafael Pass
151
Voted
CAU
2004
192views Cryptology» more  CAU 2004»
15 years 2 months ago
Encrypted? Randomised? Compromised? (When Cryptographically Secured Data is Not Secure)
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. ...
Mike Bond, Jolyon Clulow
143
Voted
ASIACRYPT
2004
Springer
15 years 4 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini
Cryptology
Top of PageReset Settings