| Publication | Date of Publication | Type |
|---|
| Public-key anamorphism in (CCA-secure) public-key encryption and beyond | 2024-12-04 | Paper |
| Limits of preprocessing for single-server PIR | 2024-07-19 | Paper |
| Limits of breach-resistant and snapshot-oblivious RAMs | 2024-02-06 | Paper |
| Anamorphic signatures: secrecy from a dictator who only permits authentication! | 2024-02-02 | Paper |
| Lower bound framework for differentially private and oblivious data structures | 2024-01-16 | Paper |
| The complexity of secure RAMs | 2023-10-04 | Paper |
| Efficient Boolean search over encrypted data with reduced leakage | 2023-05-12 | Paper |
| Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model | 2022-11-09 | Paper |
| Anamorphic encryption: private communication against a dictator | 2022-08-30 | Paper |
| Communication efficient Zero-knowledge Proofs of knowledge | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002851 | 2021-07-28 | Paper |
| The price of defense | 2021-04-19 | Paper |
| Continuously non-malleable codes in the split-state model from minimal assumptions | 2020-06-30 | Paper |
| Lower bounds for differentially private RAMs | 2020-02-04 | Paper |
| One-message statistical Zero-Knowledge Proofs and space-bounded verifier | 2019-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743454 | 2019-05-10 | Paper |
| Information Retention in Heterogeneous Majority Dynamics | 2019-01-30 | Paper |
| Metastability of logit dynamics for coordination games | 2019-01-11 | Paper |
| On the number of random bits in totally private computation | 2019-01-10 | Paper |
| Placing resources in a tree: Dynamic and static algorithms | 2019-01-10 | Paper |
| Routing selfish unsplittable traffic | 2018-11-05 | Paper |
| Convergence to equilibrium of logit dynamics for strategic games | 2016-11-01 | Paper |
| Online/Offline OR Composition of Sigma Protocols | 2016-07-15 | Paper |
| The graph clustering problem has a perfect zero-knowledge interactive proof | 2016-06-16 | Paper |
| A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles | 2016-04-08 | Paper |
| Improved OR-Composition of Sigma-Protocols | 2016-04-08 | Paper |
| Minority Becomes Majority in Social Networks | 2016-01-08 | Paper |
| Impossibility of Black-Box Simulation Against Leakage Attacks | 2015-12-10 | Paper |
| Logit dynamics with concurrent updates for local interaction potential games | 2015-11-19 | Paper |
| Innovative approaches for security of small artefacts | 2014-10-24 | Paper |
| On Input Indistinguishable Proof Systems | 2014-07-01 | Paper |
| Mixing time and stationary expected social welfare of logit dynamics | 2013-10-21 | Paper |
| Logit Dynamics with Concurrent Updates for Local Interaction Games | 2013-09-17 | Paper |
| On the Achievability of Simulation-Based Security for Functional Encryption | 2013-09-17 | Paper |
| Fully Secure Hidden Vector Encryption | 2013-04-04 | Paper |
| Predicate Encryption with Partial Public Keys | 2010-12-07 | Paper |
| Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts | 2010-11-26 | Paper |
| Mixing time and stationary expected social welfare of logit dynamics | 2010-10-19 | Paper |
| Collusion-Free Multiparty Computation in the Mediated Model | 2009-10-20 | Paper |
| Private Capacities in Mechanism Design | 2009-10-16 | Paper |
| On designing truthful mechanisms for online scheduling | 2009-08-21 | Paper |
| On Monotone Formula Composition of Perfect Zero-Knowledge Languages | 2009-08-20 | Paper |
| New Constructions of Mechanisms with Verification | 2009-03-12 | Paper |
| Simulation-Based Concurrent Non-malleable Commitments and Decommitments | 2009-03-03 | Paper |
| The power of verification for one-parameter agents | 2009-03-02 | Paper |
| Hidden-Vector Encryption with Groups of Prime Order | 2009-02-10 | Paper |
| Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model | 2008-08-19 | Paper |
| Alternatives to Truthfulness Are Hard to Recognize | 2008-05-02 | Paper |
| Impossibility and Feasibility Results for Zero Knowledge with Public Keys | 2008-03-17 | Paper |
| Approximation Algorithms for Path Coloring in Trees | 2008-03-14 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model | 2007-09-05 | Paper |
| Efficient automatic simulation of parallel computation on networks of workstations | 2006-06-09 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Improved Setup Assumptions for 3-Round Resettable Zero Knowledge | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440437 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783745 | 2002-12-08 | Paper |
| Randomness complexity of private computation | 2002-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754163 | 2001-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938630 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230367 | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4377122 | 1998-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341789 | 1998-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341734 | 1997-07-20 | Paper |
| Minimal path length of trees with known fringe | 1997-02-28 | Paper |
| Characteristic inequalities for binary trees | 1997-02-28 | Paper |
| Dynamic and static algorithms for optimal placement of resources in a tree | 1997-02-27 | Paper |
| A note on the expected path length of trees with known fringe | 1997-02-27 | Paper |
| The power of preprocessing in zero-knowledge proofs of knowledge | 1997-01-14 | Paper |
| Zero-knowledge arguments and public-key cryptography | 1995-11-05 | Paper |
| Branch-and-bound and backtrack search on mesh-connected arrays of processors | 1995-05-14 | Paper |
| Binary prefix codes ending in a "1" | 1995-03-01 | Paper |
| The knowledge complexity of quadratic residuosity languages | 1994-09-25 | Paper |
| Round-optimal perfect zero-knowledge proofs | 1994-05-05 | Paper |
| Tight Upper and Lower Bounds on the Path Length of Binary Trees | 1994-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035694 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036858 | 1993-05-18 | Paper |
| Noninteractive Zero-Knowledge | 1992-06-27 | Paper |
| Removing Interaction from Zero-Knowledge Proofs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789104 | 1988-01-01 | Paper |
