Daniel Wichs

Orcid: 0000-0002-4981-1643

Affiliations:
  • Northeastern University


According to our database1, Daniel Wichs authored at least 120 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Technical Perspective: Hiding Secrets in Programs.
Commun. ACM, March, 2024

Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation.
IACR Cryptol. ePrint Arch., 2024

A system capable of verifiably and privately screening global DNA synthesis.
CoRR, 2024

2023
Adaptively Secure MPC with Sublinear Communication Complexity.
J. Cryptol., April, 2023

Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM.
IACR Cryptol. ePrint Arch., 2023

Lower Bounds on Anonymous Whistleblowing.
IACR Cryptol. ePrint Arch., 2023

Somewhere Randomness Extraction and Security against Bounded-Storage Mass Surveillance.
IACR Cryptol. ePrint Arch., 2023

Security with Functional Re-Encryption from CPA.
IACR Cryptol. ePrint Arch., 2023

A Map of Witness Maps: New Definitions and Connections.
IACR Cryptol. ePrint Arch., 2023

Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
Witness Encryption and Null-IO from Evasive LWE.
IACR Cryptol. ePrint Arch., 2022

Post-Quantum Insecurity from LWE.
IACR Cryptol. ePrint Arch., 2022

Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE.
IACR Cryptol. ePrint Arch., 2022

Boosting Batch Arguments and RAM Delegation.
IACR Cryptol. ePrint Arch., 2022

The Pseudorandom Oracle Model and Ideal Obfuscation.
IACR Cryptol. ePrint Arch., 2022

Nearly Optimal Property Preserving Hashing.
IACR Cryptol. ePrint Arch., 2022

Authentication in the Bounded Storage Model.
IACR Cryptol. ePrint Arch., 2022

Small-Box Cryptography.
IACR Cryptol. ePrint Arch., 2022

Updatable Public Key Encryption in the Standard Model.
IACR Cryptol. ePrint Arch., 2022

Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC.
IACR Cryptol. ePrint Arch., 2022

2021
Is There an Oblivious RAM Lower Bound for Online Reads?
J. Cryptol., 2021

Targeted Lossy Functions and Applications.
IACR Cryptol. ePrint Arch., 2021

Limits on the Adaptive Security of Yao's Garbling.
IACR Cryptol. ePrint Arch., 2021

Incompressible Cryptography.
IACR Cryptol. ePrint Arch., 2021

Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited.
IACR Cryptol. ePrint Arch., 2021

Succinct LWE Sampling, Random Polynomials, and Obfuscation.
IACR Cryptol. ePrint Arch., 2021

2020
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption.
J. Cryptol., 2020

Candidate Obfuscation via Oblivious LWE Sampling.
IACR Cryptol. ePrint Arch., 2020

Incompressible Encodings.
IACR Cryptol. ePrint Arch., 2020

Statistical ZAPR Arguments from Bilinear Maps.
IACR Cryptol. ePrint Arch., 2020

Leakage-Resilient Key Exchange and Two-Seed Extractors.
IACR Cryptol. ePrint Arch., 2020

Witness Maps and Applications.
IACR Cryptol. ePrint Arch., 2020

Optimal Broadcast Encryption from LWE and Pairings in the Standard Model.
IACR Cryptol. ePrint Arch., 2020

2019
Reusable Designated-Verifier NIZKs for all NP from CDH.
IACR Cryptol. ePrint Arch., 2019

2-Message Publicly Verifiable WI from (Subexponential) LWE.
IACR Cryptol. ePrint Arch., 2019

New Constructions of Reusable Designated-Verifier NIZKs.
IACR Cryptol. ePrint Arch., 2019

On the Plausibility of Fully Homomorphic Encryption for RAMs.
IACR Cryptol. ePrint Arch., 2019

Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2019

Two-Round Oblivious Transfer from CDH or LPN.
IACR Cryptol. ePrint Arch., 2019

Extracting Randomness from Extractor-Dependent Sources.
IACR Cryptol. ePrint Arch., 2019

Non-Malleable Codes for Decision Trees.
IACR Cryptol. ePrint Arch., 2019

Fiat-Shamir: from practice to theory.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Broadcast and Trace with N^ε Ciphertext Size from Standard Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Non-Malleable Codes.
J. ACM, 2018

Watermarking PRFs under Standard Assumptions: Public Marking and Security with Extraction Queries.
IACR Cryptol. ePrint Arch., 2018

Laconic Function Evaluation and Applications.
IACR Cryptol. ePrint Arch., 2018

Multi-Key Searchable Encryption, Revisited.
IACR Cryptol. ePrint Arch., 2018

Private Anonymous Data Access.
IACR Cryptol. ePrint Arch., 2018

Traitor-Tracing from LWE Made Simple and Attribute-Based.
IACR Cryptol. ePrint Arch., 2018

Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE.
IACR Cryptol. ePrint Arch., 2018

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing.
Electron. Colloquium Comput. Complex., 2018

Non-Interactive Delegation for Low-Space Non-Deterministic Computation.
Electron. Colloquium Comput. Complex., 2018

Succinct delegation for low-space non-deterministic computation.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
Dynamic Proofs of Retrievability Via Oblivious RAM.
J. Cryptol., 2017

Obfuscating Compute-and-Compare Programs under LWE.
IACR Cryptol. ePrint Arch., 2017

Hardness of Non-Interactive Differential Privacy from One-Way Functions.
IACR Cryptol. ePrint Arch., 2017

