Daniel Wichs

Associate Professor
Khoury College of Computer Sciences.
Northeastern University
wichs@ccs.neu.edu

Senior Scientist
NTT Research

About Me [CV]


I am an associate professor at the department of computer science at Northeastern University. I am part of the cryptography and privacy group, which is part of theory and security.
My main research area is cryptography. Some of the topics I work on are: I am also broadly interested in computer security, algorithms, complexity theory, coding theory and information theory.

Prior to joining Northeastern, I was a Josef Raviv Memorial Postdoctoral Fellow at IBM Research T.J. Watson.

I got my PhD in Computer Science at New York University (NYU) in 2011. I was very fortunate to have Yevgeniy Dodis as my advisor.
I got my Bachelor's degree in Mathematics and Master's degree in Computer Science at Stanford University in 2005.

Thanks:

To the STOC 2023 PC for the best paper award.
To J.P. Morgan for the 2022 faculty research award.
To the Alfred P. Sloan Foundation for the 2018 Sloan Research Fellowship.
To the NSF for the 2018 CAREER Award.

Research Group

Students and Postdocs

Visitors

Current

Manu Kondapaneni (PhD student)
LaKyah Tyner (PhD student, co-advised with abhi shelat)
Ethan Mook (PhD student)

Alumni

Wei-Kai Lin (Postdoc → Professor at Univerdity of Virginia)
Omer Paneth (Postdoc → Professor at Tel Aviv University)
Siyao Guo (Postdoc → Professor at NYU Shanghai)
Mor Weiss (Postdoc → Postdoc at IDC Herzliya)
Ron Rothblum (Postdoc → Professor at Technion)
Alessandra Scafuro (Postdoc → Professor at North Carolina State)                

Willy Quach (PhD student → Postdoc at Weizmann Institute)
Ariel Hamlin (PhD student → Research Scientist and MIT Lincoln Labs)
Giorgos Zirdelis (PhD student → Postdocs at U Maryland)
Zahra Jafargholi (PhD student → Postdoc at Aarhus University)

Saikrishna Badrinarayanan (visiting: 6/2017 - 09/2017)
Willy Quach (visiting: 03/2017 - 09/2017)
Alain Passelegue (visiting: 9/2015 - 01/2016)
Ryo Nishimaki (visiting: 10/2014 - 01/2016)
Pratyay Mukherjee (visiting: 06/2014 - 09/2015)
Pavel Hubacek (visiting 09/2013- 02/2014)
Yevgeniy Dodis (visiting 01/2013- 06/2013 and 06/2017 - current)


Teaching

Spring 2022 CS 4805/7805 Computational Complextity
Fall 2021 CS 7810: Foundations of Cryptography
Spring 2021 CS 4805/7805 - Advanced/Graduate Theory of Computation
Fall 2020 CS 7880 Special Topics in Cryptography
Spring 2020 CS 4770/6750 Cryptgoraphy
Spring 2018 CS 7805 - PhD Theory of Computation
Fall 2017 CS 7810: Foundations of Cryptography
Spring 2017 CS 7805 - PhD Theory of Computation
Fall 2016 CS 3800 - Theory of Computation
Fall 2015 CS 7880: Graduate Cryptography (Topics in Theory)
Spring 2015 CS 3800 - Theory of Computation
Fall 2014 CS 3800 - Theory of Computation
Spring 2014 CS 6750 - Cryptography and Communications Security
Fall 2013 CS 3800 - Theory of Computation

Service

Co-organizer of the Charles River Crypto Day.
Steering Committee of ITC

Program Chair: ITC 2020
General Chair: STOC 2016

Program Committees

Publications    [DBLP], [Scholar], [IACR]

Preprints

