Sciweavers

55 search results - page 5 / 11
» crypto 2004
Sort
View
CRYPTO
2004
Springer
97views Cryptology» more  CRYPTO 2004»
14 years 9 days ago
Efficient Tree-Based Revocation in Groups of Low-State Devices
Abstract. We study the problem of broadcasting confidential information to a collection of n devices while providing the ability to revoke an arbitrary subset of those devices (and...
Michael T. Goodrich, Jonathan Z. Sun, Roberto Tama...
CRYPTO
2004
Springer
205views Cryptology» more  CRYPTO 2004»
14 years 1 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...
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
14 years 8 days ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
WISA
2004
Springer
14 years 1 months ago
Encrypted Watermarks and Linux Laptop Security
The most common way to implement full-disk encryption (as opposed to encrypted file systems) in the GNU/Linux operating system is using the encrypted loop device, known as CryptoL...
Markku-Juhani Olavi Saarinen
CRYPTO
2004
Springer
127views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange
Abstract. In this paper we revisit one of the most popular passwordbased key exchange protocols, namely the OKE (for Open Key Exchange) scheme, proposed by Luck in 1997. Our result...
Dario Catalano, David Pointcheval, Thomas Pornin