Searching for authors named "Charles Rackoff" – sorted by Relevance.
13 documents found, showing 1 through 10.
Next 10 →
-
On the Complexity of the Theories of Weak Direct Products
- … of length n, where c is some constant. This result is strengthened by Ferrante and Rackoff[4 ], who show…
- Cited by 2 (0 self) – Add To MetaCart
-
CBC MAC for Real-Time Data Sources
- …CBC MAC for Real-Time Data Sources Erez Petrank Charles Rackoff y Abstract The Cipher Block…
- Cited by 31 (0 self) – Add To MetaCart
-
Key Exchange Using Passwords and Long Keys
- …Key Exchange Using Passwords and Long Keys ⋆ Vladimir Kolesnikov and Charles Rackoff Dept. Comp…
- Cited by 2 (2 self) – Add To MetaCart
-
Abstract
- … University of Toronto Toronto, Canada ajuma@(email omitted); Charles Rackoff Department of Computer Science…
- Add To MetaCart
-
Efficient Consistency Proofs on a Committed Database
- …Efficient Consistency Proofs on a Committed Database Rafail Ostrovsky ∗ Charles Rackoff † Adam…
- Cited by 7 (1 self) – Add To MetaCart
-
Simple permutations mix well
- …Simple Permutations Mix Well Shlomo Hoory a Avner Magen b Steven Myers c Charles Rackoff b a…
- Cited by 2 (1 self) – Add To MetaCart
-
Efficient Consistency Proofs for Generalized Queries on Committed Database
- … , Charles Rackoff 2 , and Adam Smith 3 1 UCLA Dept. of Computer Science, Los Angeles, CA, USA. rafail…
- Cited by 9 (1 self) – Add To MetaCart
-
Lower Bounds for Zero Knowledge on the Internet
- …Lower Bounds for Zero Knowledge on the Internet Joe Kilian Erez Petrank y Charles Rackoff z…
- Cited by 42 (6 self) – Add To MetaCart
-
The knowledge complexity of interactive proof systems
- … Micali Charles Rackoff MIT MIT University of Toronto 1. Introduction In the first part of the paper we…
- Cited by 722 (28 self) – Add To MetaCart
-
Lower Bounds for Concurrent Zero Knowledge
- …Lower Bounds for Concurrent Zero Knowledge Joe Kilian y Erez Petrank z Charles Rackoff x…
- Cited by 3 (2 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
