Papers by topic

Cryptography and Security

Multiparty Secure Computing

Topics: one-time tables (triples); locally random reductions; multilinear extension trick; constant rounds of interaction; single-round latency; surviving any faulty minority; oblivious transfer primitives; commodity-based, server-assisted security.


D. Beaver, K. Chalkias, M. Kelkar, L. Kogias, K. Lewi, L. de Naurois, V. Nikolaenko, A. Roy, A. Sonnino.

STROBE: Stake-based Threshold Random Beacons

IACR ePrint, 2021.


D. Beaver

Minimal Latency Secure Function Evaluation

Advances in Cryptology - Eurocrypt '00 Proceedings, Springer-Verlag LNCS 1807, 2000, 335-350.


D. Beaver, A. Wool.

Quorum-Based Secure Multi-Party Computation

Advances in Cryptology - Eurocrypt '98 Proceedings, Springer-Verlag LNCS 1403, 1998, 375-390.


D. Beaver.

Server-Assisted Cryptography

New Security Paradigms Workshop `98, ACM, 1998, 92-106.


D. Beaver.

One-Time Tables for Two-Party Computation

Computing and Combinatorics - COCOON '98 Proceedings, Springer-Verlag LNCS 1449, 1998, 361-370.


D. Beaver, J. Feigenbaum, J. Kilian, P. Rogaway.

Locally Random Reductions: Improvements and Applications

J. Cryptology 10:1, 1997, 17-36.


D. Beaver.

Commodity-Based Cryptography

Proceedings of the 29th STOC, ACM, 1997, 446-455.


D. Beaver.

Correlated Pseudorandomness and the Complexity of Private Computations

Proceedings of the 28th STOC, ACM, 1996, 479-488.


D. Beaver, S. Haber, P. Winkler.

On the Isolation of a Common Secret

In The Mathematics of Paul Erdös, v. II, R. Graham, J. Nesetril, eds., Springer-Verlag, 1996, 121-135.


D. Beaver.

Precomputing Oblivious Transfer

Advances in Cryptology - Crypto '95 Proceedings, Springer-Verlag LNCS 963, 1995, 97-109.


D. Beaver, N. So.

Global, Unpredictable Bit Generation Without Broadcast

Advances in Cryptology - Eurocrypt '93 Proceedings, Springer-Verlag LNCS 765, 1994, 424-434.


D. Beaver, J. Feigenbaum, R. Ostrovsky, V. Shoup.

Instance-Hiding Proof Systems

J. Cryptology, 1993.


D. Beaver.

Efficient Multiparty Protocols Using Circuit Randomization

Advances in Cryptology - Crypto '91 Proceedings, Springer-Verlag LNCS 576, 1992, 420-432.


D. Beaver.

Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority

J. Cryptology 4:2, 1991, 75-122.


D. Beaver.

Security, Fault-Tolerance, and Communication Complexity for Distributed Systems

PhD Thesis, Harvard University, 1990.


D. Beaver, S. Micali, P. Rogaway.

The Round Complexity of Secure Protocols

Proceedings of the 22nd STOC, ACM, 1990, 503-513.


D. Beaver, J. Feigenbaum, V. Shoup.

Hiding Instances in Zero-Knowledge Proof Systems

Advances in Cryptology - Crypto '90 Proceedings, Springer-Verlag LNCS 537, 1991, 326-338.


D. Beaver, J. Feigenbaum.

Hiding Instances in Multioracle Queries

Proceedings of the 7th STACS, Springer-Verlag LNCS 415, 1990, 37-48.


D. Beaver, J. Feigenbaum, J. Kilian, P. Rogaway.

Security with Low Communication Overhead

Advances in Cryptology - Crypto '90 Proceedings, Springer-Verlag LNCS 537, 1991, 62-76.


D. Beaver.

Perfect Privacy for Two-Party Protocols

Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October 1989, 65-78.


D. Beaver, S. Goldwasser.

Multiparty Computation with Faulty Majority

Proceedings of the 30th FOCS, IEEE, 1989, 468-473.


J. Bar-Ilan, D. Beaver.

Non-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction

Proceedings of PODC, ACM, 1989, 201-209.



Equivocation, Deniability, and Security Against Dynamic Attacks

Topics: deniable encryption; equivocation in encryption and oblivious transfer.


D. Beaver.

Imperfections in Perfectly Secure Key Exchange

IEEE Information Theory and Networking Workshop, Metsovo, Greece, 1999.

[unavailable]


D. Beaver.

Adaptively Secure Oblivious Transfer

Advances in Cryptology - Asiacrypt '98 Proceedings, Springer-Verlag LNCS 1514, 1998, 300-314.


D. Beaver.

Plug-And-Play Encryption

Advances in Cryptology - Crypto '97 Proceedings, Springer-Verlag LNCS 1294, 1997, 75-89.


D. Beaver.

Plausible Deniability

Advances in Cryptology - Pragocrypt '96 Proceedings, CTU Publishing House, 1996, 272-288.


D. Beaver.

Equivocable Oblivious Transfer

Advances in Cryptology - Eurocrypt '96 Proceedings, Springer-Verlag LNCS 1070, 1996, 119-130.


D. Beaver.

Adaptive Zero Knowledge and Computational Equivocation

Proceedings of the 28th STOC, ACM, 1996, 629-638.


D. Beaver, S. Haber.

Cryptographic Protocols Provably Secure Against Dynamic Adversaries

Advances in Cryptology - Eurocrypt '92 Proceedings, Springer-Verlag LNCS 658, 1993, 307-323.



Formal Security Proofs

Topics: proof models for security reductions; verification and security flaws.


D. Beaver.

How to Break a `Secure' Oblivious Transfer Protocol

