Isolated Proofs of Knowledge and Isolated Zero Knowledge. - Ivan Damgård; Jesper Buus Nielsen; Daniel Wichs (IACR Cryptol. ePrint Arch., 2007)

Universally Composable Multiparty Computation with Partially Isolated Parties. - Ivan Damgård; Jesper Buus Nielsen; Daniel Wichs (IACR Cryptol. ePrint Arch., 2007)

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. - Ronald Cramer; Yevgeniy Dodis; Serge Fehr; Carles Padró; Daniel Wichs (IACR Cryptol. ePrint Arch., 2008)

Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets. - Yevgeniy Dodis; Daniel Wichs (IACR Cryptol. ePrint Arch., 2008)

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer. - Juan A. Garay; Daniel Wichs; Hong-Sheng Zhou (IACR Cryptol. ePrint Arch., 2008)

Survey: Leakage Resilience and the Bounded Retrieval Model. - Joël Alwen; Yevgeniy Dodis; Daniel Wichs (ICITS, 2009)

Public-Key Encryption in the Bounded-Retrieval Model. - Joël Alwen; Yevgeniy Dodis; Moni Naor; Gil Segev 001; Shabsi Walfish; Daniel Wichs (IACR Cryptol. ePrint Arch., 2009)

Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model. - Joël Alwen; Yevgeniy Dodis; Daniel Wichs (IACR Cryptol. ePrint Arch., 2009)

Proofs of Retrievability via Hardness Amplification. - Yevgeniy Dodis; Salil P. Vadhan; Daniel Wichs (IACR Cryptol. ePrint Arch., 2009)

On Symmetric Encryption and Point Obfuscation. - Ran Canetti; Yael Tauman Kalai; Mayank Varia; Daniel Wichs (IACR Cryptol. ePrint Arch., 2010)

Efficient Public-Key Cryptography in the Presence of Key Leakage. - Yevgeniy Dodis; Kristiyan Haralambiev; Adriana López-Alt; Daniel Wichs (IACR Cryptol. ePrint Arch., 2010)

Cryptography Against Continuous Memory Attacks. - Yevgeniy Dodis; Kristiyan Haralambiev; Adriana López-Alt; Daniel Wichs (IACR Cryptol. ePrint Arch., 2010)

One-time Computable and Uncomputable Functions. - Stefan Dziembowski; Tomasz Kazana; Daniel Wichs (IACR Cryptol. ePrint Arch., 2010)

Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions. - Craig Gentry; Daniel Wichs (IACR Cryptol. ePrint Arch., 2010)

One-Time Computable Self-erasing Functions. - Stefan Dziembowski; Tomasz Kazana; Daniel Wichs (TCC, 2011)

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. - Gilad Asharov; Abhishek Jain 002; Daniel Wichs (IACR Cryptol. ePrint Arch., 2011)

Storing Secrets on Continually Leaky Devices. - Yevgeniy Dodis; Allison B. Lewko; Brent Waters; Daniel Wichs (IACR Cryptol. ePrint Arch., 2011)

Key-Evolution Schemes Resilient to Space-Bounded Leakage. - Stefan Dziembowski; Tomasz Kazana; Daniel Wichs (IACR Cryptol. ePrint Arch., 2011)

Cryptographic Resilience to Continual Information Leakage. - Daniel Wichs (2011)

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. - Gilad Asharov; Abhishek Jain 002; Adriana López-Alt; Eran Tromer; Vinod Vaikuntanathan; Daniel Wichs (EUROCRYPT, 2012)

On Continual Leakage of Discrete Log Representations. - Shweta Agrawal 001; Yevgeniy Dodis; Vinod Vaikuntanathan; Daniel Wichs (IACR Cryptol. ePrint Arch., 2012)

Why "Fiat-Shamir for Proofs" Lacks a Proof. - Nir Bitansky; Sanjam Garg; Daniel Wichs (IACR Cryptol. ePrint Arch., 2012)

Counterexamples to Hardness Amplification Beyond Negligible. - Yevgeniy Dodis; Abhishek Jain 002; Tal Moran; Daniel Wichs (IACR Cryptol. ePrint Arch., 2012)

Message Authentication, Revisited. - Yevgeniy Dodis; Eike Kiltz; Krzysztof Pietrzak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2012)

Fully Homomorphic Message Authenticators. - Rosario Gennaro; Daniel Wichs (IACR Cryptol. ePrint Arch., 2012)

