 | 2002 |
|---|
| 30 |       | Donald Beaver:
On Deniability in Quantum Key Exchange.
EUROCRYPT 2002: 352-367 |
| 29 | | Donald Beaver:
Network Security and Storage Security: Symmetries and Symmetry-Breaking.
IEEE Security in Storage Workshop 2002: 3-9 |
| 2000 |
|---|
| 28 | | Donald Beaver:
Minimal-Latency Secure Function Evaluation.
EUROCRYPT 2000: 335-350 |
| 1998 |
|---|
| 27 | | Donald Beaver:
Adaptively Secure Oblivious Transfer.
ASIACRYPT 1998: 300-314 |
| 26 | | Donald Beaver:
One-Time Tables for Two-Party Computation.
COCOON 1998: 361-370 |
| 25 | | Donald Beaver,
Avishai Wool:
Quorum-Based Secure Multi-party Computation.
EUROCRYPT 1998: 375-390 |
| 24 | | Donald Beaver:
Server-Assisted Cryptography.
Workshop on New Security Paradigms 1998: 92-106 |
| 1997 |
|---|
| 23 | | Donald Beaver:
Plug and Play Encryption.
CRYPTO 1997: 75-89 |
| 22 | | Donald Beaver:
Commodity-Based Cryptography (Extended Abstract).
STOC 1997: 446-455 |
| 21 |  | Donald Beaver,
Joan Feigenbaum,
Joe Kilian,
Phillip Rogaway:
Locally Random Reductions: Improvements and Applications.
J. Cryptology 10(1): 17-36 (1997) |
| 1996 |
|---|
| 20 | | Donald Beaver:
Equivocable Oblivious Transfer.
EUROCRYPT 1996: 119-130 |
| 19 | | Donald Beaver:
Correlated Pseudorandomness and the Complexity of Private Computations.
STOC 1996: 479-488 |
| 18 | | Donald Beaver:
Adaptive Zero Knowledge and Computational Equivocation (Extended Abstract).
STOC 1996: 629-638 |
| 1995 |
|---|
| 17 | | Donald Beaver:
Precomputing Oblivious Transfer.
CRYPTO 1995: 97-109 |
| 16 | | Donald Beaver:
Computing with DNA.
Journal of Computational Biology 2(1): 1-7 (1995) |
| 1994 |
|---|
| 15 | | Donald Beaver:
Factoring: The DNA Solution.
ASIACRYPT 1994: 419-423 |
| 1993 |
|---|
| 14 | | Donald Beaver,
Nicol So:
Global, Unpredictable Bit Generation Without Broadcast.
EUROCRYPT 1993: 424-434 |
| 1992 |
|---|
| 13 | | Donald Beaver:
How to Break a "Secure" Oblivious Transfer Protocol.
EUROCRYPT 1992: 285-296 |
| 12 | | Donald Beaver,
Stuart Haber:
Cryptographic Protocols Provably Secure Against Dynamic Adversaries.
EUROCRYPT 1992: 307-323 |
| 1991 |
|---|
| 11 | | Donald Beaver:
Foundations of Secure Interactive Computing.
CRYPTO 1991: 377-391 |
| 10 | | Donald Beaver:
Efficient Multiparty Protocols Using Circuit Randomization.
CRYPTO 1991: 420-432 |
| 9 | | Donald Beaver:
Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority.
J. Cryptology 4(2): 75-122 (1991) |
| 1990 |
|---|
| 8 | | Donald Beaver,
Joan Feigenbaum,
Victor Shoup:
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract).
CRYPTO 1990: 326-338 |
| 7 | | Donald Beaver,
Joan Feigenbaum,
Joe Kilian,
Phillip Rogaway:
Security with Low Communication Overhead.
CRYPTO 1990: 62-76 |
| 6 | | Donald Beaver,
Joan Feigenbaum:
Hiding Instances in Multioracle Queries.
STACS 1990: 37-48 |
| 5 | | Donald Beaver,
Silvio Micali,
Phillip Rogaway:
The Round Complexity of Secure Protocols (Extended Abstract)
STOC 1990: 503-513 |
| 1989 |
|---|
| 4 | | Donald Beaver:
Multiparty Protocols Tolerating Half Faulty Processors.
CRYPTO 1989: 560-572 |
| 3 | | Donald Beaver,
Shafi Goldwasser:
Multiparty Computation with Faulty Majority.
CRYPTO 1989: 589-590 |
| 2 | | Donald Beaver,
Shafi Goldwasser:
Multiparty Computation with Faulty Majority (Extended Announcement)
FOCS 1989: 468-473 |
| 1 | | Judit Bar-Ilan,
Donald Beaver:
Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction.
PODC 1989: 201-209 |
