| Publication | Date of Publication | Type |
|---|
| Asymmetric multi-party computation | 2024-11-22 | Paper |
| Anonymous permutation routing | 2024-08-02 | Paper |
| 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 |
| Streaming and unbalanced PSI from function secret sharing | 2023-07-25 | Paper |
| Prio+: privacy preserving aggregate statistics via Boolean shares | 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 |
| A Combinatorial Characterization of Self-stabilizing Population Protocols | 2023-03-21 | Paper |
| Efficient 3-party distributed ORAM | 2022-12-16 | Paper |
| Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups | 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 |
| Universally composable secure computation with corrupted tokens | 2020-03-09 | Paper |
| Cryptographic sensing | 2020-03-09 | Paper |
| Reusable non-interactive secure computation | 2020-03-09 | Paper |
| Trapdoor hash functions and their applications | 2020-03-09 | Paper |
| Private anonymous data access | 2020-02-06 | Paper |
| A stable marriage requires communication | 2019-12-12 | Paper |
| Population stability. Regulating size in the presence of an adversary | 2019-09-19 | Paper |
| On the (in)security of hash-based oblivious RAM and a new balancing scheme | 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 \(L_p\) 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 |
| Coding for interactive communication correcting insertions and deletions | 2017-12-19 | Paper |
| Provably Secure Virus Detection: Using The Observer Effect Against Malware. | 2017-12-19 | Paper |
| Four-round concurrent non-malleable commitments from one-way functions | 2017-11-15 | Paper |
| Black-box parallel garbled RAM | 2017-11-15 | Paper |
| A randomized online quantile summary in \(O((1/\varepsilon) \log(1/\varepsilon))\) words | 2017-11-14 | Paper |
| The price of low communication in secure multi-party computation | 2017-11-03 | Paper |
| Brief announcement: Secure self-stabilizing computation | 2017-10-11 | Paper |
| A Stable Marriage Requires Communication | 2017-10-05 | Paper |
| Brief announcement: Space-time tradeoffs for distributed verification | 2017-09-29 | Paper |
| Randomness vs. fault-tolerance | 2017-09-29 | Paper |
| Streaming \(k\)-means on well-clusterable data | 2017-09-29 | Paper |
| Brief announcement: Proactive secret sharing with a dishonest majority | 2017-09-29 | 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 |
| Zero-one laws for sliding windows and universal sketches | 2017-08-31 | Paper |
| A randomized online quantile summary in \(O(\frac 1\varepsilon\log\frac 1\varepsilon)\) words | 2017-08-31 | Paper |
| Error-Correcting Codes for Automatic Control | 2017-08-08 | Paper |
| Unconditional UC-secure computation with (stronger-malicious) PUFs | 2017-06-13 | Paper |
| Circuit-private multi-key FHE | 2017-06-13 | Paper |
| The hidden graph model: communication locality and optimal resiliency with adaptive faults | 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: what if nobody is truly honest? (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 |
| Incoercible multi-party computation and universally composable receipt-free voting | 2015-12-10 | Paper |
| Round-optimal black-box two-party computation | 2015-12-10 | Paper |
| Cryptography with One-Way Communication | 2015-12-10 | Paper |
| Impossibility of black-box simulation against leakage attacks | 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 |
| Executable proofs, input-size hiding secure computation and a new ideal world | 2015-09-30 | Paper |
| Broadcast (and round) efficient verifiable secret sharing | 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 \(\Phi\)-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 |
| How to catch \(L_2\)-heavy-hitters on sliding windows | 2014-10-06 | Paper |
| On linear-size pseudorandom generators and hardcore functions | 2014-10-06 | Paper |
| Cryptography in the multi-string model | 2014-09-25 | Paper |
| Privacy amplification with asymptotically optimal entropy loss | 2014-08-13 | Paper |
| Zero-one frequency laws | 2014-08-13 | Paper |
| Measuring independence of datasets | 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 |
| Cross-domain secure computation | 2014-03-25 | Paper |
| Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing | 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 |
| The effectiveness of Lloyd-type methods for the \(k\)-means problem | 2014-02-17 | Paper |
| New techniques for noninteractive zero-knowledge | 2014-02-17 | Paper |
| Constant-round concurrent zero knowledge in the bounded player model | 2013-12-10 | Paper |
| Building lossy trapdoor functions from lossy encryption | 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 |
| Local correctability of expander codes | 2013-08-06 | Paper |
| Robust pseudorandom generators | 2013-08-06 | Paper |
| How hard is counting triangles in the streaming model? | 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 |
| How to garble RAM programs? | 2013-05-31 | Paper |
| Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions | 2013-05-31 | Paper |
| Cryptography using \texttt{CAPTCHA} puzzles | 2013-04-19 | Paper |
| Revisiting lower and upper bounds for selective decommitments | 2013-03-18 | Paper |
| Distributed Oblivious RAM for Secure Two-Party Computation | 2013-03-18 | 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 |
| Multiparty proximity testing with dishonest majority from equality testing | 2012-11-01 | Paper |
| Edge Fault Tolerance on Sparse Networks | 2012-11-01 | Paper |
| Near-optimal radio use for wireless network synchronization | 2012-10-11 | 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 |
| 5PM: secure pattern matching | 2012-09-25 | Paper |
| Correlated product security from any one-way function | 2012-07-20 | Paper |
| Extended-DDH and lossy trapdoor functions | 2012-07-20 | Paper |
| On homomorphic encryption and chosen-ciphertext security | 2012-07-20 | Paper |
| Unconditionally-secure robust secret sharing with compact shares | 2012-06-29 | Paper |
| Resettable statistical zero knowledge | 2012-06-15 | Paper |
| Simultaneously resettable arguments of knowledge | 2012-06-15 | Paper |
| Identifying cheaters without an honest majority | 2012-06-15 | Paper |
| Optimal sampling from sliding windows | 2012-05-11 | Paper |
| AMS without 4-wise independence on product domains | 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 |
| Improved fault tolerance and secure computation on sparse networks | 2010-09-07 | Paper |
| Asynchronous throughput-optimal routing in malicious networks | 2010-09-07 | Paper |
| Equivalence of uniform key agreement and composition insecurity | 2010-08-24 | Paper |
| Password-authenticated session-key generation on the internet in the plain model | 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 |
| Efficiency preserving transformations for concurrent non-malleable zero knowledge | 2010-02-24 | Paper |
| On complete primitives for fairness | 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 |
| Authenticated Adversarial Routing | 2009-03-03 | Paper |
| Simulation-Based Concurrent Non-malleable Commitments and Decommitments | 2009-03-03 | Paper |
| Public-Key Locally-Decodable Codes | 2009-02-10 | Paper |
| Circular-Secure Encryption from Decision Diffie-Hellman | 2009-02-10 | Paper |
| Communication Complexity in Algebraic Two-Party Protocols | 2009-02-10 | Paper |
| Cryptography with constant computational overhead | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549593 | 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 |
| Non-interactive Zaps and New Techniques for NIZK | 2007-09-04 | Paper |
| A Survey of Single-Database Private Information Retrieval: Techniques and Applications | 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 |
| Stability preserving transformations: Packet routing networks with edge capacities and speeds | 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/Q2778839 | 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 |