Barriers in Cryptography with Weak, Correlated and Leaky Sources. - Daniel Wichs (IACR Cryptol. ePrint Arch., 2012)

Why "Fiat-Shamir for Proofs" Lacks a Proof. - Nir Bitansky; Dana Dachman-Soled; Sanjam Garg; Abhishek Jain 002; Yael Tauman Kalai; Adriana López-Alt; Daniel Wichs (TCC, 2013)

Learning with Rounding, Revisited: New Reduction, Properties and Applications. - Joël Alwen; Stephan Krenn; Krzysztof Pietrzak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2013)

Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust. - Yevgeniy Dodis; David Pointcheval; Sylvain Ruhault; Damien Vergnaud; Daniel Wichs (IACR Cryptol. ePrint Arch., 2013)

Key Derivation Without Entropy Waste. - Yevgeniy Dodis; Krzysztof Pietrzak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2013)

Optimizing ORAM and Using it Efficiently for Secure Computation. - Craig Gentry; Kenny A. Goldman; Shai Halevi; Charanjit S. Jutla; Mariana Raykova 001; Daniel Wichs (IACR Cryptol. ePrint Arch., 2013)

Fully Leakage-Resilient Signatures. - Elette Boyle; Gil Segev 001; Daniel Wichs (J. Cryptol., 2013)

Garbled RAM Revisited. - Craig Gentry; Shai Halevi; Steve Lu 001; Rafail Ostrovsky; Mariana Raykova 001; Daniel Wichs (EUROCRYPT, 2014)

Garbled RAM Revisited, Part I. - Craig Gentry; Shai Halevi; Mariana Raykova 001; Daniel Wichs (IACR Cryptol. ePrint Arch., 2014)

Outsourcing Private RAM Computation. - Craig Gentry; Shai Halevi; Mariana Raykova 001; Daniel Wichs (IACR Cryptol. ePrint Arch., 2014)

Leveled Fully Homomorphic Signatures from Standard Lattices. - Sergey Gorbunov 001; Vinod Vaikuntanathan; Daniel Wichs (IACR Cryptol. ePrint Arch., 2014)

On the Communication Complexity of Secure Function Evaluation with Long Output. - Pavel Hubácek; Daniel Wichs (IACR Cryptol. ePrint Arch., 2014)

Tamper Detection and Continuous Non-Malleable Codes. - Zahra Jafargholi; Daniel Wichs (IACR Cryptol. ePrint Arch., 2014)

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. - Vadim Lyubashevsky; Daniel Wichs (IACR Cryptol. ePrint Arch., 2014)

Leveled Fully Homomorphic Signatures from Standard Lattices. - Daniel Wichs (IACR Cryptol. ePrint Arch., 2014)

Essentially Optimal Robust Secret Sharing with Maximal Corruptions. - Allison Bishop; Valerio Pastro; Rajmohan Rajaraman; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Perfect Structure on the Edge of Chaos. - Nir Bitansky; Omer Paneth; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Adaptively Secure Garbled Circuits from One-Way Functions. - Brett Hemenway; Zahra Jafargholi; Rafail Ostrovsky; Alessandra Scafuro; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Standard Security Does Not Imply Indistinguishability Under Selective Opening. - Dennis Hofheinz; Vanishree Rao; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Two Round MPC from LWE via Multi-Key FHE. - Pratyay Mukherjee; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Watermarking Cryptographic Programs Against Arbitrary Removal Strategies. - Ryo Nishimaki; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key. - Ryo Nishimaki; Daniel Wichs; Mark Zhandry (IACR Cryptol. ePrint Arch., 2015)

New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. - Tatsuaki Okamoto; Krzysztof Pietrzak; Brent Waters; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Two Round Multiparty Computation via Multi-key FHE. - Pratyay Mukherjee; Daniel Wichs (EUROCRYPT (2), 2016)

Obfuscating Conjunctions under Entropic Ring LWE. - Zvika Brakerski; Vinod Vaikuntanathan; Hoeteck Wee; Daniel Wichs (ITCS, 2016)

Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. - Nir Bitansky; Omer Paneth; Daniel Wichs (TCC (A1), 2016)

Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM. - Srinivas Devadas; Marten van Dijk; Christopher W. Fletcher; Ling Ren 001; Elaine Shi; Daniel Wichs (TCC (A2), 2016)

A counterexample to the chain rule for conditional HILL entropy. - Stephan Krenn; Krzysztof Pietrzak; Akshay Wadia; Daniel Wichs (Comput. Complex., 2016)