Adaptively Indistinguishable Garbled Circuits.
IACR Cryptol. ePrint Arch., 2017

Be Adaptive, Avoid Overcommitting.
IACR Cryptol. ePrint Arch., 2017

The Edited Truth.
IACR Cryptol. ePrint Arch., 2017

Non-Trivial Witness Encryption and Null-iO from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2017

On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input.
Algorithmica, 2017

How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs.
Algorithmica, 2017

2016
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits.
IEEE Trans. Inf. Theory, 2016

Leakage-Resilient Cryptography from Minimal Assumptions.
J. Cryptol., 2016

Adaptive Security of Yao's Garbled Circuits.
IACR Cryptol. ePrint Arch., 2016

Spooky Encryption and its Applications.
IACR Cryptol. ePrint Arch., 2016

A counterexample to the chain rule for conditional HILL entropy.
Comput. Complex., 2016

Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Obfuscating Conjunctions under Entropic Ring LWE.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Two Round Multiparty Computation via Multi-key FHE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015
New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators.
IACR Cryptol. ePrint Arch., 2015

Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key.
IACR Cryptol. ePrint Arch., 2015

Watermarking Cryptographic Programs Against Arbitrary Removal Strategies.
IACR Cryptol. ePrint Arch., 2015

Two Round MPC from LWE via Multi-Key FHE.
IACR Cryptol. ePrint Arch., 2015

Standard Security Does Not Imply Indistinguishability Under Selective Opening.
IACR Cryptol. ePrint Arch., 2015

Adaptively Secure Garbled Circuits from One-Way Functions.
IACR Cryptol. ePrint Arch., 2015

Watermarking Cryptographic Capabilities.
IACR Cryptol. ePrint Arch., 2015

Perfect Structure on the Edge of Chaos.
IACR Cryptol. ePrint Arch., 2015

Essentially Optimal Robust Secret Sharing with Maximal Corruptions.
IACR Cryptol. ePrint Arch., 2015

2014
Leveled Fully Homomorphic Signatures from Standard Lattices.
IACR Cryptol. ePrint Arch., 2014

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions.
IACR Cryptol. ePrint Arch., 2014

Tamper Detection and Continuous Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2014

On the Communication Complexity of Secure Function Evaluation with Long Output.
IACR Cryptol. ePrint Arch., 2014

Leveled Fully Homomorphic Signatures from Standard Lattices.
IACR Cryptol. ePrint Arch., 2014

Outsourcing Private RAM Computation.
IACR Cryptol. ePrint Arch., 2014

Garbled RAM Revisited, Part I.
IACR Cryptol. ePrint Arch., 2014

Garbled RAM Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Fully Leakage-Resilient Signatures.
J. Cryptol., 2013

Optimizing ORAM and Using it Efficiently for Secure Computation.
IACR Cryptol. ePrint Arch., 2013

Key Derivation Without Entropy Waste.
IACR Cryptol. ePrint Arch., 2013

Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust.
IACR Cryptol. ePrint Arch., 2013

Learning with Rounding, Revisited: New Reduction, Properties and Applications.
IACR Cryptol. ePrint Arch., 2013

Why "Fiat-Shamir for Proofs" Lacks a Proof.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012
Barriers in Cryptography with Weak, Correlated and Leaky Sources.
IACR Cryptol. ePrint Arch., 2012

Fully Homomorphic Message Authenticators.
IACR Cryptol. ePrint Arch., 2012

Message Authentication, Revisited.
IACR Cryptol. ePrint Arch., 2012

Counterexamples to Hardness Amplification Beyond Negligible.
IACR Cryptol. ePrint Arch., 2012

Why "Fiat-Shamir for Proofs" Lacks a Proof.
IACR Cryptol. ePrint Arch., 2012

On Continual Leakage of Discrete Log Representations.
IACR Cryptol. ePrint Arch., 2012

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
Cryptographic Resilience to Continual Information Leakage.
PhD thesis, 2011

Key-Evolution Schemes Resilient to Space-Bounded Leakage.
IACR Cryptol. ePrint Arch., 2011

Storing Secrets on Continually Leaky Devices.
IACR Cryptol. ePrint Arch., 2011

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.
IACR Cryptol. ePrint Arch., 2011

One-Time Computable Self-erasing Functions.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010
Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions.
IACR Cryptol. ePrint Arch., 2010

One-time Computable and Uncomputable Functions.
IACR Cryptol. ePrint Arch., 2010

Cryptography Against Continuous Memory Attacks.
IACR Cryptol. ePrint Arch., 2010

Efficient Public-Key Cryptography in the Presence of Key Leakage.
IACR Cryptol. ePrint Arch., 2010

On Symmetric Encryption and Point Obfuscation.
IACR Cryptol. ePrint Arch., 2010

2009
Proofs of Retrievability via Hardness Amplification.
IACR Cryptol. ePrint Arch., 2009

Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.
IACR Cryptol. ePrint Arch., 2009

Public-Key Encryption in the Bounded-Retrieval Model.
IACR Cryptol. ePrint Arch., 2009

Survey: Leakage Resilience and the Bounded Retrieval Model.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

2008
Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2008

Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets.
IACR Cryptol. ePrint Arch., 2008

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.
IACR Cryptol. ePrint Arch., 2008

2007
Universally Composable Multiparty Computation with Partially Isolated Parties.
IACR Cryptol. ePrint Arch., 2007

Isolated Proofs of Knowledge and Isolated Zero Knowledge.
IACR Cryptol. ePrint Arch., 2007


  Loading...