| Publication | Date of Publication | Type |
|---|
| Tri-state circuits. A circuit model that captures RAM | 2024-02-06 | Paper |
| Succinct arguments for RAM programs via projection codes | 2024-02-02 | Paper |
| List oblivious transfer and applications to round-optimal black-box multiparty coin tossing | 2024-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090888 | 2023-11-20 | Paper |
| Prio+: privacy preserving aggregate statistics via Boolean shares | 2023-07-25 | Paper |
| Streaming and unbalanced PSI from function secret sharing | 2023-07-25 | Paper |
| Authenticated garbling from simple correlations | 2023-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6107254 | 2023-07-03 | Paper |
| How to build a trapdoor function from an encryption scheme | 2023-05-12 | Paper |
| Oblivious transfer from trapdoor permutations in minimal rounds | 2023-04-13 | Paper |
| Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups | 2022-12-16 | Paper |
| Efficient 3-party distributed ORAM | 2022-12-16 | Paper |
| On succinct arguments and witness encryption from groups | 2022-11-09 | Paper |
| \textsc{EpiGRAM}: practical garbled RAM | 2022-08-30 | Paper |
| Garbled circuits with sublinear evaluator | 2022-08-30 | Paper |
| Adaptively secure computation for RAM programs | 2022-08-30 | Paper |
| Secure commitment against a powerful adversary | 2022-08-18 | Paper |
| CNF-FSS and Its Applications | 2022-07-08 | Paper |
| Succinct non-interactive arguments via linear interactive proofs | 2022-05-10 | Paper |
| ATLAS: efficient and scalable MPC in the honest majority setting | 2022-04-22 | Paper |
| A refined approximation for Euclidean \(k\)-means | 2022-04-07 | Paper |
| Round optimal secure multiparty computation from minimal assumptions | 2022-03-23 | Paper |
| Threshold garbled circuits and ad hoc secure computation | 2021-12-08 | Paper |
| Efficient range-trapdoor functions and applications: rate-1 OT and more | 2021-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002775 | 2021-07-28 | Paper |
| Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND | 2021-03-30 | Paper |
| Adaptive garbled RAM from laconic oblivious transfer | 2020-06-30 | Paper |
| Continuously non-malleable codes in the split-state model from minimal assumptions | 2020-06-30 | Paper |
| Oblivious sampling with applications to two-party \(k\)-means clustering | 2020-06-15 | Paper |
| UC-secure multiparty computation from one-way functions using stateless tokens | 2020-05-05 | Paper |
| Lower and upper bounds on the randomness complexity of private computations of AND | 2020-04-30 | Paper |
| Efficient Error-Correcting Codes for Sliding Windows | 2020-03-26 | Paper |
| Trapdoor hash functions and their applications | 2020-03-09 | Paper |
| Universally composable secure computation with corrupted tokens | 2020-03-09 | Paper |
| Reusable non-interactive secure computation | 2020-03-09 | Paper |
| Cryptographic sensing | 2020-03-09 | Paper |
| Private anonymous data access | 2020-02-06 | Paper |
| A stable marriage requires communication | 2019-12-12 | Paper |
| Population Stability | 2019-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743385 | 2019-05-10 | Paper |
| Non-interactive secure computation from one-way functions | 2019-01-23 | Paper |
| Round optimal black-box ``commit-and-prove | 2018-12-11 | Paper |
| Information-theoretic broadcast with dishonest majority for long messages | 2018-12-11 | Paper |
| Improved algorithms for optimal embeddings | 2018-11-05 | Paper |
| Proactive secure multiparty computation with a dishonest majority | 2018-10-17 | Paper |
| Matrix Balancing in Lp Norms: Bounding the Convergence Rate of Osborne's Iteration | 2018-07-16 | Paper |
| Coding for Interactive Communication Correcting Insertions and Deletions | 2018-06-27 | Paper |
| On the message complexity of secure multiparty computation | 2018-05-16 | Paper |
| Space-time tradeoffs for distributed verification | 2018-04-12 | Paper |
| Efficient robust secret sharing from expander graphs | 2018-01-29 | Paper |
| Round-optimal secure two-party computation from trapdoor permutations | 2018-01-19 | Paper |
| Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds | 2018-01-19 | Paper |
| Resettably-sound resettable zero knowledge in constant rounds | 2018-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598168 | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598200 | 2017-12-19 | Paper |
| Black-box parallel garbled RAM | 2017-11-15 | Paper |
| Four-round concurrent non-malleable commitments from one-way functions | 2017-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4591370 | 2017-11-14 | Paper |
| The price of low communication in secure multi-party computation | 2017-11-03 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| A Stable Marriage Requires Communication | 2017-10-05 | Paper |
| Memory-efficient and self-stabilizing network RESET (extended abstract) | 2017-09-29 | Paper |
| Faster computation on directed networks of automata | 2017-09-29 | Paper |
| Randomness vs. fault-tolerance | 2017-09-29 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365019 | 2017-09-29 | Paper |
| Space-time tradeoffs for distributed verification | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351923 | 2017-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351934 | 2017-08-31 | Paper |
| Error-Correcting Codes for Automatic Control | 2017-08-08 | Paper |
| Circuit-Private Multi-key FHE | 2017-06-13 | Paper |
| Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs | 2017-06-13 | Paper |
| The Hidden Graph Model | 2017-05-19 | Paper |
| Secure Message Transmission With Small Public Discussion | 2017-05-16 | Paper |
| Optimal Coding for Streaming Authentication and Interactive Communication | 2017-04-28 | Paper |
| Adaptively Secure Garbled Circuits from One-Way Functions | 2016-11-09 | Paper |
| Concurrent Non-Malleable Commitments (and More) in 3 Rounds | 2016-11-09 | Paper |
| High-Precision Secure Computation of Satellite Collision Probabilities | 2016-10-21 | Paper |
| Proactive Secret Sharing with a Dishonest Majority | 2016-10-21 | Paper |
| Subquadratic approximation algorithms for clustering problems in high dimensional spaces | 2016-09-29 | Paper |
| Secure computation with honest-looking parties (extended abstract) | 2016-09-29 | Paper |
| Lower bounds for high dimensional nearest neighbor search and related problems | 2016-09-29 | Paper |
| Simple and efficient leader election in the full information model | 2016-09-01 | Paper |
| Computational complexity and knowledge complexity (extended abstract) | 2016-09-01 | Paper |
| Unconditionally Secure Computation with Reduced Interaction | 2016-07-15 | Paper |
| Private Large-Scale Databases with Distributed Searchable Symmetric Encryption | 2016-04-08 | Paper |
| Adaptive Security with Quasi-Optimal Rate | 2016-03-23 | Paper |
| Fast Distributed Almost Stable Matchings | 2016-03-23 | Paper |
| Communication-Optimal Proactive Secret Sharing for Dynamic Groups | 2016-03-10 | Paper |
| Amortizing randomness in private multiparty computations | 2016-03-02 | Paper |
| Universal service-providers for database private information retrieval (extended abstract) | 2016-03-02 | Paper |
| On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols | 2016-02-19 | Paper |
| Almost-everywhere secure computation with edge corruptions | 2016-01-11 | Paper |
| Impossibility of Black-Box Simulation Against Leakage Attacks | 2015-12-10 | Paper |
| Cryptography with One-Way Communication | 2015-12-10 | Paper |
| Round-Optimal Black-Box Two-Party Computation | 2015-12-10 | Paper |
| Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting | 2015-12-10 | Paper |
| Efficient and secure authenticated key exchange using weak passwords | 2015-12-07 | Paper |
| Polynomial-time approximation schemes for geometric min-sum median clustering | 2015-10-30 | Paper |
| Broadcast (and Round) Efficient Verifiable Secret Sharing | 2015-09-30 | Paper |
| Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World | 2015-09-30 | Paper |
| Locally Decodable Codes for Edit Distance | 2015-09-24 | Paper |
| Weighted sampling without replacement from data streams | 2015-09-15 | Paper |
| Optimal and efficient clock synchronization under drifting clocks | 2015-09-11 | Paper |
| Fast and unconditionally secure anonymous channel | 2015-09-03 | Paper |
| How to withstand mobile virus attacks, revisited | 2015-09-03 | Paper |
| Garbled RAM From One-Way Functions | 2015-08-21 | Paper |
| Privacy amplification with asymptotically optimal entropy loss | 2015-08-14 | Paper |
| Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way | 2015-07-06 | Paper |
| Non-committing Encryption from Φ-hiding | 2015-07-06 | Paper |
| Black-box non-black-box zero knowledge | 2015-06-26 | Paper |
| How to withstand mobile virus attacks (extended abstract) | 2015-06-19 | Paper |
| Local correctability of expander codes | 2015-06-09 | Paper |
| Efficient Error-Correcting Codes for Sliding Windows | 2015-01-13 | Paper |
| Authenticated adversarial routing | 2015-01-07 | Paper |
| Position-Based Cryptography | 2014-11-14 | Paper |
| Communication-Efficient MPC for General Adversary Structures | 2014-10-14 | Paper |
| On Selective-Opening Attacks against Encryption Schemes | 2014-10-14 | Paper |
| On linear-size pseudorandom generators and hardcore functions | 2014-10-06 | Paper |
| How to catch \(L_2\)-heavy-hitters on sliding windows | 2014-10-06 | Paper |
| Cryptography in the multi-string model | 2014-09-25 | Paper |
| Measuring independence of datasets | 2014-08-13 | Paper |
| Zero-one frequency laws | 2014-08-13 | Paper |
| Privacy amplification with asymptotically optimal entropy loss | 2014-08-13 | Paper |
| Maliciously Circuit-Private FHE | 2014-08-07 | Paper |
| Secure Multi-Party Computation with Identifiable Abort | 2014-08-07 | Paper |
| Extracting Correlations | 2014-07-25 | Paper |
| On Input Indistinguishable Proof Systems | 2014-07-01 | Paper |
| Position-Based Quantum Cryptography: Impossibility and Constructions | 2014-06-04 | Paper |
| Garbled RAM Revisited | 2014-05-27 | Paper |
| Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing | 2014-03-25 | Paper |
| Cross-Domain Secure Computation | 2014-03-25 | Paper |
| Statistical Concurrent Non-malleable Zero Knowledge | 2014-02-18 | Paper |
| 4-Round Resettably-Sound Zero Knowledge | 2014-02-18 | Paper |
| Locally Updatable and Locally Decodable Codes | 2014-02-18 | Paper |
| New Techniques for Noninteractive Zero-Knowledge | 2014-02-17 | Paper |
| The effectiveness of lloyd-type methods for the k-means problem | 2014-02-17 | Paper |
| Building Lossy Trapdoor Functions from Lossy Encryption | 2013-12-10 | Paper |
| Constant-Round Concurrent Zero Knowledge in the Bounded Player Model | 2013-12-10 | Paper |
| Approximating Large Frequency Moments with Pick-and-Drop Sampling | 2013-10-04 | Paper |
| Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams | 2013-10-04 | Paper |
| Optimal Coding for Streaming Authentication and Interactive Communication | 2013-09-17 | Paper |
| Nearly Simultaneously Resettable Black-Box Zero Knowledge | 2013-08-12 | Paper |
| How Hard Is Counting Triangles in the Streaming Model? | 2013-08-06 | Paper |
| Local Correctability of Expander Codes | 2013-08-06 | Paper |
| Robust Pseudorandom Generators | 2013-08-06 | Paper |
| Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles | 2013-06-27 | Paper |
| On Linear-Size Pseudorandom Generators and Hardcore Functions | 2013-06-11 | Paper |
| How to Catch L 2-Heavy-Hitters on Sliding Windows | 2013-06-11 | Paper |
| Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions | 2013-05-31 | Paper |
| How to Garble RAM Programs? | 2013-05-31 | Paper |
| Cryptography Using Captcha Puzzles | 2013-04-19 | Paper |
| Concurrent Zero Knowledge in the Bounded Player Model | 2013-03-18 | Paper |
| Succinct Non-interactive Arguments via Linear Interactive Proofs | 2013-03-18 | Paper |
| Distributed Oblivious RAM for Secure Two-Party Computation | 2013-03-18 | Paper |
| Revisiting Lower and Upper Bounds for Selective Decommitments | 2013-03-18 | Paper |
| Edge Fault Tolerance on Sparse Networks | 2012-11-01 | Paper |
| Multiparty Proximity Testing with Dishonest Majority from Equality Testing | 2012-11-01 | Paper |
| Near-optimal radio use for wireless network synchronization | 2012-10-11 | Paper |
| 5PM: Secure Pattern Matching | 2012-09-25 | Paper |
| Impossibility Results for Static Input Secure Computation | 2012-09-25 | Paper |
| Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority | 2012-09-25 | Paper |
| On Homomorphic Encryption and Chosen-Ciphertext Security | 2012-07-20 | Paper |
| Correlated Product Security from Any One-Way Function | 2012-07-20 | Paper |
| Extended-DDH and Lossy Trapdoor Functions | 2012-07-20 | Paper |
| Unconditionally-Secure Robust Secret Sharing with Compact Shares | 2012-06-29 | Paper |
| Identifying Cheaters without an Honest Majority | 2012-06-15 | Paper |
| Resettable Statistical Zero Knowledge | 2012-06-15 | Paper |
| Simultaneously Resettable Arguments of Knowledge | 2012-06-15 | Paper |
| Optimal sampling from sliding windows | 2012-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113742 | 2012-01-23 | Paper |
| Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security | 2011-12-02 | Paper |
| Deterministic and Energy-Optimal Wireless Synchronization | 2011-10-28 | Paper |
| Public Key Locally Decodable Codes with Short Keys | 2011-08-17 | Paper |
| Position-Based Quantum Cryptography: Impossibility and Constructions | 2011-08-12 | Paper |
| Constant-Rate Oblivious Transfer from Noisy Channels | 2011-08-12 | Paper |
| Secure Message Transmission by Public Discussion: A Brief Survey | 2011-06-08 | Paper |
| Efficient Non-interactive Secure Computation | 2011-05-27 | Paper |
| Visual cryptography on graphs | 2011-02-18 | Paper |
| Effective Computations on Sliding Windows | 2011-01-17 | Paper |
| Public-Key Encryption with Efficient Amortized Updates | 2010-09-10 | Paper |
| Asynchronous Throughput-Optimal Routing in Malicious Networks | 2010-09-07 | Paper |
| Improved Fault Tolerance and Secure Computation on Sparse Networks | 2010-09-07 | Paper |
| Password-Authenticated Session-Key Generation on the Internet in the Plain Model | 2010-08-24 | Paper |
| Equivalence of Uniform Key Agreement and Composition Insecurity | 2010-08-24 | Paper |
| Low distortion embeddings for edit distance | 2010-08-16 | Paper |
| Batch codes and their applications | 2010-08-15 | Paper |
| Universally composable two-party and multi-party secure computation | 2010-08-05 | Paper |
| Zero-Knowledge Proofs from Secure Multiparty Computation | 2010-07-07 | Paper |
| Secure Message Transmission with Small Public Discussion | 2010-06-01 | Paper |
| On Complete Primitives for Fairness | 2010-02-24 | Paper |
| Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge | 2010-02-24 | Paper |
| Near-Optimal Radio Use for Wireless Network Synchronization | 2010-01-05 | Paper |
| Position Based Cryptography | 2009-10-20 | Paper |
| Public Key Encryption That Allows PIR Queries | 2009-03-10 | Paper |
| Cryptography in the Multi-string Model | 2009-03-10 | Paper |
| Simulation-Based Concurrent Non-malleable Commitments and Decommitments | 2009-03-03 | Paper |
| Authenticated Adversarial Routing | 2009-03-03 | Paper |
| Circular-Secure Encryption from Decision Diffie-Hellman | 2009-02-10 | Paper |
| Public-Key Locally-Decodable Codes | 2009-02-10 | Paper |
| Communication Complexity in Algebraic Two-Party Protocols | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549593 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549728 | 2009-01-05 | Paper |
| Low distortion embeddings for edit distance | 2008-12-21 | Paper |
| Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model | 2008-08-19 | Paper |
| Visual Cryptography on Graphs | 2008-07-10 | Paper |
| Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems | 2008-05-27 | Paper |
| Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions | 2008-05-15 | Paper |
| Almost-Everywhere Secure Computation | 2008-04-15 | Paper |
| Private Searching on Streaming Data | 2008-03-17 | Paper |
| Private searching on streaming data | 2007-12-06 | Paper |
| Private Locally Decodable Codes | 2007-11-28 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Perfect Non-interactive Zero Knowledge for NP | 2007-09-24 | Paper |
| Sequential Aggregate Signatures and Multisignatures Without Random Oracles | 2007-09-24 | Paper |
| A Survey of Single-Database Private Information Retrieval: Techniques and Applications | 2007-09-04 | Paper |
| Non-interactive Zaps and New Techniques for NIZK | 2007-09-04 | Paper |
| Security in Communication Networks | 2006-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374903 | 2006-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374904 | 2006-03-01 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692700 | 2005-09-28 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| Minimal complete primitives for secure multi-party computation | 2005-05-13 | Paper |
| Subquadratic approximation algorithms for clustering problems in high dimensional spaces | 2005-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471371 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768354 | 2004-01-14 | Paper |
| Amortizing Randomness in Private Multiparty Computations | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414266 | 2003-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785498 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783745 | 2002-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3149675 | 2002-09-30 | Paper |
| Self-Stabilizing Symmetry Breaking in Constant Space | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542554 | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542531 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542584 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778842 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754165 | 2001-12-09 | Paper |
| The Las-Vegas Processor Identity Problem (How and When to Be Unique) | 2001-07-16 | Paper |
| Perfect zero-knowledge arguments for NP using any one-way permutation | 2001-05-20 | Paper |
| Universal service-providers for private information retrieval | 2001-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527032 | 2001-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526994 | 2001-02-28 | Paper |
| Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941875 | 2000-08-27 | Paper |
| Adaptive packet routing for bursty adversarial traffic | 2000-08-27 | Paper |
| Randomness versus fault-tolerance | 2000-05-08 | Paper |
| Reducibility and Completeness in Private Computations | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934711 | 2000-01-31 | Paper |
| The linear-array conjecture in communication complexity is false | 1999-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228509 | 1999-10-04 | Paper |
| Characterizing linear size circuits in terms of privacy | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318694 | 1999-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318696 | 1999-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234105 | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249326 | 1999-06-17 | Paper |
| Conditional Oblivious Transfer and Timed-Release Encryption | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228448 | 1999-05-18 | Paper |
| Log-Space Polynomial End-to-End Communication | 1998-09-21 | Paper |
| Computational Complexity and Knowledge Complexity | 1998-09-20 | Paper |
| Software protection and simulation on oblivious RAMs | 1998-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364544 | 1997-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128932 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364566 | 1997-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875231 | 1996-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858457 | 1996-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314042 | 1995-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287362 | 1994-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210144 | 1991-01-01 | Paper |