Spooky Encryption and its Applications. - Yevgeniy Dodis; Shai Halevi; Ron D. Rothblum; Daniel Wichs (IACR Cryptol. ePrint Arch., 2016)

Adaptive Security of Yao's Garbled Circuits. - Zahra Jafargholi; Daniel Wichs (IACR Cryptol. ePrint Arch., 2016)

Leakage-Resilient Cryptography from Minimal Assumptions. - Carmit Hazay; Adriana López-Alt; Hoeteck Wee; Daniel Wichs (J. Cryptol., 2016)

Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits. - Sebastian Faust; Pratyay Mukherjee; Daniele Venturi 001; Daniel Wichs (IEEE Trans. Inf. Theory, 2016)

How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs. - Yevgeniy Dodis; Adi Shamir; Noah Stephens-Davidowitz; Daniel Wichs (Algorithmica, 2017)

On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input. - Sanjam Garg; Craig Gentry; Shai Halevi; Daniel Wichs (Algorithmica, 2017)

Non-Trivial Witness Encryption and Null-iO from Standard Assumptions. - Zvika Brakerski; Aayush Jain; Ilan Komargodski; Alain Passelègue; Daniel Wichs (IACR Cryptol. ePrint Arch., 2017)

The Edited Truth. - Shafi Goldwasser; Saleet Klein; Daniel Wichs (IACR Cryptol. ePrint Arch., 2017)

Be Adaptive, Avoid Overcommitting. - Zahra Jafargholi; Chethan Kamath; Karen Klein; Ilan Komargodski; Krzysztof Pietrzak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2017)

Adaptively Indistinguishable Garbled Circuits. - Zahra Jafargholi; Alessandra Scafuro; Daniel Wichs (IACR Cryptol. ePrint Arch., 2017)

Hardness of Non-Interactive Differential Privacy from One-Way Functions. - Lucas Kowalczyk; Tal Malkin; Jonathan R. Ullman; Daniel Wichs (IACR Cryptol. ePrint Arch., 2017)

Obfuscating Compute-and-Compare Programs under LWE. - Daniel Wichs; Giorgos Zirdelis (IACR Cryptol. ePrint Arch., 2017)

Dynamic Proofs of Retrievability Via Oblivious RAM. - David Cash; Alptekin Küpçü; Daniel Wichs (J. Cryptol., 2017)

Succinct delegation for low-space non-deterministic computation. - Saikrishna Badrinarayanan; Yael Tauman Kalai; Dakshita Khurana; Amit Sahai; Daniel Wichs (STOC, 2018)

Non-Interactive Delegation for Low-Space Non-Deterministic Computation. - Saikrishna Badrinarayanan; Yael Kalai; Dakshita Khurana; Amit Sahai; Daniel Wichs (Electron. Colloquium Comput. Complex., 2018)

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. - Zvika Brakerski; Vadim Lyubashevsky; Vinod Vaikuntanathan; Daniel Wichs (Electron. Colloquium Comput. Complex., 2018)

Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE. - Ran Canetti; Alex Lombardi; Daniel Wichs (IACR Cryptol. ePrint Arch., 2018)

Traitor-Tracing from LWE Made Simple and Attribute-Based. - Yilei Chen 001; Vinod Vaikuntanathan; Brent Waters; Hoeteck Wee; Daniel Wichs (IACR Cryptol. ePrint Arch., 2018)

Private Anonymous Data Access. - Ariel Hamlin; Rafail Ostrovsky; Mor Weiss; Daniel Wichs (IACR Cryptol. ePrint Arch., 2018)

Multi-Key Searchable Encryption, Revisited. - Ariel Hamlin; Abhi Shelat; Mor Weiss; Daniel Wichs (IACR Cryptol. ePrint Arch., 2018)

Laconic Function Evaluation and Applications. - Willy Quach; Hoeteck Wee; Daniel Wichs (IACR Cryptol. ePrint Arch., 2018)

Watermarking PRFs under Standard Assumptions: Public Marking and Security with Extraction Queries. - Willy Quach; Daniel Wichs; Giorgos Zirdelis (IACR Cryptol. ePrint Arch., 2018)

Non-Malleable Codes. - Stefan Dziembowski; Krzysztof Pietrzak; Daniel Wichs (J. ACM, 2018)

Watermarking Cryptographic Capabilities. - Aloni Cohen; Justin Holmgren; Ryo Nishimaki; Vinod Vaikuntanathan; Daniel Wichs (SIAM J. Comput., 2018)

