Sciweavers

19 search results - page 3 / 4
» crypto 1999
Sort
View
84
Voted
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
15 years 2 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
COMCOM
1999
91views more  COMCOM 1999»
14 years 9 months ago
Group-oriented undeniable signature schemes with a trusted center
Undeniable signature is an intriguing concept introduced by Chaum and Antwerpen at Crypto'89. In 1999, Lee and Hwang presented two group-oriented undeniable signature schemes ...
Narn-Yih Lee, Tzonelih Hwang
CRYPTO
1999
Springer
87views Cryptology» more  CRYPTO 1999»
15 years 2 months ago
Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
We prove the equivalence of two definitions of non-malleable encryption appearing in the literature— the original one of Dolev, Dwork and Naor and the later one of Bellare, Desa...
Mihir Bellare, Amit Sahai
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
15 years 2 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
84
Voted
CRYPTO
1999
Springer
152views Cryptology» more  CRYPTO 1999»
15 years 2 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