| 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 |
| https://portal.mardi4nfdi.de/entity/Q6126353 | 2024-04-09 | Paper |
| Adversarial laws of large numbers and optimal regret in online classification | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059368 | 2023-11-02 | Paper |
| Mirror games against an open book player | 2023-10-17 | Paper |
| Bet-or-pass: adversarially robust Bloom filters | 2023-08-14 | Paper |
| Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols | 2023-06-30 | Paper |
| CHIP and CRISP: protecting all parties against compromise through identity-binding PAKEs | 2023-06-28 | Paper |
| One-Way Functions and (Im)perfect Obfuscation | 2023-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875759 | 2023-02-03 | Paper |
| Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations | 2021-10-18 | Paper |
| The Power of Distributed Verifiers in Interactive Proofs | 2021-02-02 | Paper |
| Incrementally verifiable computation via incremental PCPs | 2020-04-30 | Paper |
| White-Box vs. Black-Box Complexity of Search Problems | 2020-02-11 | Paper |
| Bloom Filters in Adversarial Environments | 2019-11-25 | Paper |
| Hardness-preserving reductions via cuckoo hashing | 2019-06-20 | Paper |
| Fast Algorithms for Interactive Coding | 2019-05-15 | Paper |
| The security of lazy users in out-of-band authentication | 2018-12-06 | Paper |
| How to Share a Secret, Infinitely | 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 | 2017-09-29 | Paper |
| Secret-sharing for NP | 2017-05-22 | Paper |
| When can limited randomness be used in repeated games? | 2017-02-01 | Paper |
| How to Share a Secret, Infinitely | 2016-12-22 | Paper |
| Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems | 2016-11-09 | Paper |
| Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption | 2016-10-27 | Paper |
| Oblivious transfer and polynomial evaluation | 2016-09-29 | Paper |
| An optimally fair coin toss | 2016-09-21 | Paper |
| A minimal model for secure computation (extended abstract) | 2016-09-01 | Paper |
| Visual cryptography for grey level images | 2016-06-16 | Paper |
| Is There an Oblivious RAM Lower Bound? | 2016-04-15 | Paper |
| Pure Differential Privacy for Rectangle Queries via Private Partitions | 2016-03-23 | Paper |
| Tight bounds for sliding Bloom filters | 2016-02-19 | Paper |
| Bloom Filters in Adversarial Environments | 2015-12-10 | Paper |
| Magic Functions | 2015-11-12 | Paper |
| The complexity of online memory checking | 2015-11-11 | Paper |
| When can limited randomness be used in repeated games? | 2015-11-04 | Paper |
| Scalable and dynamic quorum systems | 2015-09-04 | Paper |
| Fast Interactive Coding against Adversarial Noise | 2015-08-14 | Paper |
| Secure Physical Computation Using Disposable Circuits | 2015-07-06 | Paper |
| Primary-Secondary-Resolver Membership Proof Systems | 2015-07-06 | Paper |
| What can be computed locally? | 2015-05-07 | Paper |
| Anti-persistence | 2015-02-27 | Paper |
| Communication preserving protocols for secure function evaluation | 2015-02-27 | Paper |
| On the complexity of differentially private data release | 2015-02-04 | Paper |
| Secret-Sharing for NP | 2015-01-06 | Paper |
| Pseudo-random functions and factoring (extended abstract) | 2014-09-26 | Paper |
| Differential privacy under continual observation | 2014-08-13 | Paper |
| Physical Zero-Knowledge Proofs of Physical Properties | 2014-08-07 | Paper |
| Viceroy | 2014-07-25 | Paper |
| Sliding Bloom Filters | 2014-01-14 | Paper |
| Scalable and dynamic quorum systems | 2013-06-07 | Paper |
| Hardness Preserving Reductions via Cuckoo Hashing | 2013-03-18 | Paper |
| Public-Key Cryptosystems Resilient to Key Leakage | 2012-11-29 | Paper |
| Number-theoretic constructions of efficient pseudo-random functions | 2012-10-30 | Paper |
| Sketching in Adversarial Environments | 2012-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002800 | 2011-05-24 | Paper |
| On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications | 2010-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581398 | 2010-08-16 | Paper |
| Know thy neighbor's neighbor | 2010-08-15 | Paper |
| Completeness in two-party secure computation | 2010-08-15 | Paper |
| Novel architectures for P2P applications | 2010-08-14 | Paper |
| Public-Key Encryption in the Bounded-Retrieval Model | 2010-06-01 | Paper |
| Basing cryptographic protocols on tamper-evident seals | 2010-03-10 | Paper |
| Hedged Public-Key Encryption: How to Protect against Bad Randomness | 2009-12-15 | Paper |
| Public-Key Cryptosystems Resilient to Key Leakage | 2009-10-20 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles | 2009-08-06 | Paper |
| Derandomized constructions of \(k\)-wise (almost) independent permutations | 2009-07-24 | Paper |
| De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results | 2009-07-14 | Paper |
| An Optimally Fair Coin Toss | 2009-03-03 | Paper |
| How Efficient Can Memory Checking Be? | 2009-03-03 | Paper |
| Implementing Huge Sparse Random Graphs | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302090 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549727 | 2009-01-05 | Paper |
| History-Independent Cuckoo Hashing | 2008-08-19 | Paper |
| On Robust Combiners for Oblivious Transfer and Other Primitives | 2008-05-06 | Paper |
| Pebbling and Proofs of Work | 2008-03-17 | Paper |
| Cryptography and Game Theory: Designing Protocols for Exchanging Information | 2008-03-05 | Paper |
| Concurrent zero-knowledge | 2008-01-14 | Paper |
| Zaps and Their Applications | 2008-01-03 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Deterministic History-Independent Strategies for Storing Information on Write-Once Memories | 2007-11-28 | Paper |
| Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles | 2007-11-15 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol | 2007-09-24 | Paper |
| Our Data, Ourselves: Privacy Via Distributed Noise Generation | 2007-09-24 | Paper |
| On Everlasting Security in the Hybrid Bounded Storage Model | 2007-09-11 | Paper |
| Receipt-Free Universally-Verifiable Voting with Everlasting Privacy | 2007-09-04 | Paper |
| Completeness in two-party secure computation: A computational view | 2007-01-24 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Oblivious Polynomial Evaluation | 2006-06-01 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Fault-Tolerant Storage in a Dynamic Environment | 2005-08-17 | Paper |
| Computationally secure oblivious transfer | 2005-05-13 | Paper |
| On fairness in the carpool problem | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252382 | 2004-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542559 | 2004-01-27 | Paper |
| Nonmalleable Cryptography | 2004-01-20 | Paper |
| Optimal aggregation algorithms for middleware. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409138 | 2003-06-30 | Paper |
| On the decisional complexity of problems over the reals | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783719 | 2002-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536284 | 2002-11-28 | Paper |
| Pseudorandom Functions and Factoring | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768332 | 2002-09-01 | Paper |
| Tracing traitors | 2002-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536805 | 2002-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768333 | 2002-07-22 | Paper |
| Constructing pseudo-random permutations with a prescribed structure | 2002-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228444 | 2002-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230366 | 2002-01-20 | Paper |
| Perfect zero-knowledge arguments for NP using any one-way permutation | 2001-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707416 | 2001-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526982 | 2001-02-28 | Paper |
| Nonmalleable Cryptography | 2000-10-18 | Paper |
| On the construction of pseudorandom permutations: Luby-Rackoff revisited | 2000-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249642 | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231923 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941880 | 2000-03-19 | Paper |
| Rigorous Time/Space Trade-offs for Inverting Functions | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249336 | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940699 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940701 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249667 | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231922 | 1999-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318694 | 1999-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318695 | 1999-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318690 | 1999-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228504 | 1999-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249354 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250771 | 1999-06-17 | Paper |
| Synthesizers and their application to the parallel construction of pseudo-random functions | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228456 | 1999-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228521 | 1999-03-01 | Paper |
| Fairness in Scheduling | 1999-01-17 | Paper |
| An efficient existentially unforgeable signature scheme and its applications | 1998-12-21 | Paper |
| The Load, Capacity, and Availability of Quorum Systems | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365722 | 1997-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364544 | 1997-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364561 | 1997-11-17 | Paper |
| Codes for Interactive Authentication | 1997-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341773 | 1997-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128932 | 1997-04-23 | Paper |
| Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions | 1997-03-03 | Paper |
| Efficient cryptographic schemes provably as secure as subset sum | 1997-01-26 | Paper |
| What Can be Computed Locally? | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886081 | 1996-07-28 | Paper |
| Amortized Communication Complexity | 1996-01-28 | Paper |
| Optimal File Sharing in Distributed Networks | 1996-01-02 | Paper |
| The probabilistic method yields deterministic parallel algorithms | 1995-10-24 | Paper |
| Search Problems in the Decision Tree Model | 1995-08-06 | Paper |
| Three results on interactive communication | 1994-10-03 | Paper |
| Nonoblivious hashing | 1994-08-21 | Paper |
| Small-Bias Probability Spaces: Efficient Constructions and Applications | 1993-10-10 | Paper |
| On dice and coins: Models of computation for random generation | 1993-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036609 | 1993-05-18 | Paper |
| Coin-Flipping Games Immune against Linear-Sized Coalitions | 1993-05-17 | Paper |
| Implicit $O(1)$ Probe Search | 1993-05-16 | Paper |
| Implicat Representation of Graphs | 1993-04-01 | Paper |
| On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? | 1992-09-26 | Paper |
| An implicit data structure for searching a multikey table in logarithmic time | 1992-06-28 | Paper |
| Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs | 1992-06-28 | Paper |
| A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring | 1992-06-25 | Paper |
| Bit commitment using pseudorandomness | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5751927 | 1990-01-01 | Paper |
| Succinct representation of general unlabeled graphs | 1990-01-01 | Paper |
| The hardness of decoding linear codes with preprocessing | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732126 | 1989-01-01 | Paper |
| Fast Parallel Algorithms for Chordal Graphs | 1989-01-01 | Paper |