Broadcast and Trace with N^ε Ciphertext Size from Standard Assumptions. - Rishab Goyal; Willy Quach; Brent Waters; Daniel Wichs (CRYPTO (3), 2019)

Fiat-Shamir: from practice to theory. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Alex Lombardi; Guy N. Rothblum; Ron D. Rothblum; Daniel Wichs (STOC, 2019)

Non-Malleable Codes for Decision Trees. - Marshall Ball; Siyao Guo; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

Extracting Randomness from Extractor-Dependent Sources. - Yevgeniy Dodis; Vinod Vaikuntanathan; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

Two-Round Oblivious Transfer from CDH or LPN. - Nico Döttling; Sanjam Garg; Mohammad Hajiabadi; Daniel Masny; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions. - Rishab Goyal; Willy Quach; Brent Waters; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

On the Plausibility of Fully Homomorphic Encryption for RAMs. - Ariel Hamlin; Justin Holmgren; Mor Weiss; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

New Constructions of Reusable Designated-Verifier NIZKs. - Alex Lombardi; Willy Quach; Ron D. Rothblum; Daniel Wichs; David J. Wu 001 (IACR Cryptol. ePrint Arch., 2019)

2-Message Publicly Verifiable WI from (Subexponential) LWE. - Alex Lombardi; Vinod Vaikuntanathan; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

Reusable Designated-Verifier NIZKs for all NP from CDH. - Willy Quach; Ron D. Rothblum; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

Optimal Broadcast Encryption from LWE and Pairings in the Standard Model. - Shweta Agrawal 001; Daniel Wichs; Shota Yamada 001 (IACR Cryptol. ePrint Arch., 2020)

Witness Maps and Applications. - Suvradip Chakraborty; Manoj Prabhakaran 001; Daniel Wichs (IACR Cryptol. ePrint Arch., 2020)

Leakage-Resilient Key Exchange and Two-Seed Extractors. - Xin Li; Fermi Ma; Willy Quach; Daniel Wichs (IACR Cryptol. ePrint Arch., 2020)

Statistical ZAPR Arguments from Bilinear Maps. - Alex Lombardi; Vinod Vaikuntanathan; Daniel Wichs (IACR Cryptol. ePrint Arch., 2020)

Incompressible Encodings. - Tal Moran; Daniel Wichs (IACR Cryptol. ePrint Arch., 2020)

Candidate Obfuscation via Oblivious LWE Sampling. - Hoeteck Wee; Daniel Wichs (IACR Cryptol. ePrint Arch., 2020)

From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. - Nir Bitansky; Ryo Nishimaki; Alain Passelègue; Daniel Wichs (J. Cryptol., 2020)

Succinct LWE Sampling, Random Polynomials, and Obfuscation. - Lalita Devadas; Willy Quach; Vinod Vaikuntanathan; Hoeteck Wee; Daniel Wichs (IACR Cryptol. ePrint Arch., 2021)

Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited. - Yevgeniy Dodis; Willy Quach; Daniel Wichs (IACR Cryptol. ePrint Arch., 2021)

Incompressible Cryptography. - Jiaxin Guan; Daniel Wichs; Mark Zhandry (IACR Cryptol. ePrint Arch., 2021)

Limits on the Adaptive Security of Yao's Garbling. - Chethan Kamath; Karen Klein; Krzysztof Pietrzak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2021)

Targeted Lossy Functions and Applications. - Willy Quach; Brent Waters; Daniel Wichs (IACR Cryptol. ePrint Arch., 2021)

Is There an Oblivious RAM Lower Bound for Online Reads? - Mor Weiss; Daniel Wichs (J. Cryptol., 2021)

Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC. - Saikrishna Badrinarayanan; Yuval Ishai; Dakshita Khurana; Amit Sahai; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Updatable Public Key Encryption in the Standard Model. - Yevgeniy Dodis; Harish Karthikeyan; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Small-Box Cryptography. - Yevgeniy Dodis; Harish Karthikeyan; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Authentication in the Bounded Storage Model. - Yevgeniy Dodis; Willy Quach; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Nearly Optimal Property Preserving Hashing. - Justin Holmgren; Minghao Liu 010; LaKyah Tyner; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

