| Publication | Date of Publication | Type |
|---|
| Scan, shuffle, rescan: two-prover election audits with untrusted scanners | 2025-05-23 | Paper |
| How to leak a secret: theory and applications of ring signatures | 2025-03-19 | Paper |
Bernoulli Ballot Polling: A Manifest Improvement for Risk-Limiting Audits
Financial Cryptography and Data Security | 2023-08-03 | Paper |
Bernoulli Ballot Polling: A Manifest Improvement for Risk-Limiting Audits
Financial Cryptography and Data Security | 2023-08-03 | Paper |
k-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-election Audits
Financial Cryptography and Data Security | 2023-08-03 | Paper |
| scientific article; zbMATH DE number 7646025 (Why is no real title available?) | 2023-01-25 | Paper |
| scientific article; zbMATH DE number 7526293 (Why is no real title available?) | 2022-05-12 | Paper |
Optimality of correlated sampling strategies
Theory of Computing | 2020-12-17 | Paper |
Leading the field: fortune favors the bold in Thurstonian choice models
Bernoulli | 2019-01-28 | Paper |
Leading the field: fortune favors the bold in Thurstonian choice models
Bernoulli | 2019-01-28 | Paper |
Time-space trade-offs in population protocols
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
RSA Chips (Past/Present/Future) (Extended abstract)
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 2018-07-11 | Paper |
All-or-nothing encryption and the package transform
Fast Software Encryption | 2018-05-09 | Paper |
On the design and security of RC2
Fast Software Encryption | 2018-05-09 | Paper |
| From battlefields to elections: winning strategies of Blotto and auditing games | 2018-03-15 | Paper |
A “Paradoxical” Solution to The Signature Problem
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 2017-04-10 | Paper |
Picture-hanging puzzles
Theory of Computing Systems | 2015-01-21 | Paper |
Picture-hanging puzzles
Theory of Computing Systems | 2015-01-21 | Paper |
The subgraph homeomorphism problem
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Coping with errors in binary search procedures (Preliminary Report)
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
| Introduction to algorithms. | 2013-12-12 | Paper |
\texttt{FlipIt}: the game of ``stealthy takeover''
Journal of Cryptology | 2013-11-15 | Paper |
Defending against the unknown enemy: applying FlipIt to system security
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Tweakable block ciphers
Journal of Cryptology | 2012-09-21 | Paper |
The invertibility of the XOR of rotations of a binary word
International Journal of Computer Mathematics | 2011-04-06 | Paper |
| scientific article; zbMATH DE number 5834960 (Why is no real title available?) | 2011-01-12 | Paper |
| Introduction to algorithms. | 2009-12-11 | Paper |
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
Fast Software Encryption | 2009-08-11 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
| scientific article; zbMATH DE number 5542185 (Why is no real title available?) | 2009-04-09 | Paper |
| scientific article; zbMATH DE number 5542232 (Why is no real title available?) | 2009-04-09 | Paper |
| scientific article; zbMATH DE number 5542186 (Why is no real title available?) | 2009-04-09 | Paper |
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
On the notion of ‘software independence’ in voting systems
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2009-01-21 | Paper |
Lightweight Email Signatures (Extended Abstract)
Lecture Notes in Computer Science | 2008-11-27 | Paper |
| scientific article; zbMATH DE number 2088327 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2081086 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079931 (Why is no real title available?) | 2004-08-03 | Paper |
| scientific article; zbMATH DE number 2079926 (Why is no real title available?) | 2004-08-03 | Paper |
| scientific article; zbMATH DE number 1942411 (Why is no real title available?) | 2003-06-30 | Paper |
| scientific article; zbMATH DE number 1928244 (Why is no real title available?) | 2003-06-15 | Paper |
Piecemeal graph exploration by a mobile robot.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1440890 (Why is no real title available?) | 2002-12-02 | Paper |
| Introduction to algorithms | 2001-10-14 | Paper |
Permutation polynomials modulo 2w
Finite Fields and their Applications | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1302844 (Why is no real title available?) | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1418240 (Why is no real title available?) | 2000-07-19 | Paper |
| scientific article; zbMATH DE number 1455102 (Why is no real title available?) | 2000-06-05 | Paper |
Translucent cryptography -- an alternative to key escrow, and its implementation via fractional oblivious transfer
Journal of Cryptology | 2000-02-04 | Paper |
| scientific article; zbMATH DE number 1142302 (Why is no real title available?) | 1998-05-04 | Paper |
On breaking a Huffman code
IEEE Transactions on Information Theory | 1996-07-31 | Paper |
Diversity-based inference of finite automata
Journal of the ACM | 1995-09-10 | Paper |
A formal model of hierarchical concept learning
Information and Computation | 1995-05-01 | Paper |
Complete variable-length ``fix-free'' codes
Designs, Codes and Cryptography | 1995-02-26 | Paper |
| scientific article; zbMATH DE number 697837 (Why is no real title available?) | 1995-01-08 | Paper |
| scientific article; zbMATH DE number 697831 (Why is no real title available?) | 1994-11-30 | Paper |
| scientific article; zbMATH DE number 503258 (Why is no real title available?) | 1994-09-20 | Paper |
On choosing between experimenting and thinking when learning
Information and Computation | 1994-06-02 | Paper |
| scientific article; zbMATH DE number 503281 (Why is no real title available?) | 1994-02-17 | Paper |
Learning Binary Relations and Total Orders
SIAM Journal on Computing | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 437541 (Why is no real title available?) | 1993-12-15 | Paper |
Inference of finite automata using homing sequences
Information and Computation | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 67637 (Why is no real title available?) | 1992-09-27 | Paper |
Results on learnability and the Vapnik-Chervonenkis dimension
Information and Computation | 1991-01-01 | Paper |
A knapsack-type public key cryptosystem based on arithmetic in finite fields
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Inferring decision trees using the minimum description length principle
Information and Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4188971 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4197454 (Why is no real title available?) | 1988-01-01 | Paper |
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
SIAM Journal on Computing | 1988-01-01 | Paper |
Is the data encryption standard a group? (Results of cycling experiments on DES)
Journal of Cryptology | 1988-01-01 | Paper |
Game tree searching by min/max approximation
Artificial Intelligence | 1988-01-01 | Paper |
Global wire routing in two-dimensional arrays
Algorithmica | 1987-01-01 | Paper |
Network control by Bayesian broadcast
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
Estimating a probability using finite memory
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
Is the Data Encryption Standard a Group? (Preliminary Abstract)
Advances in Cryptology — EUROCRYPT’ 85 | 1986-01-01 | Paper |
Efficient Factoring Based on Partial Information
Advances in Cryptology — EUROCRYPT’ 85 | 1986-01-01 | Paper |
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3854183 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3823652 (Why is no real title available?) | 1983-01-01 | Paper |
How to reuse a “write-once≓ memory
Information and Control | 1982-01-01 | Paper |
Coping with errors in binary search procedures
Journal of Computer and System Sciences | 1980-01-01 | Paper |
Orthogonal Packings in Two Dimensions
SIAM Journal on Computing | 1980-01-01 | Paper |
The subgraph homeomorphism problem
Journal of Computer and System Sciences | 1980-01-01 | Paper |
On the Polyhedral Decision Problem
SIAM Journal on Computing | 1980-01-01 | Paper |
Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam
BIT | 1979-01-01 | Paper |
An \(\Omega((n/lg\,n)^{1/2})\) lower bound on the number of additions necessary to compute 0-1 polynomials over the ring of integer polynomials
Information Processing Letters | 1979-01-01 | Paper |
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM | 1978-01-01 | Paper |
<i>k</i> + 1 Heads Are Better than <i>k</i>
Journal of the ACM | 1978-01-01 | Paper |
Optimal Arrangement of Keys in a Hash Table
Journal of the ACM | 1978-01-01 | Paper |
On recognizing graph properties from adjacency matrices
Theoretical Computer Science | 1977-01-01 | Paper |
On the Worst-Case Behavior of String-Searching Algorithms
SIAM Journal on Computing | 1977-01-01 | Paper |
The game of ''\(N\) questions'' of a tree
Discrete Mathematics | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3558981 (Why is no real title available?) | 1976-01-01 | Paper |
On self-organizing sequential search heuristics
Communications of the ACM | 1976-01-01 | Paper |
Constructing optimal binary decision trees is NP-complete
Information Processing Letters | 1976-01-01 | Paper |
Partial-Match Retrieval Algorithms
SIAM Journal on Computing | 1976-01-01 | Paper |
Linear expected time of a simple union-find algorithm
Information Processing Letters | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3557238 (Why is no real title available?) | 1975-01-01 | Paper |
Expected time bounds for selection
Communications of the ACM | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3463166 (Why is no real title available?) | 1974-01-01 | Paper |
Asymptotic bounds for the number of convex \(n\)-ominoes
Discrete Mathematics | 1974-01-01 | Paper |
A Procedure for Improving the Upper Bound for the Number of <i>n</i>-Ominoes
Canadian Journal of Mathematics | 1973-01-01 | Paper |
Time bounds for selection
Journal of Computer and System Sciences | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3551902 (Why is no real title available?) | 1972-01-01 | Paper |
