Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CRYPTO
2004
Springer
102views Cryptology» more  CRYPTO 2004»
11 years 5 months ago
Complete Classification of Bilinear Hard-Core Functions
Let f : {0, 1}n {0, 1}l be a one-way function. A function h : {0, 1}n {0, 1}m is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from {0, 1}n...
Thomas Holenstein, Ueli M. Maurer, Johan Sjöd...
CRYPTO
2004
Springer
97views Cryptology» more  CRYPTO 2004»
11 years 5 months 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
126views Cryptology» more  CRYPTO 2004»
11 years 6 months ago
Compressed Pairings
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we s...
Michael Scott, Paulo S. L. M. Barreto
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
11 years 6 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
11 years 6 months ago
Signed Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...
CRYPTO
2004
Springer
91views Cryptology» more  CRYPTO 2004»
11 years 6 months ago
Non-interactive Timestamping in the Bounded Storage Model
A timestamping scheme is non-interactive if a stamper can stamp a document without communicating with any other player. The only communication done is at validation time. Non-Inte...
Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
CRYPTO
2004
Springer
154views Cryptology» more  CRYPTO 2004»
11 years 6 months ago
An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators
Abstract. In this paper we propose a new key recovery attack on irregular clocked keystream generators where the stream is filtered by a nonlinear Boolean function. We show that t...
Håvard Molland, Tor Helleseth
CRYPTO
2004
Springer
121views Cryptology» more  CRYPTO 2004»
11 years 6 months ago
A New Paradigm of Hybrid Encryption Scheme
In this paper, we show that a key encapsulation mechanism (KEM) does not have to be IND-CCA secure in the construction of hybrid encryption schemes, as was previously believed. Tha...
Kaoru Kurosawa, Yvo Desmedt
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
11 years 6 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
books