The Pseudorandom Oracle Model and Ideal Obfuscation. - Aayush Jain; Huijia Lin; Ji Luo 002; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Boosting Batch Arguments and RAM Delegation. - Yael Tauman Kalai; Alex Lombardi; Vinod Vaikuntanathan; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. - Wei-Kai Lin; Ethan Mook; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Post-Quantum Insecurity from LWE. - Alex Lombardi; Ethan Mook; Willy Quach; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Witness Encryption and Null-IO from Evasive LWE. - Vinod Vaikuntanathan; Hoeteck Wee; Daniel Wichs (IACR Cryptol. ePrint Arch., 2022)

Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance. - Jiaxin Guan; Daniel Wichs; Mark Zhandry (TCC (3), 2023)

A Map of Witness Maps: New Definitions and Connections. - Suvradip Chakraborty; Manoj Prabhakaran 001; Daniel Wichs (IACR Cryptol. ePrint Arch., 2023)

Security with Functional Re-Encryption from CPA. - Yevgeniy Dodis; Shai Halevi; Daniel Wichs (IACR Cryptol. ePrint Arch., 2023)

Somewhere Randomness Extraction and Security against Bounded-Storage Mass Surveillance. - Jiaxin Guan; Daniel Wichs; Mark Zhandry (IACR Cryptol. ePrint Arch., 2023)

Lower Bounds on Anonymous Whistleblowing. - Willy Quach; LaKyah Tyner; Daniel Wichs (IACR Cryptol. ePrint Arch., 2023)

Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM. - Brent Waters; Daniel Wichs (IACR Cryptol. ePrint Arch., 2023)

Adaptively Secure MPC with Sublinear Communication Complexity. - Ran Cohen; Abhi Shelat; Daniel Wichs (J. Cryptol., 2023)

How to Simulate Random Oracles with Auxiliary Input. - Yevgeniy Dodis; Aayush Jain; Huijia Lin; Ji Luo 002; Daniel Wichs (FOCS, 2024)

Efficient Maliciously Secure Oblivious Exponentiations. - Carsten Baum; Jens Berlips; Walther Chen; Ivan Bjerre Damgård; Kevin M. Esvelt; Leonard Foner; Dana Gretton; Martin Kysel; Ronald L. Rivest; Lawrence Roy; Francesca Sage-Ling; Adi Shamir; et al. (IACR Commun. Cryptol., 2024)

A system capable of verifiably and privately screening global DNA synthesis. - Carsten Baum; Jens Berlips; Walther Chen; Hongrui Cui; Ivan Damgård; Jiangbin Dong; Kevin M. Esvelt; Mingyu Gao 001; Dana Gretton; Leonard Foner; Martin Kysel; Kaiyi Zhang 001; et al. (CoRR, 2024)

Interval Key-Encapsulation Mechanism. - Alexander Bienstock; Yevgeniy Dodis; Paul Rösler; Daniel Wichs (IACR Cryptol. ePrint Arch., 2024)

Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation. - Fangqi Dong; Zihan Hao; Ethan Mook; Daniel Wichs (IACR Cryptol. ePrint Arch., 2024)

Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE. - Fangqi Dong; Zihan Hao; Ethan Mook; Hoeteck Wee; Daniel Wichs (IACR Cryptol. ePrint Arch., 2024)

PIR with Client-Side Preprocessing: Information-Theoretic Constructions and Lower Bounds. - Yuval Ishai; Elaine Shi; Daniel Wichs (IACR Cryptol. ePrint Arch., 2024)

Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions. - Jad Silbak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2024)

Adaptively Secure Attribute-Based Encryption from Witness Encryption. - Brent Waters; Daniel Wichs (IACR Cryptol. ePrint Arch., 2024)

Technical Perspective: Hiding Secrets in Programs. - Daniel Wichs (Commun. ACM, 2024)

Unique NIZKs and Steganography Detection. - Willy Quach; LaKyah Tyner; Daniel Wichs (EUROCRYPT (4), 2025)

Unambiguous SNARGs for P from LWE with Applications to PPAD Hardness. - Liyan Chen; Cody Freitag; Zhengzhong Jin; Daniel Wichs (STOC, 2025)

Succinct Non-interactive Arguments of Proximity. - Liyan Chen; Zhengzhong Jin; Daniel Wichs (STOC, 2025)

Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC. - Wei-Kai Lin; Ethan Mook; Daniel Wichs (IACR Cryptol. ePrint Arch., 2025)

Black Box Crypto is Useless for Doubly Efficient PIR. - Wei-Kai Lin; Ethan Mook; Daniel Wichs (IACR Cryptol. ePrint Arch., 2025)

Binary Codes for Error Detection and Correction in a Computationally Bounded World. - Jad Silbak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2025)