Publications

    2023

  1. Multi-Instance Randomness Extraction and Security against Bounded-Storage Mass Surveillance
    J. Guan, D. Wichs, and M. Zhandry   [pdf]
    TCC 2023

  2. Lower Bounds on Anonymous Whistleblowing
    L. Tyner, W. Quach, and D. Wichs   [pdf]
    TCC 2023

  3. Security with Functional Re-Encryption from CPA
    Y. Dodis and S. Halevi and D. Wichs   [pdf]
    TCC 2023

  4. Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM
    B. Waters and D. Wichs   [pdf]
    CRYPTO 2023

  5. The Pseudorandom Oracle Model and Ideal Obfuscation
    A. Jain, H. Lin, J. Luo, D. Wichs   [pdf]
    CRYPTO 2023

  6. Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
    WK Lin, E. Mook and D. Wichs   [pdf]
    STOC 2023
    best paper award

  7. Boosting Batch Arguments and RAM Delegation
    Y. Tauman Kalai, A. Lombardi, V. Vaikuntanathan, D. Wichs   [pdf]
    STOC 2023

  8. Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited
    Y. Dodis, W. Quach and D. Wichs   [pdf]
    EUROCRYPT 2023

  9. A Map of Witness Maps: New Definitions and Connections
    S. Chakraborty, M. Prabhakaran, and D. Wichs   [pdf]
    PKC 2023

    2022

  10. Post-Quantum Insecurity from LWE
    A. Lombardi, E. Mook, W. Quach and D. Wichs   [pdf]
    TCC 2022

  11. Witness Encryption and Null-IO from Evasive LWE
    V. Vaikuntanathan, H. Wee and D. Wichs   [pdf]
    ASIACRYPT 2022

  12. Nearly Optimal Property Preserving Hashing
    J. Holmgren, M. Liu, L. Tyner and D. Wichs   [pdf]
    CRYPTO 2022

  13. Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC
    S. Badrinarayanan, Y. Ishai, D. Khurana, A. Sahai, and D. Wichs   [pdf]
    ITC 2022

  14. Incompressible Cryptography
    J. Guan, D. Wichs and M. Zhandry   [pdf]
    EUROCRYPT 2022

  15. Authentication in the Bounded Storage Model
    Y. Dodis, W. Quach and D. Wichs   [pdf]
    EUROCRYPT 2022

  16. Small-Box Cryptography
    Y. Dodis, H. Karthikeyan, D. Wichs   [pdf]
    ITCS 2022

    2021

  17. Updatable Public Key Encryption in the Standard Model
    Y. Dodis, H. Karthikeyan, D. Wichs   [pdf]
    TCC 2021

  18. Succinct LWE Sampling, Random Polynomials, and Obfuscation
    L. Devadas, and W. Quach, V. Vaikuntanathan, H. Wee, and D. Wichs   [pdf]
    TCC 2021

  19. Limits on the Adaptive Security of Yao's Garbling
    C. Kamath, K. Klein, K. Pietrzak and D. Wichs   [pdf]
    CRYPTO 2021

  20. Targeted Lossy Functions and Applications
    W. Quach, B. Waters and D. Wichs   [pdf]
    CRYPTO 2021

  21. Candidate Obfuscation via Oblivious LWE Sampling
    H. Wee and D. Wichs   [pdf]
    EUROCRYPT 2021

    2020

  22. Optimal Broadcast Encryption from LWE and Pairings in the Standard Model
    S. Agrawal, D. Wichs, and S. Yamada,  [pdf]
    TCC 2020

  23. Leakage-Resilient Key Exchange and Two-Seed Extractors
    X. Li, F. Ma, W. Quach, and D. Wichs  [pdf]
    CRYPTO 2020

  24. Incompressible Encodings
    T. Moran and D. Wichs  [pdf]
    CRYPTO 2020

  25. Extracting Randomness from Extractor-Dependent Sources
    Y. Dodis, V. Vaikuntanathan, and D. Wichs  [pdf]
    EUROCRYPT 2020

  26. Statistical ZAPR Arguments from Bilinear Maps
    A. Lombardi, V. Vaikuntanathan and D. Wichs  [pdf]
    EUROCRYPT 2020

  27. Two-Round Oblivious Transfer from CDH or LPN
    N. Döttling, S. Garg, M. Hajiabadi, D. Masny and D. Wichs  [pdf]
    EUROCRYPT 2020

  28. Witness Maps and Applications
    S. Chakraborty, M. Prabhakaran, and D. Wichs,  [pdf]
    PKC 2020

    2019

  29. Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions
    R. Goyal, W. Quach, B. Waters and D. Wichs  [pdf]
    CRYPTO 2019

  30. Non-Malleable Codes for Decision Trees
    M. Ball, S. Guo and D. Wichs  [pdf]
    CRYPTO 2019

  31. Fully Homomorphic Encryption for RAMs
    A. Hamlin, J. Holmgren, M. Weiss and D. Wichs  [pdf]
    CRYPTO 2019

  32. New Constructions of Reusable Designated-Verifier NIZKs
    A. Lombardi, W. Quach, R. Rothblum, D. Wichs and D. Wu  [pdf]
    CRYPTO 2019

  33. Adaptively Secure MPC with Sublinear Communication Complexity
    R. Cohen, a. shelat and D. Wichs  [pdf]
    CRYPTO 2019

  34. Fiat-Shamir: From Practice to Theory
    R. Canetti, Y. Chen, J. Holmgren, A. Lombardi, G. Rothblum, R. Rothblum, and D. Wichs
    STOC 2019 (Merge of [CCHLRR] and [CLW])

  35. Private Anonymous Data Access
    A. Hamlin, R. Ostrovsky, M. Weiss and D. Wichs  [pdf]
    EUROCRYPT 2019

  36. Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
    Z. Brakerski, V. Lyubashevsky, V. Vaikuntanathan and D. Wichs  [pdf]
    EUROCRYPT 2019

  37. Reusable Designated-Verifier NIZKs for all NP from CDH
    W. Quach, R. Rothblum, and D. Wichs [pdf]
    EUROCRYPT 2019

    2018

  38. Traitor-Tracing from LWE Made Simple and Attribute-Based
    Y.Chen, V. Vaikuntanathan, B. Waters, H. Wee, and D. Wichs,  [pdf]
    TCC 2018

  39. Watermarking PRFs under Standard Assumptions: Public Marking and Security with Extraction Queries
    W. Quach, D. Wichs and G. Zirdelis,  [pdf]
    TCC 2018

  40. Is there an Oblivious RAM Lower Bound for Online Reads?
    M. Weiss and D. Wichs  [pdf]
    TCC 2018

  41. Laconic Function Evaluation and Applications
    W. Quach, H. Wee, and D. Wichs  [pdf]
    FOCS 2018

  42. Non-Trivial Witness Encryption and Null-iO from Standard Assumptions
    Z. Brakerski, A. Jain, I. Komargodski, A. Passelegue and D. Wichs  [pdf]
    SCN 2018

  43. Hardness of Non-Interactive Differential Privacy from One-Way Functions
    L. Kowalczyk, T. Malkin, J. Ullman and D. Wichs  [    pdf]
    CRYPTO 2018

  44. Non-Interactive Delegation for Low-Space Non-Deterministic Computation
    S. Badrinarayanan, Y. Tauman Kalai, D. Khurana, A. Sahai and D. Wichs  [    pdf]
    STOC 2018

  45. Multi-Key Searchable Encryption, Revisited
    A. Hamlin, a. shelat, M. Weiss and D. Wichs  [    pdf]
    PKC 2018

    2017

  46. Adaptively Indistinguishable Garbled Circuits
    Z. Jafargholi, A. Scafuro and D. Wichs  [    pdf]
    TCC 2017

  47. The Edited Truth
    S. Goldwasser, S. Klein and D. Wichs  [    pdf]
    TCC 2017

  48. Obfuscating Compute-and-Compare Programs under LWE
    D. Wichs and G. Zirdelis  [    pdf]
    FOCS 2017

  49. Be Adaptive, Avoid Overcommitting
    Z. Jafargholi, C. Kamath; K. Klein, I. Komargodski, K. Pietrzak, D. Wichs,   [    pdf]
    CRYPTO 2017

    2016

  50. Adaptive Security of Yao's Garbled Circuits
    Z. Jafargholi, D. Wichs  [    pdf]
    TCC 2016

  51. From Cryptomania to Obfustopia through Secret-Key Functional Encryption
    N. Bitansky, R. Nishimaki, A. Passelegue, D. Wichs  [    pdf]
    TCC 2016

  52. Standard Security Does Not Imply Indistinguishability Under Selective Opening
    D. Hofheinz, V. Rao and D. Wichs  [    pdf]
    TCC 2016

  53. Spooky Encryption and its Applications
    Y. Dodis, S. Halevi, R. Rothblum, D. Wichs  [    pdf]
    CRYPTO 2016

  54. Adaptively Secure Garbled Circuits from One-Way Functions
    B. Hemenway, Z. Jafargholi, R. Ostrovsky, A. Scafuro and D. Wichs  [    pdf]
    CRYPTO 2016

  55. A counterexample to the chain rule for conditional HILL entropy
    S. Krenn, K. Pietrzak, A. Wadia, D. Wichs  [    pdf]
    Computational Complexity Journal

  56. Watermarking Cryptographic Programs Against Arbitrary Removal Strategies
    A. Cohen and J. Holmgren and R. Nishimaki, V. Vaikuntanathan and D. Wichs  [    pdf]
    STOC 2016

  57. Essentially Optimal Robust Secret Sharing with Maximal Corruptions
    A. Bishop, V. Pastro, R. Rajaraman and D. Wichs  [    pdf]
    EUROCRYPT 2016
    honorable mention for best paper award (one of top 3 papers)

  58. Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key
    R. Nishimaki, D. Wichs, and M. Zhandry  [    pdf]
    EUROCRYPT 2016

  59. Two Round Mutliparty Computation via Multi-Key FHE
    P. Mukherjee and D. Wichs  [    pdf]   [slides]   [video]
    EUROCRYPT 2016

  60. Obfuscating Conjunctions under Entropic Ring LWE
    Z. Brakerski, V. Vaikuntanathan, H. Wee and D. Wichs,
    ITCS 2016

  61. Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
    S. Devadas, M. van Dijk, C. Fletcher, L. Ren, E. Shi and D. Wichs  [    pdf]   [video]
    TCC 2016

  62. Perfect Structure on the Edge of Chaos
    N. Bitansky, O. Paneth and D. Wichs  [    pdf]
    TCC 2016

    2015

  63. New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
    T. Okamoto, K. Pietrzak, B. Waters and D. Wichs  [    pdf]
    ASIACRYPT 2015

  64. Leveled Fully Homomorphic Signatures from Standard Lattices
    S. Gorbunov, V. Vaikuntanathan and D. Wichs  [    pdf]   [slides]   [video]
    STOC 2015

  65. Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
    V. Lyubashevsky and D. Wichs  [    pdf]
    PKC 2015

  66. Tamper Detection and Continuous Non-Malleable Codes
    Z. Jafargholi and D. Wichs  [    pdf]   [slides]
    TCC 2015

  67. On the Communication Complexity of Secure Function Evaluation with Long Output
    P. Hubáček and D. Wichs  [    pdf]   [slides]
    ITCS 2015

    2014

  68. Outsourcing Private RAM Computation
    C. Gentry, S. Halevi, M. Raykova and D. Wichs
    FOCS 2014   [    pdf]   [slides]   [video]

  69. On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
    S. Garg, C. Gentry, S. Halevi and D. Wichs
    CRYPTO 2014  (invited to Algorithmica special issue)  [    pdf]   [slides]

  70. How to Eat Your Entropy and Have it Too -- Optimal Recovery Strategies for Compromised RNGs
    Y. Dodis, A. Shamir, N. Stephens-Davidowitz and D. Wichs
    CRYPTO 2014   (invited to Algorithmica special issue)   [    pdf] (see also [Schneier])

  71. Garbled RAM, Revisited
    C. Gentry, S. Halevi, S. Lu, R. Ostrovsky, M. Raykova and D. Wichs
    EUROCRYPT 2014   (merge of     [GHRW14] and [LO14])   [slides]

  72. Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits
    S. Faust, P. Mukherjee, D. Venturi and D. Wichs
    EUROCRYPT 2014   [    pdf]

  73. Key Derivation without Entropy Waste
    Y. Dodis, K. Pietrzak and D. Wichs
    EUROCRYPT 2014   [    pdf]

    2013


  74. On Continual Leakage of Discrete Log Representations
    S. Agrawal, Y. Dodis, V. Vaikuntanathan and D. Wichs
    ASIACRYPT 2013   [    pdf]

  75. Fully Homomorphic Message Authenticators
    R. Gennaro and D. Wichs
    ASIACRYPT 2013   [    pdf]

  76. Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust
    Y. Dodis, D. Pointcheval, S. Ruhault, D. Vergnaud and D. Wichs
    CCS 2013   [    pdf]   (see also [Slashdot] and [Schneier])

  77. Learning with Rounding, Revisited: New Reduction, Properties and Applications
    J. Alwen, S. Krenn, K. Pietrzak and D. Wichs
    CRYPTO 2013   [    pdf]

  78. Optimizing ORAM and Using it Efficiently for Secure Computation
    C. Gentry, K. Goldman, S. Halevi, C. Jutla, M. Raykova and D. Wichs
    PETS 2013   [    pdf]

  79. Leakage-Resilient Cryptography from Minimal Assumptions
    C. Hazay, A. López-Alt, H. Wee and D. Wichs
    EUROCRYPT 2013 and Journal of Cryptology   [    pdf]

  80. Dynamic Proofs of Retrievability via Oblivious RAM
    D. Cash, A. Küpçü and D. Wichs
    EUROCRYPT 2013   [    pdf] [slides]

  81. Why "Fiat-Shamir for Proofs" Lacks a Proof
    N. Bitansky, D. Dachman-Soled, S. Garg, A. Jain, Y. Tauman Kalai, A. Lopez-Alt and D. Wichs
    TCC 2013  (merge of     [BGW] and [DJKL])

  82. Barriers in Cryptography with Weak, Correlated and Leaky Sources
    D. Wichs
    ITCS 2013   [    pdf], [slides]

    2012


  83. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
    G. Asharov, A. Jain, A. López-Alt, E. Tromer, V. Vaikuntanathan and D. Wichs
    EUROCRYPT 2012   (merge     [AJW] , [LTV])

  84. Message Authentication, Revisited
    Y. Dodis, K. Pietrzak, E. Kiltz and D. Wichs
    EUROCRYPT 2012   [    pdf]

  85. Counterexamples to Hardness Amplification Beyond Negligible
    Y. Dodis, A. Jain, T. Moran and D. Wichs
    TCC 2012   [    pdf]   [slides]

    2011


  86. Storing Secrets on Continually Leaky Devices.
    Y. Dodis, A. Lewko, B. Waters and D. Wichs
    FOCS 2011   [    pdf]   [slides]   [video]

  87. Key-Evolution Schemes Resilient to Space-Bounded Leakage.
    S. Dziembowski, T. Kazana and D. Wichs
    CRYPTO 2011   [    pdf]

  88. Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions.
    C. Gentry and D. Wichs
    STOC 2011   [    pdf]   [slides]   [video]

  89. Fully Leakage-Resilient Signatures.
    E. Boyle, G. Segev and D. Wichs
    EUROCRYPT 2011 and Journal of Cryptology (invited paper).  [    pdf]

  90. One-Time Computable Self-Erasing Functions.
    S. Dziembowski, T. Kazana and D. Wichs
    TCC 2011  [    pdf]

    2010


  91. Efficient Public-Key Cryptography in the Presence of Key Leakage.
    Y. Dodis, K. Haralambiev, A. López-Alt and D. Wichs
    ASIACRYPT 2010 (invited to the Journal of Cryptology)   [    pdf]

  92. Cryptography Against Continuous Memory Attacks.
    Y. Dodis, K. Haralambiev, A. López-Alt and D. Wichs
    FOCS 2010   [    pdf]   [slides]   [video]

  93. Public-Key Encryption in the Bounded-Retrieval Model.
    J. Alwen, Y. Dodis, M. Naor, G. Segev, S. Walfish and D. Wichs
    EUROCRYPT 2010   [    pdf]   [slides]

  94. On Symmetric Encryption and Point Obfuscation.
    R. Canetti, Y. Tauman Kalai, M. Varia and D. Wichs
    TCC 2010   [    pdf]   [slides]

  95. Non-Malleable Codes.
    S. Dziembowski, K. Pietrzak and D. Wichs
    ITCS 2010   [    pdf]  [slides]

    2009


  96. Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer.
    J. Garay, D. Wichs and H.S. Zhou
    CRYPTO 2009   [    pdf]

  97. Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.
    J. Alwen, Y. Dodis and D. Wichs
    CRYPTO 2009   [    pdf]   [slides]   [video]

  98. Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets.
    Y. Dodis and D. Wichs
    STOC 2009   [    pdf]  [slides]

  99. Proofs of Retrievability via Hardness Amplification.
    Y. Dodis, S. Vadhan and D. Wichs
    TCC 2009   [    pdf]   [slides]

  100. Universally Composable Multiparty Computation with Partially Isolated Parties.
    I. Damgård, J.B. Nielsen and D. Wichs
    TCC 2009   [    pdf]   [slides]

    2008


  101. Isolated Proofs of Knowledge and Isolated Zero Knowledge.
    I. Damgård, J.B. Nielsen and D. Wichs
    EUROCRYPT 2008   [    pdf]   [slides]

  102. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.
    R. Cramer, Y. Dodis, S. Fehr, C. Padro and D. Wichs
    EUROCRYPT 2008   [    pdf]   [slides]

Thesis, Surveys

  1. PhD Thesis: Cryptographic Resilience to Continual Information Leakage   [pdf]

  2. Survey: Leakage Resilience and the Bounded Retrieval Model
    Joel Alwen, Y. Dodis and D. Wichs
    ICITS 2009   [pdf]


Honors and Awards


Contact Info and Directions

Office Address: Office #622 ISEC, 805 Columbus Av [map]
Mailing Address: 360 Huntington Av, #622 ISEC, Boston, MA 02115
E-mail: [last-name]@ccs.neu.edu