Sciweavers

397 search results - page 62 / 80
» Pseudorandom Functions and Lattices
Sort
View
97
Voted
ICCAD
1997
IEEE
126views Hardware» more  ICCAD 1997»
15 years 5 months ago
An output encoding problem and a solution technique
We present a new output encoding problem as follows: Given a specification table, such as a truth table or a finite state machine state table, where some of the outputs are specif...
Subhasish Mitra, LaNae J. Avra, Edward J. McCluske...
FC
2006
Springer
107views Cryptology» more  FC 2006»
15 years 4 months ago
Efficient Broadcast Encryption Scheme with Log-Key Storage
In this paper, we present a broadcast encryption scheme with efficient transmission cost under the log-key restriction. Given n users and r revoked users, our scheme has the trans...
Yong Ho Hwang, Pil Joong Lee
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
15 years 4 months ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat
ASIACRYPT
2008
Springer
15 years 3 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters
CCS
2008
ACM
15 years 3 months ago
Mutual authentication in RFID: security and privacy
In RFID protocols, tags identify and authenticate themselves to readers. At Asiacrypt 2007, Vaudenay studied security and privacy models for these protocols. We extend this model ...
Radu-Ioan Paise, Serge Vaudenay