Advances in Cryptology - Eurocrypt '92 Proceedings, Springer-Verlag LNCS 658, 1993, 285-296.


D. Beaver.

Foundations of Secure Interactive Computing

Advances in Cryptology - Crypto '91 Proceedings, Springer-Verlag LNCS 576, 1992, 377-391.


D. Beaver.

Formal Definitions for Secure Distributed Protocols

Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October 1989, 47-64.



Quantum Computing and Cryptography

Topics: entanglement in quantum cryptography.

D. Beaver

On Deniability in Quantum Key Exchange

Advances in Cryptology - Eurocrypt '02 Proceedings, Springer-Verlag LNCS 2332, 2002, 352-367.




Systems

Observability

B. Sigelman, L. Andre Barroso, M. Burrows, P. Stephenson, M. Plakal, D. Beaver, S. Jaspan, C. Shanbhag

Dapper, a Large-Scale Distributed Systems Tracing Infrastructure

Google Technical Report dapper-2010-1, 2010.


Validation and Testing

D. Beaver.

Software Integrity and Validation using Cryptographic Composability and Computer Vision

CSCML 2021.


Secure Storage


D. BeaverNetwork Security and Storage Security: Symmetries and Symmetry Breaking

IEEE Security in Storage Workshop '02, 3-9.

Bioinformatics

Algorithms

Topics: genome shuffling.


V. Bafna, D. Beaver, M. Furer, P. Pevzner.

Circular Permutations and Genome Shuffling

In Comparative Genomics: Empirical and Analytic Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families. Kluwer Press, v. 1, D. Sankoff, J. Nadeau, eds., 2000.

[pdf]


Molecular Computing

Topics: first molecular Turing machine design; limits of massively parallel molecular computations.


D. Beaver.

Computing With DNA

Journal of Computational Biology 2:1, 1995, 1-7.

[pdf] [ps]

D. Beaver.

A Universal Molecular Computer

In DNA Based Computers, Richard Lipton, Eric Baum, eds., American Mathematical Society, 1995, 29-36.

[pdf] [ps]

D. Beaver.

Factoring: The DNA Solution

Advances in Cryptology - Asiacrypt '94 Proceedings, Springer-Verlag LNCS 917, 1995, 419-423.

[pdf] [ps]