Searching for authors named "Tal Rabin" – sorted by Relevance.
-
A Simplified Approach to Threshold and Proactive RSA
- A Simplified Approach to Threshold and Proactive RSA Tal Rabin IBM T.J. Watson Research Center PO
- Cited by 69 (1 self) – Add To MetaCart
-
Universal Composition with Joint State
- Universal Composition with Joint State Ran Canetti Tal Rabin April 12, 2002 Abstract We
- Cited by 37 (4 self) – Add To MetaCart
-
Fast Asynchronous Byzantine Agreement with Optimal Resilience
- Fast Asynchronous Byzantine Agreement with Optimal Resilience Ran Canetti y Tal Rabin z IBM T
- Cited by 43 (0 self) – Add To MetaCart
-
Chameleon Hashing and Signatures
- Chameleon Hashing and Signatures Hugo Krawczyk Tal Rabin y October 1997 Abstract We introduce
- Cited by 19 (0 self) – Add To MetaCart
-
Revisiting the Distributed Key Generation for Discrete-Log Based Cryptosystems
- T.J.Watson Research Stanislaw Jarecki Stanford University Hugo Krawczyk IBM T.J.Watson Research Tal
- Cited by 3 (0 self) – Add To MetaCart
-
An Efficient Signature Scheme for Route Aggregation
- An Ecient Signature Scheme for Route Aggregation Suresh Chari 1 Tal Rabin 1 Ronald Rivest 2 1
- Cited by 3 (0 self) – Add To MetaCart
-
Protocol Initialization for the Framework of Universal Composability
- y Tal Rabin y January 8, 2004 Abstract Universally composable protocols (Canetti, FOCS 2000
- Cited by 4 (2 self) – Add To MetaCart
-
Secure Distributed Storage and Retrieval
- Secure Distributed Storage and Retrieval Juan A. Garay Rosario Gennaro Charanjit Jutla Tal Rabin
- Cited by 32 (1 self) – Add To MetaCart
-
Randomness extraction and key derivation using the CBC, cascade and HMAC modes
- , Rosario Gennaro 2 , Johan H˚astad 3 , Hugo Krawczyk 4 , and Tal Rabin 2 1 New York University. E
- Cited by 15 (2 self) – Add To MetaCart
-
The Round Complexity of Verifiable Secret Sharing and Secure Multicast
- Ishai y Eyal Kushilevitz z Tal Rabin x ABSTRACT The round complexity of interactive protocols
- Cited by 13 (4 self) – Add To MetaCart

