| Publication | Date of Publication | Type |
|---|
MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably
| 2024-12-13 | Paper |
That's not my signature! Fail-stop signatures for a post-quantum world
| 2024-12-04 | Paper |
Adjacency sketches in adversarial environments
| 2024-11-28 | Paper |
Mirror games against an open book player
| 2024-05-16 | Paper |
scientific article; zbMATH DE number 7829339 (Why is no real title available?)
| 2024-04-09 | Paper |
Adversarial laws of large numbers and optimal regret in online classification
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Out-of-band authenticated group key exchange: from strong authentication to immediate key delivery
| 2023-11-02 | Paper |
Mirror games against an open book player
Theoretical Computer Science | 2023-10-17 | Paper |
Bet-or-pass: adversarially robust Bloom filters
Theory of Cryptography | 2023-08-14 | Paper |
Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
CHIP and CRISP: protecting all parties against compromise through identity-binding PAKEs
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
One-Way Functions and (Im)perfect Obfuscation
SIAM Journal on Computing | 2023-04-04 | Paper |
scientific article; zbMATH DE number 7650404 (Why is no real title available?)
| 2023-02-03 | Paper |
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
SIAM Journal on Computing | 2021-10-18 | Paper |
The power of distributed verifiers in interactive proofs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Incrementally verifiable computation via incremental PCPs
| 2020-04-30 | Paper |
White-box vs. black-box complexity of search problems: Ramsey and graph property testing
Journal of the ACM | 2020-02-11 | Paper |
Bloom filters in adversarial environments
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Hardness-preserving reductions via cuckoo hashing
Journal of Cryptology | 2019-06-20 | Paper |
Fast algorithms for interactive coding
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
The security of lazy users in out-of-band authentication
| 2018-12-06 | Paper |
How to Share a Secret, Infinitely
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Collision resistant hashing for paranoids: dealing with multiple collisions
| 2018-07-09 | Paper |
The journey from NP to TFNP hardness
| 2018-05-03 | Paper |
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Secret-sharing for NP
Journal of Cryptology | 2017-05-22 | Paper |
When can limited randomness be used in repeated games?
Theory of Computing Systems | 2017-02-01 | Paper |
How to Share a Secret, Infinitely
Theory of Cryptography | 2016-12-22 | Paper |
Spooky interaction and its discontents: compilers for succinct two-message argument systems
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Oblivious transfer and polynomial evaluation
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
An optimally fair coin toss
Journal of Cryptology | 2016-09-21 | Paper |
A minimal model for secure computation (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Visual cryptography for grey level images
Information Processing Letters | 2016-06-16 | Paper |
Is there an oblivious RAM lower bound?
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Pure differential privacy for rectangle queries via private partitions
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
Tight bounds for sliding Bloom filters
Algorithmica | 2016-02-19 | Paper |
Bloom filters in adversarial environments
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Magic functions
Journal of the ACM | 2015-11-12 | Paper |
The complexity of online memory checking
Journal of the ACM | 2015-11-11 | Paper |
When can limited randomness be used in repeated games?
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Fast interactive coding against adversarial noise
Journal of the ACM | 2015-08-14 | Paper |
Secure physical computation using disposable circuits
Theory of Cryptography | 2015-07-06 | Paper |
Primary-secondary-resolver membership proof systems
Theory of Cryptography | 2015-07-06 | Paper |
What can be computed locally?
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Anti-persistence
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Communication preserving protocols for secure function evaluation
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
On the complexity of differentially private data release, efficient algorithms and hardness results
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Secret-sharing for \(\mathbf {NP}\)
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Pseudo-random functions and factoring (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Differential privacy under continual observation
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Physical zero-knowledge proofs of physical properties
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Viceroy, a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
Sliding Bloom Filters
Algorithms and Computation | 2014-01-14 | Paper |
Scalable and dynamic quorum systems
Distributed Computing | 2013-06-07 | Paper |
Hardness preserving reductions via cuckoo hashing
Theory of Cryptography | 2013-03-18 | Paper |
Public-key cryptosystems resilient to key leakage
SIAM Journal on Computing | 2012-11-29 | Paper |
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM | 2012-10-30 | Paper |
Sketching in Adversarial Environments
SIAM Journal on Computing | 2012-03-15 | Paper |
Deterministic history-independent strategies for storing information on write-once memories
Theory of Computing | 2011-05-24 | Paper |
On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications
SIAM Journal on Computing | 2010-11-04 | Paper |
scientific article; zbMATH DE number 5771375 (Why is no real title available?)
| 2010-08-16 | Paper |
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Completeness in two-party secure computation: a computational view
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Novel architectures for P2P applications: the continuous-discrete approach
ACM Transactions on Algorithms | 2010-08-14 | Paper |
Public-key encryption in the bounded-retrieval model
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Basing cryptographic protocols on tamper-evident seals
Theoretical Computer Science | 2010-03-10 | Paper |
Hedged public-key encryption: how to protect against bad randomness
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Public-Key Cryptosystems Resilient to Key Leakage
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
Theory of Computing Systems | 2009-08-06 | Paper |
Derandomized constructions of \(k\)-wise (almost) independent permutations
Algorithmica | 2009-07-24 | Paper |
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
Automata, Languages and Programming | 2009-07-14 | Paper |
How Efficient Can Memory Checking Be?
Theory of Cryptography | 2009-03-03 | Paper |
An Optimally Fair Coin Toss
Theory of Cryptography | 2009-03-03 | Paper |
Implementing Huge Sparse Random Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
scientific article; zbMATH DE number 5485579 (Why is no real title available?)
| 2009-01-05 | Paper |
scientific article; zbMATH DE number 5485554 (Why is no real title available?)
| 2009-01-05 | Paper |
History-Independent Cuckoo Hashing
Automata, Languages and Programming | 2008-08-19 | Paper |
On Robust Combiners for Oblivious Transfer and Other Primitives
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Pebbling and Proofs of Work
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Cryptography and Game Theory: Designing Protocols for Exchanging Information
Theory of Cryptography | 2008-03-05 | Paper |
Concurrent zero-knowledge
Journal of the ACM | 2008-01-14 | Paper |
Zaps and Their Applications
SIAM Journal on Computing | 2008-01-03 | Paper |
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Automata, Languages and Programming | 2007-11-28 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
On Everlasting Security in the Hybrid Bounded Storage Model
Automata, Languages and Programming | 2007-09-11 | Paper |
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Completeness in two-party secure computation: A computational view
Journal of Cryptology | 2007-01-24 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Oblivious Polynomial Evaluation
SIAM Journal on Computing | 2006-06-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Fault-Tolerant Storage in a Dynamic Environment
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Computationally secure oblivious transfer
Journal of Cryptology | 2005-05-13 | Paper |
On fairness in the carpool problem
Journal of Algorithms | 2005-05-04 | Paper |
scientific article; zbMATH DE number 1305493 (Why is no real title available?)
| 2004-03-09 | Paper |
scientific article; zbMATH DE number 1775426 (Why is no real title available?)
| 2004-01-27 | Paper |
Nonmalleable Cryptography
SIAM Review | 2004-01-20 | Paper |
Optimal aggregation algorithms for middleware.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
scientific article; zbMATH DE number 1942439 (Why is no real title available?)
| 2003-06-30 | Paper |
On the decisional complexity of problems over the reals
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1842485 (Why is no real title available?)
| 2002-12-08 | Paper |
scientific article; zbMATH DE number 1759344 (Why is no real title available?)
| 2002-11-28 | Paper |
Pseudorandom Functions and Factoring
SIAM Journal on Computing | 2002-09-29 | Paper |
Efficient oblivious transfer protocols
| 2002-09-01 | Paper |
Tracing traitors
IEEE Transactions on Information Theory | 2002-08-15 | Paper |
scientific article; zbMATH DE number 1759782 (Why is no real title available?)
| 2002-08-06 | Paper |
Constructing pseudo-random permutations with a prescribed structure
| 2002-07-22 | Paper |
Constructing pseudo-random permutations with a prescribed structure
Journal of Cryptology | 2002-06-27 | Paper |
scientific article; zbMATH DE number 1256708 (Why is no real title available?)
| 2002-01-20 | Paper |
scientific article; zbMATH DE number 1256679 (Why is no real title available?)
| 2002-01-20 | Paper |
Perfect zero-knowledge arguments for NP using any one-way permutation
Journal of Cryptology | 2001-05-20 | Paper |
scientific article; zbMATH DE number 1583780 (Why is no real title available?)
| 2001-04-03 | Paper |
scientific article; zbMATH DE number 1559534 (Why is no real title available?)
| 2001-02-28 | Paper |
Nonmalleable Cryptography
SIAM Journal on Computing | 2000-10-18 | Paper |
On the construction of pseudorandom permutations: Luby-Rackoff revisited
Journal of Cryptology | 2000-05-22 | Paper |
scientific article; zbMATH DE number 1303127 (Why is no real title available?)
| 2000-05-18 | Paper |
scientific article; zbMATH DE number 1261820 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1418318 (Why is no real title available?)
| 2000-03-19 | Paper |
Rigorous Time/Space Trade-offs for Inverting Functions
SIAM Journal on Computing | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1302852 (Why is no real title available?)
| 2000-03-07 | Paper |
scientific article; zbMATH DE number 1406783 (Why is no real title available?)
| 2000-03-01 | Paper |
scientific article; zbMATH DE number 1406785 (Why is no real title available?)
| 2000-03-01 | Paper |
scientific article; zbMATH DE number 1303151 (Why is no real title available?)
| 1999-11-29 | Paper |
scientific article; zbMATH DE number 1261819 (Why is no real title available?)
| 1999-08-31 | Paper |
scientific article; zbMATH DE number 708807 (Why is no real title available?)
| 1999-08-30 | Paper |
scientific article; zbMATH DE number 708806 (Why is no real title available?)
| 1999-08-30 | Paper |
scientific article; zbMATH DE number 708802 (Why is no real title available?)
| 1999-08-29 | Paper |
scientific article; zbMATH DE number 1256768 (Why is no real title available?)
| 1999-08-16 | Paper |
scientific article; zbMATH DE number 1302868 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1304081 (Why is no real title available?)
| 1999-06-17 | Paper |
Synthesizers and their application to the parallel construction of pseudo-random functions
Journal of Computer and System Sciences | 1999-05-11 | Paper |
scientific article; zbMATH DE number 1256721 (Why is no real title available?)
| 1999-03-01 | Paper |
scientific article; zbMATH DE number 1256784 (Why is no real title available?)
| 1999-03-01 | Paper |
Fairness in Scheduling
Journal of Algorithms | 1999-01-17 | Paper |
An efficient existentially unforgeable signature scheme and its applications
Journal of Cryptology | 1998-12-21 | Paper |
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing | 1998-05-10 | Paper |
scientific article; zbMATH DE number 1088898 (Why is no real title available?)
| 1997-11-18 | Paper |
scientific article; zbMATH DE number 1088244 (Why is no real title available?)
| 1997-11-17 | Paper |
scientific article; zbMATH DE number 1088228 (Why is no real title available?)
| 1997-11-17 | Paper |
Codes for Interactive Authentication
Advances in Cryptology — CRYPTO’ 93 | 1997-09-17 | Paper |
scientific article; zbMATH DE number 1024079 (Why is no real title available?)
| 1997-06-18 | Paper |
scientific article; zbMATH DE number 1003302 (Why is no real title available?)
| 1997-04-23 | Paper |
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
Algorithmica | 1997-03-03 | Paper |
Efficient cryptographic schemes provably as secure as subset sum
Journal of Cryptology | 1997-01-26 | Paper |
What Can be Computed Locally?
SIAM Journal on Computing | 1996-09-15 | Paper |
scientific article; zbMATH DE number 910905 (Why is no real title available?)
| 1996-07-28 | Paper |
Amortized Communication Complexity
SIAM Journal on Computing | 1996-01-28 | Paper |
Optimal File Sharing in Distributed Networks
SIAM Journal on Computing | 1996-01-02 | Paper |
The probabilistic method yields deterministic parallel algorithms
Journal of Computer and System Sciences | 1995-10-24 | Paper |
Search Problems in the Decision Tree Model
SIAM Journal on Discrete Mathematics | 1995-08-06 | Paper |
Three results on interactive communication
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
Nonoblivious hashing
Journal of the ACM | 1994-08-21 | Paper |
Small-Bias Probability Spaces: Efficient Constructions and Applications
SIAM Journal on Computing | 1993-10-10 | Paper |
On dice and coins: Models of computation for random generation
Information and Computation | 1993-08-30 | Paper |
scientific article; zbMATH DE number 176779 (Why is no real title available?)
| 1993-05-18 | Paper |
Coin-Flipping Games Immune against Linear-Sized Coalitions
SIAM Journal on Computing | 1993-05-17 | Paper |
Implicit $O(1)$ Probe Search
SIAM Journal on Computing | 1993-05-16 | Paper |
Implicat Representation of Graphs
SIAM Journal on Discrete Mathematics | 1993-04-01 | Paper |
On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
Mathematical Systems Theory | 1992-09-26 | Paper |
An implicit data structure for searching a multikey table in logarithmic time
Journal of Computer and System Sciences | 1992-06-28 | Paper |
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
SIAM Journal on Discrete Mathematics | 1992-06-25 | Paper |
Bit commitment using pseudorandomness
Journal of Cryptology | 1991-01-01 | Paper |
The hardness of decoding linear codes with preprocessing
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4187086 (Why is no real title available?)
| 1990-01-01 | Paper |
Succinct representation of general unlabeled graphs
Discrete Applied Mathematics | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4117876 (Why is no real title available?)
| 1989-01-01 | Paper |
Fast Parallel Algorithms for Chordal Graphs
SIAM Journal on Computing | 1989-01-01 | Paper |
