Sciweavers

CRYPTO
1999
Springer
152views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
Radha Poovendran, John S. Baras
CRYPTO
1999
Springer
63views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
Information-Theoretic Cryptography
Ueli M. Maurer
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
CRYPTO
1999
Springer
107views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
Differential Power Analysis
Paul C. Kocher, Joshua Jaffe, Benjamin Jun
CRYPTO
1999
Springer
95views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
Abuse-Free Optimistic Contract Signing
Juan A. Garay, Markus Jakobsson, Philip D. MacKenz...
CRYPTO
1999
Springer
77views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
Efficient Methods for Integrating Traceability and Broadcast Encryption
Eli Gafni, Jessica Staddon, Yiqun Lisa Yin
CRYPTO
1999
Springer
98views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
On Concurrent Zero-Knowledge with Pre-processing
Giovanni Di Crescenzo, Rafail Ostrovsky
CRYPTO
1999
Springer
66views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
On the Security of RSA Padding
Jean-Sébastien Coron, David Naccache, Julie...
CRYPTO
1999
Springer
113views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
Factoring N = prq for Large r
Dan Boneh, Glenn Durfee, Nick Howgrave-Graham
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
13 years 10 months ago
Information Theoretically Secure Communication in the Limited Storage Space Model
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
Yonatan Aumann, Michael O. Rabin