| Publication | Date of Publication | Type |
|---|
| Revisiting security estimation for LWE with hints from a geometric perspective | 2024-02-06 | Paper |
| Secure sampling with sublinear communication | 2023-08-14 | Paper |
| (Nondeterministic) hardness vs. non-malleability | 2023-06-12 | Paper |
| BKW meets Fourier new algorithms for LPN with sparse parities | 2023-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875787 | 2023-02-03 | Paper |
| New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust | 2022-12-07 | Paper |
| LWE with side information: attacks and concrete security estimation | 2022-11-09 | Paper |
| Non-malleable codes for bounded parallel-time tampering | 2022-04-22 | Paper |
| Revisiting fairness in MPC: polynomial number of parties and general adversarial structures | 2022-03-23 | Paper |
| (In)security of ring-LWE under partial key exposure | 2021-05-25 | Paper |
| Towards a ring analogue of the leftover hash lemma | 2021-05-25 | Paper |
| TMPS: ticket-mediated password strengthening | 2020-08-05 | Paper |
| Feasibility and infeasibility of secure computation with malicious PUFs | 2020-04-28 | Paper |
| Locally decodable and updatable non-malleable codes and their applications | 2020-03-03 | Paper |
| Constant-round group key exchange from the ring-LWE assumption | 2020-02-25 | Paper |
| Non-malleable codes against bounded polynomial time tampering | 2020-02-04 | Paper |
| Upper and lower bounds for continuous non-malleable codes | 2020-01-28 | Paper |
| Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes | 2019-09-17 | Paper |
| Leakage resilience from program obfuscation | 2019-08-13 | Paper |
| Oblivious network RAM and leveraging parallelism to achieve obliviousness | 2019-08-13 | Paper |
| Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering | 2018-07-17 | Paper |
| Local non-malleable codes in the bounded retrieval model | 2018-05-29 | Paper |
| A black-box construction of non-malleable encryption from semantically secure encryption | 2018-04-26 | Paper |
| Improved, black-box, non-malleable encryption from semantic security | 2018-04-06 | Paper |
| Approximate resilience, monotonicity, and the complexity of agnostic learning | 2017-10-05 | Paper |
| Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes | 2017-06-13 | Paper |
| Towards non-black-box separations of public key encryption and one way function | 2016-12-22 | Paper |
| Non-malleable codes for bounded depth, bounded fan-in circuits | 2016-07-15 | Paper |
| 10-round Feistel is indifferentiable from an ideal cipher | 2016-07-15 | Paper |
| Oblivious network RAM and leveraging parallelism to achieve obliviousness | 2016-06-10 | Paper |
| Leakage-resilient public-key encryption from obfuscation | 2016-04-13 | Paper |
| Efficient Concurrent Covert Computation of String Equality and Set Intersection | 2016-04-08 | Paper |
| Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware | 2015-09-30 | Paper |
| Locally decodable and updatable non-malleable codes and their applications | 2015-07-06 | Paper |
| Adaptively secure, universally composable, multiparty computation in constant rounds | 2015-07-06 | Paper |
| Feasibility and infeasibility of secure computation with malicious PUFs | 2014-08-07 | Paper |
| Leakage-tolerant computation with input-independent preprocessing | 2014-08-07 | Paper |
| On minimal assumptions for sender-deniable public key encryption | 2014-03-25 | Paper |
| A black-box construction of a CCA2 encryption scheme from a plaintext aware (sPA1) encryption scheme | 2014-03-25 | Paper |
| Enhanced chosen-ciphertext security and applications | 2014-03-25 | Paper |
| Can optimally-fair coin tossing be based on one-way functions? | 2014-02-18 | Paper |
| Securing circuits and protocols against \(1/\mathrm{poly}(k)\) tampering rate | 2014-02-18 | Paper |
| Adaptive and concurrent secure computation from new adaptive, non-malleable commitments | 2013-12-10 | Paper |
| Why ``Fiat-Shamir for proofs lacks a proof | 2013-03-18 | Paper |
| Efficient robust private set intersection | 2012-11-16 | Paper |
| Securing circuits against constant-rate tampering | 2012-09-25 | Paper |
| On the centrality of off-line e-cash to concrete partial information games | 2012-09-25 | Paper |
| Efficient password authenticated key exchange via oblivious transfer | 2012-07-20 | Paper |
| Computational extractors and pseudorandomness | 2012-06-15 | Paper |
| A canonical form for testing Boolean function properties | 2011-08-17 | Paper |
| Optimal cryptographic hardness of learning monotone functions | 2011-05-24 | Paper |
| On the Black-Box Complexity of Optimally-Fair Coin Tossing | 2011-05-19 | Paper |
| Improved non-committing encryption with applications to adaptively secure protocols | 2009-12-15 | Paper |
| Simple, Black-Box Constructions of Adaptively Secure Protocols | 2009-03-03 | Paper |
| Optimal Cryptographic Hardness of Learning Monotone Functions | 2008-08-28 | Paper |
| Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One | 2008-03-05 | Paper |
