default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Wichs
Person information
- affiliation: Northeastern University, Boston, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c110]Jad Silbak, Daniel Wichs:
Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions. ITCS 2025: 88:1-88:23- [i116]Jad Silbak, Daniel Wichs:
Binary Codes for Error Detection and Correction in a Computationally Bounded World. IACR Cryptol. ePrint Arch. 2025: 190 (2025) - [i115]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC. IACR Cryptol. ePrint Arch. 2025: 235 (2025) - [i114]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Black Box Crypto is Useless for Doubly Efficient PIR. IACR Cryptol. ePrint Arch. 2025: 552 (2025) - 2024
- [j14]Daniel Wichs:
Technical Perspective: Hiding Secrets in Programs. Commun. ACM 67(3): 96 (2024) - [j13]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, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu:
Efficient Maliciously Secure Oblivious Exponentiations. IACR Commun. Cryptol. 1(3): 10 (2024) - [c109]Alexander Bienstock, Yevgeniy Dodis, Paul Rösler, Daniel Wichs:
Interval Key-Encapsulation Mechanism. ASIACRYPT (2) 2024: 361-393 - [c108]Fangqi Dong, Zihan Hao, Ethan Mook, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE. CRYPTO (3) 2024: 107-142 - [c107]Yuval Ishai, Elaine Shi, Daniel Wichs:
PIR with Client-Side Preprocessing: Information-Theoretic Constructions and Lower Bounds. CRYPTO (9) 2024: 148-182 - [c106]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC. CRYPTO (8) 2024: 240-273 - [c105]Fangqi Dong, Zihan Hao, Ethan Mook, Daniel Wichs:
Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation. EUROCRYPT (2) 2024: 190-218 - [c104]Yevgeniy Dodis, Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs:
How to Simulate Random Oracles with Auxiliary Input. FOCS 2024: 1207-1230 - [c103]Brent Waters, Daniel Wichs:
Adaptively Secure Attribute-Based Encryption from Witness Encryption. TCC (3) 2024: 65-90 - [i113]Carsten Baum, Jens Berlips, Walther Chen, Hongrui Cui, Ivan Damgård, Jiangbin Dong, Kevin M. Esvelt, Mingyu Gao, Dana Gretton, Leonard Foner, Martin Kysel, Kaiyi Zhang, Juanru Li, Xiang Li, Omer Paneth, Ronald L. Rivest, Francesca Sage-Ling, Adi Shamir, Yue Shen, Meicen Sun, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Yun Wang, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu, Haoling Zhang:
A system capable of verifiably and privately screening global DNA synthesis. CoRR abs/2403.14023 (2024) - [i112]Fangqi Dong, Zihan Hao, Ethan Mook, Daniel Wichs:
Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation. IACR Cryptol. ePrint Arch. 2024: 68 (2024) - [i111]Fangqi Dong, Zihan Hao, Ethan Mook, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE. IACR Cryptol. ePrint Arch. 2024: 897 (2024) - [i110]Yuval Ishai, Elaine Shi, Daniel Wichs:
PIR with Client-Side Preprocessing: Information-Theoretic Constructions and Lower Bounds. IACR Cryptol. ePrint Arch. 2024: 976 (2024) - [i109]Alexander Bienstock, Yevgeniy Dodis, Paul Rösler, Daniel Wichs:
Interval Key-Encapsulation Mechanism. IACR Cryptol. ePrint Arch. 2024: 1454 (2024) - [i108]Jad Silbak, Daniel Wichs:
Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions. IACR Cryptol. ePrint Arch. 2024: 1461 (2024) - [i107]Brent Waters, Daniel Wichs:
Adaptively Secure Attribute-Based Encryption from Witness Encryption. IACR Cryptol. ePrint Arch. 2024: 1486 (2024) - [i106]Carsten Baum, Jens Berlips, Walther Chen, Ivan Damgård, Kevin M. Esvelt, Leonard Foner, Dana Gretton, Martin Kysel, Ronald L. Rivest, Lawrence Roy, Francesca Sage-Ling, Adi Shamir, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu:
Efficient Maliciously Secure Oblivious Exponentiations. IACR Cryptol. ePrint Arch. 2024: 1613 (2024) - 2023
- [j12]Ran Cohen, Abhi Shelat, Daniel Wichs:
Adaptively Secure MPC with Sublinear Communication Complexity. J. Cryptol. 36(2): 11 (2023) - [c102]Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs:
The Pseudorandom Oracle Model and Ideal Obfuscation. CRYPTO (4) 2023: 233-262 - [c101]Brent Waters, Daniel Wichs:
Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM. CRYPTO (2) 2023: 674-693 - [c100]Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited. EUROCRYPT (1) 2023: 86-116 - [c99]Suvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs:
A Map of Witness Maps: New Definitions and Connections. Public Key Cryptography (2) 2023: 635-662 - [c98]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. STOC 2023: 595-608 - [c97]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Boosting Batch Arguments and RAM Delegation. STOC 2023: 1545-1552 - [c96]Willy Quach, LaKyah Tyner, Daniel Wichs:
Lower Bounds on Anonymous Whistleblowing. TCC (3) 2023: 3-32 - [c95]Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance. TCC (3) 2023: 93-122 - [c94]Yevgeniy Dodis, Shai Halevi, Daniel Wichs:
Security with Functional Re-encryption from CPA. TCC (2) 2023: 279-305 - [i105]Suvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs:
A Map of Witness Maps: New Definitions and Connections. IACR Cryptol. ePrint Arch. 2023: 343 (2023) - [i104]Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Somewhere Randomness Extraction and Security against Bounded-Storage Mass Surveillance. IACR Cryptol. ePrint Arch. 2023: 409 (2023) - [i103]Brent Waters, Daniel Wichs:
Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM. IACR Cryptol. ePrint Arch. 2023: 1058 (2023) - [i102]Yevgeniy Dodis, Shai Halevi, Daniel Wichs:
Security with Functional Re-Encryption from CPA. IACR Cryptol. ePrint Arch. 2023: 1443 (2023) - [i101]Willy Quach, LaKyah Tyner, Daniel Wichs:
Lower Bounds on Anonymous Whistleblowing. IACR Cryptol. ePrint Arch. 2023: 1483 (2023) - 2022
- [c93]Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Witness Encryption and Null-IO from Evasive LWE. ASIACRYPT (1) 2022: 195-221 - [c92]Saikrishna Badrinarayanan, Yuval Ishai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC. ITC 2022: 10:1-10:21 - [c91]Justin Holmgren, Minghao Liu, LaKyah Tyner, Daniel Wichs:
Nearly Optimal Property Preserving Hashing. CRYPTO (3) 2022: 473-502 - [c90]Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Incompressible Cryptography. EUROCRYPT (1) 2022: 700-730 - [c89]Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Authentication in the Bounded Storage Model. EUROCRYPT (3) 2022: 737-766 - [c88]Yevgeniy Dodis, Harish Karthikeyan, Daniel Wichs:
Small-Box Cryptography. ITCS 2022: 56:1-56:25 - [c87]Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs:
Post-quantum Insecurity from LWE. TCC (1) 2022: 3-32 - [i100]Yevgeniy Dodis, Harish Karthikeyan, Daniel Wichs:
Updatable Public Key Encryption in the Standard Model. IACR Cryptol. ePrint Arch. 2022: 68 (2022) - [i99]Yevgeniy Dodis, Harish Karthikeyan, Daniel Wichs:
Small-Box Cryptography. IACR Cryptol. ePrint Arch. 2022: 69 (2022) - [i98]Saikrishna Badrinarayanan, Yuval Ishai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC. IACR Cryptol. ePrint Arch. 2022: 681 (2022) - [i97]Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Authentication in the Bounded Storage Model. IACR Cryptol. ePrint Arch. 2022: 690 (2022) - [i96]Justin Holmgren, Minghao Liu, LaKyah Tyner, Daniel Wichs:
Nearly Optimal Property Preserving Hashing. IACR Cryptol. ePrint Arch. 2022: 842 (2022) - [i95]Alex Lombardi, Ethan Mook, Willy Quach, Daniel Wichs:
Post-Quantum Insecurity from LWE. IACR Cryptol. ePrint Arch. 2022: 869 (2022) - [i94]Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Witness Encryption and Null-IO from Evasive LWE. IACR Cryptol. ePrint Arch. 2022: 1140 (2022) - [i93]Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs:
The Pseudorandom Oracle Model and Ideal Obfuscation. IACR Cryptol. ePrint Arch. 2022: 1204 (2022) - [i92]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Boosting Batch Arguments and RAM Delegation. IACR Cryptol. ePrint Arch. 2022: 1320 (2022) - [i91]Wei-Kai Lin, Ethan Mook, Daniel Wichs:
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. IACR Cryptol. ePrint Arch. 2022: 1703 (2022) - 2021
- [j11]Mor Weiss, Daniel Wichs:
Is There an Oblivious RAM Lower Bound for Online Reads? J. Cryptol. 34(3): 18 (2021) - [c86]Willy Quach, Brent Waters, Daniel Wichs:
Targeted Lossy Functions and Applications. CRYPTO (4) 2021: 424-453 - [c85]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs:
Limits on the Adaptive Security of Yao's Garbling. CRYPTO (2) 2021: 486-515 - [c84]Hoeteck Wee, Daniel Wichs:
Candidate Obfuscation via Oblivious LWE Sampling. EUROCRYPT (3) 2021: 127-156 - [c83]Yevgeniy Dodis, Harish Karthikeyan, Daniel Wichs:
Updatable Public Key Encryption in the Standard Model. TCC (3) 2021: 254-285 - [c82]Lalita Devadas, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Succinct LWE Sampling, Random Polynomials, and Obfuscation. TCC (2) 2021: 256-287 - [i90]Willy Quach, Brent Waters, Daniel Wichs:
Targeted Lossy Functions and Applications. IACR Cryptol. ePrint Arch. 2021: 895 (2021) - [i89]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs:
Limits on the Adaptive Security of Yao's Garbling. IACR Cryptol. ePrint Arch. 2021: 945 (2021) - [i88]Lalita Devadas, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Succinct LWE Sampling, Random Polynomials, and Obfuscation. IACR Cryptol. ePrint Arch. 2021: 1226 (2021) - [i87]Yevgeniy Dodis, Willy Quach, Daniel Wichs:
Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited. IACR Cryptol. ePrint Arch. 2021: 1270 (2021) - [i86]Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Incompressible Cryptography. IACR Cryptol. ePrint Arch. 2021: 1679 (2021) - 2020
- [j10]Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs:
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. J. Cryptol. 33(2): 357-405 (2020) - [c81]Xin Li, Fermi Ma, Willy Quach, Daniel Wichs:
Leakage-Resilient Key Exchange and Two-Seed Extractors. CRYPTO (1) 2020: 401-429 - [c80]Tal Moran, Daniel Wichs:
Incompressible Encodings. CRYPTO (1) 2020: 494-523 - [c79]Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
Extracting Randomness from Extractor-Dependent Sources. EUROCRYPT (1) 2020: 313-342 - [c78]Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Statistical ZAPR Arguments from Bilinear Maps. EUROCRYPT (3) 2020: 620-641 - [c77]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs:
Two-Round Oblivious Transfer from CDH or LPN. EUROCRYPT (2) 2020: 768-797 - [c76]Suvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs:
Witness Maps and Applications. Public Key Cryptography (1) 2020: 220-246 - [c75]Shweta Agrawal, Daniel Wichs, Shota Yamada:
Optimal Broadcast Encryption from LWE and Pairings in the Standard Model. TCC (1) 2020: 149-178 - [e2]Yael Tauman Kalai, Adam D. Smith, Daniel Wichs:
1st Conference on Information-Theoretic Cryptography, ITC 2020, June 17-19, 2020, Boston, MA, USA. LIPIcs 163, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-151-1 [contents] - [i85]Suvradip Chakraborty, Manoj Prabhakaran, Daniel Wichs:
Witness Maps and Applications. IACR Cryptol. ePrint Arch. 2020: 90 (2020) - [i84]Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Statistical ZAPR Arguments from Bilinear Maps. IACR Cryptol. ePrint Arch. 2020: 256 (2020) - [i83]Xin Li, Fermi Ma, Willy Quach, Daniel Wichs:
Leakage-Resilient Key Exchange and Two-Seed Extractors. IACR Cryptol. ePrint Arch. 2020: 771 (2020) - [i82]Tal Moran, Daniel Wichs:
Incompressible Encodings. IACR Cryptol. ePrint Arch. 2020: 814 (2020) - [i81]Hoeteck Wee, Daniel Wichs:
Candidate Obfuscation via Oblivious LWE Sampling. IACR Cryptol. ePrint Arch. 2020: 1042 (2020) - [i80]Shweta Agrawal, Daniel Wichs, Shota Yamada:
Optimal Broadcast Encryption from LWE and Pairings in the Standard Model. IACR Cryptol. ePrint Arch. 2020: 1179 (2020)
2010 – 2019
- 2019
- [c74]Ran Cohen, Abhi Shelat, Daniel Wichs:
Adaptively Secure MPC with Sublinear Communication Complexity. CRYPTO (2) 2019: 30-60 - [c73]Marshall Ball, Siyao Guo, Daniel Wichs:
Non-malleable Codes for Decision Trees. CRYPTO (1) 2019: 413-434 - [c72]Ariel Hamlin, Justin Holmgren, Mor Weiss, Daniel Wichs:
On the Plausibility of Fully Homomorphic Encryption for RAMs. CRYPTO (1) 2019: 589-619 - [c71]Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu:
New Constructions of Reusable Designated-Verifier NIZKs. CRYPTO (3) 2019: 670-700 - [c70]Rishab Goyal, Willy Quach, Brent Waters, Daniel Wichs:
Broadcast and Trace with N^ε Ciphertext Size from Standard Assumptions. CRYPTO (3) 2019: 826-855 - [c69]Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs:
Private Anonymous Data Access. EUROCRYPT (2) 2019: 244-273 - [c68]Willy Quach, Ron D. Rothblum, Daniel Wichs:
Reusable Designated-Verifier NIZKs for all NP from CDH. EUROCRYPT (2) 2019: 593-621 - [c67]Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. EUROCRYPT (3) 2019: 619-635 - [c66]Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs:
Fiat-Shamir: from practice to theory. STOC 2019: 1082-1090 - [i79]Willy Quach, Ron D. Rothblum, Daniel Wichs:
Reusable Designated-Verifier NIZKs for all NP from CDH. IACR Cryptol. ePrint Arch. 2019: 235 (2019) - [i78]Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu:
New Constructions of Reusable Designated-Verifier NIZKs. IACR Cryptol. ePrint Arch. 2019: 242 (2019) - [i77]Marshall Ball, Siyao Guo, Daniel Wichs:
Non-Malleable Codes for Decision Trees. IACR Cryptol. ePrint Arch. 2019: 379 (2019) - [i76]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs:
Two-Round Oblivious Transfer from CDH or LPN. IACR Cryptol. ePrint Arch. 2019: 414 (2019) - [i75]Ariel Hamlin, Justin Holmgren, Mor Weiss, Daniel Wichs:
On the Plausibility of Fully Homomorphic Encryption for RAMs. IACR Cryptol. ePrint Arch. 2019: 632 (2019) - [i74]Rishab Goyal, Willy Quach, Brent Waters, Daniel Wichs:
Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions. IACR Cryptol. ePrint Arch. 2019: 636 (2019) - [i73]Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
2-Message Publicly Verifiable WI from (Subexponential) LWE. IACR Cryptol. ePrint Arch. 2019: 808 (2019) - [i72]Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
Extracting Randomness from Extractor-Dependent Sources. IACR Cryptol. ePrint Arch. 2019: 1339 (2019) - 2018
- [j9]Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs:
Non-Malleable Codes. J. ACM 65(4): 20:1-20:32 (2018) - [j8]Aloni Cohen, Justin Holmgren, Ryo Nishimaki, Vinod Vaikuntanathan, Daniel Wichs:
Watermarking Cryptographic Capabilities. SIAM J. Comput. 47(6): 2157-2202 (2018) - [c65]Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Daniel Wichs:
Hardness of Non-interactive Differential Privacy from One-Way Functions. CRYPTO (1) 2018: 437-466 - [c64]Willy Quach, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and Applications. FOCS 2018: 859-870 - [c63]Ariel Hamlin, Abhi Shelat, Mor Weiss, Daniel Wichs:
Multi-Key Searchable Encryption, Revisited. Public Key Cryptography (1) 2018: 95-124 - [c62]Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs:
Non-trivial Witness Encryption and Null-iO from Standard Assumptions. SCN 2018: 425-441 - [c61]Saikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Succinct delegation for low-space non-deterministic computation. STOC 2018: 709-721 - [c60]Yilei Chen, Vinod Vaikuntanathan, Brent Waters, Hoeteck Wee, Daniel Wichs:
Traitor-Tracing from LWE Made Simple and Attribute-Based. TCC (2) 2018: 341-369 - [c59]Mor Weiss, Daniel Wichs:
Is There an Oblivious RAM Lower Bound for Online Reads? TCC (2) 2018: 603-635 - [c58]Willy Quach, Daniel Wichs, Giorgos Zirdelis:
Watermarking PRFs Under Standard Assumptions: Public Marking and Security with Extraction Queries. TCC (2) 2018: 669-698 - [i71]Saikrishna Badrinarayanan, Yael Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Non-Interactive Delegation for Low-Space Non-Deterministic Computation. Electron. Colloquium Comput. Complex. TR18 (2018) - [i70]Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. Electron. Colloquium Comput. Complex. TR18 (2018) - [i69]Ariel Hamlin, Abhi Shelat, Mor Weiss, Daniel Wichs:
Multi-Key Searchable Encryption, Revisited. IACR Cryptol. ePrint Arch. 2018: 18 (2018) - [i68]Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. IACR Cryptol. ePrint Arch. 2018: 279 (2018) - [i67]Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs:
Private Anonymous Data Access. IACR Cryptol. ePrint Arch. 2018: 363 (2018) - [i66]Willy Quach, Hoeteck Wee, Daniel Wichs:
Laconic Function Evaluation and Applications. IACR Cryptol. ePrint Arch. 2018: 409 (2018) - [i65]Mor Weiss, Daniel Wichs:
Is there an Oblivious RAM Lower Bound for Online Reads? IACR Cryptol. ePrint Arch. 2018: 619 (2018) - [i64]Yilei Chen, Vinod Vaikuntanathan, Brent Waters, Hoeteck Wee, Daniel Wichs:
Traitor-Tracing from LWE Made Simple and Attribute-Based. IACR Cryptol. ePrint Arch. 2018: 897 (2018) - [i63]Willy Quach, Daniel Wichs, Giorgos Zirdelis:
Watermarking PRFs under Standard Assumptions: Public Marking and Security with Extraction Queries. IACR Cryptol. ePrint Arch. 2018: 906 (2018) - [i62]Ran Cohen, Abhi Shelat, Daniel Wichs:
Adaptively Secure MPC with Sublinear Communication Complexity. IACR Cryptol. ePrint Arch. 2018: 1161 (2018) - [i61]Ran Canetti, Alex Lombardi, Daniel Wichs:
Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE. IACR Cryptol. ePrint Arch. 2018: 1248 (2018) - 2017
- [j7]Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs:
How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs. Algorithmica 79(4): 1196-1232 (2017) - [j6]Sanjam Garg, Craig Gentry, Shai Halevi, Daniel Wichs:
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input. Algorithmica 79(4): 1353-1373 (2017) - [j5]David Cash, Alptekin Küpçü, Daniel Wichs:
Dynamic Proofs of Retrievability Via Oblivious RAM. J. Cryptol. 30(1): 22-57 (2017) - [c57]Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs:
Be Adaptive, Avoid Overcommitting. CRYPTO (1) 2017: 133-163 - [c56]Daniel Wichs, Giorgos Zirdelis:
Obfuscating Compute-and-Compare Programs under LWE. FOCS 2017: 600-611 - [c55]Zahra Jafargholi, Alessandra Scafuro, Daniel Wichs:
Adaptively Indistinguishable Garbled Circuits. TCC (2) 2017: 40-71 - [c54]Shafi Goldwasser, Saleet Klein, Daniel Wichs:
The Edited Truth. TCC (1) 2017: 305-340 - [i60]Daniel Wichs, Giorgos Zirdelis:
Obfuscating Compute-and-Compare Programs under LWE. IACR Cryptol. ePrint Arch. 2017: 276 (2017) - [i59]Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs:
Be Adaptive, Avoid Overcommitting. IACR Cryptol. ePrint Arch. 2017: 515 (2017) - [i58]Shafi Goldwasser, Saleet Klein, Daniel Wichs:
The Edited Truth. IACR Cryptol. ePrint Arch. 2017: 714 (2017) - [i57]Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs:
Non-Trivial Witness Encryption and Null-iO from Standard Assumptions. IACR Cryptol. ePrint Arch. 2017: 874 (2017) - [i56]Zahra Jafargholi, Alessandra Scafuro, Daniel Wichs:
Adaptively Indistinguishable Garbled Circuits. IACR Cryptol. ePrint Arch. 2017: 934 (2017) - [i55]Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Daniel Wichs:
Hardness of Non-Interactive Differential Privacy from One-Way Functions. IACR Cryptol. ePrint Arch. 2017: 1107 (2017) - [i54]Saikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Non-Interactive Delegation for Low-Space Non-Deterministic Computation. IACR Cryptol. ePrint Arch. 2017: 1250 (2017) - 2016
- [j4]Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia, Daniel Wichs:
A counterexample to the chain rule for conditional HILL entropy. Comput. Complex. 25(3): 567-605 (2016) - [j3]Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. J. Cryptol. 29(3): 514-551 (2016) - [j2]Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs:
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits. IEEE Trans. Inf. Theory 62(12): 7179-7194 (2016) - [c53]Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs:
Spooky Encryption and Its Applications. CRYPTO (3) 2016: 93-122 - [c52]Brett Hemenway, Zahra Jafargholi, Rafail Ostrovsky, Alessandra Scafuro, Daniel Wichs:
Adaptively Secure Garbled Circuits from One-Way Functions. CRYPTO (3) 2016: 149-178 - [c51]Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, Daniel Wichs:
Essentially Optimal Robust Secret Sharing with Maximal Corruptions. EUROCRYPT (1) 2016: 58-86 - [c50]Ryo Nishimaki, Daniel Wichs, Mark Zhandry:
Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key. EUROCRYPT (2) 2016: 388-419 - [c49]Pratyay Mukherjee, Daniel Wichs:
Two Round Multiparty Computation via Multi-key FHE. EUROCRYPT (2) 2016: 735-763 - [c48]Zvika Brakerski, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Obfuscating Conjunctions under Entropic Ring LWE. ITCS 2016: 147-156 - [c47]Aloni Cohen, Justin Holmgren, Ryo Nishimaki, Vinod Vaikuntanathan, Daniel Wichs:
Watermarking cryptographic capabilities. STOC 2016: 1115-1127 - [c46]Dennis Hofheinz, Vanishree Rao, Daniel Wichs:
Standard Security Does Not Imply Indistinguishability Under Selective Opening. TCC (B2) 2016: 121-145 - [c45]Srinivas Devadas, Marten van Dijk, Christopher W. Fletcher, Ling Ren, Elaine Shi, Daniel Wichs:
Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM. TCC (A2) 2016: 145-174 - [c44]Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs:
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. TCC (B2) 2016: 391-418 - [c43]Zahra Jafargholi, Daniel Wichs:
Adaptive Security of Yao's Garbled Circuits. TCC (B1) 2016: 433-458 - [c42]Nir Bitansky, Omer Paneth, Daniel Wichs:
Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. TCC (A1) 2016: 474-502 - [e1]Daniel Wichs, Yishay Mansour:
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. ACM 2016, ISBN 978-1-4503-4132-5 [contents] - [i53]Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs:
Spooky Encryption and its Applications. IACR Cryptol. ePrint Arch. 2016: 272 (2016) - [i52]Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs:
From Cryptomania to Obfustopia through Secret-Key Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 558 (2016) - [i51]Zahra Jafargholi, Daniel Wichs:
Adaptive Security of Yao's Garbled Circuits. IACR Cryptol. ePrint Arch. 2016: 814 (2016) - 2015
- [c41]Tatsuaki Okamoto, Krzysztof Pietrzak, Brent Waters, Daniel Wichs:
New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. ASIACRYPT (1) 2015: 121-145 - [c40]Pavel Hubácek, Daniel Wichs:
On the Communication Complexity of Secure Function Evaluation with Long Output. ITCS 2015: 163-172 - [c39]Vadim Lyubashevsky, Daniel Wichs:
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. Public Key Cryptography 2015: 716-730 - [c38]Sergey Gorbunov, Vinod Vaikuntanathan, Daniel Wichs:
Leveled Fully Homomorphic Signatures from Standard Lattices. STOC 2015: 469-477 - [c37]Zahra Jafargholi, Daniel Wichs:
Tamper Detection and Continuous Non-malleable Codes. TCC (1) 2015: 451-480 - [i50]Nir Bitansky, Omer Paneth, Daniel Wichs:
Perfect Structure on the Edge of Chaos. IACR Cryptol. ePrint Arch. 2015: 126 (2015) - [i49]Ryo Nishimaki, Daniel Wichs:
Watermarking Cryptographic Programs Against Arbitrary Removal Strategies. IACR Cryptol. ePrint Arch. 2015: 344 (2015) - [i48]Pratyay Mukherjee, Daniel Wichs:
Two Round MPC from LWE via Multi-Key FHE. IACR Cryptol. ePrint Arch. 2015: 345 (2015) - [i47]Ryo Nishimaki, Daniel Wichs, Mark Zhandry:
Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key. IACR Cryptol. ePrint Arch. 2015: 750 (2015) - [i46]Dennis Hofheinz, Vanishree Rao, Daniel Wichs:
Standard Security Does Not Imply Indistinguishability Under Selective Opening. IACR Cryptol. ePrint Arch. 2015: 792 (2015) - [i45]Tatsuaki Okamoto, Krzysztof Pietrzak, Brent Waters, Daniel Wichs:
New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. IACR Cryptol. ePrint Arch. 2015: 869 (2015) - [i44]Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, Daniel Wichs:
Essentially Optimal Robust Secret Sharing with Maximal Corruptions. IACR Cryptol. ePrint Arch. 2015: 1032 (2015) - [i43]Aloni Cohen, Justin Holmgren, Ryo Nishimaki, Vinod Vaikuntanathan, Daniel Wichs:
Watermarking Cryptographic Capabilities. IACR Cryptol. ePrint Arch. 2015: 1096 (2015) - [i42]Brett Hemenway, Zahra Jafargholi, Rafail Ostrovsky, Alessandra Scafuro, Daniel Wichs:
Adaptively Secure Garbled Circuits from One-Way Functions. IACR Cryptol. ePrint Arch. 2015: 1250 (2015) - 2014
- [c36]Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs:
How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGs. CRYPTO (2) 2014: 37-54 - [c35]Sanjam Garg, Craig Gentry, Shai Halevi, Daniel Wichs:
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input. CRYPTO (1) 2014: 518-535 - [c34]Yevgeniy Dodis, Krzysztof Pietrzak, Daniel Wichs:
Key Derivation without Entropy Waste. EUROCRYPT 2014: 93-110 - [c33]Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs:
Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits. EUROCRYPT 2014: 111-128 - [c32]Craig Gentry, Shai Halevi, Steve Lu, Rafail Ostrovsky, Mariana Raykova, Daniel Wichs:
Garbled RAM Revisited. EUROCRYPT 2014: 405-422 - [c31]Craig Gentry, Shai Halevi, Mariana Raykova, Daniel Wichs:
Outsourcing Private RAM Computation. FOCS 2014: 404-413 - [i41]Craig Gentry, Shai Halevi, Mariana Raykova, Daniel Wichs:
Garbled RAM Revisited, Part I. IACR Cryptol. ePrint Arch. 2014: 82 (2014) - [i40]Craig Gentry, Shai Halevi, Mariana Raykova, Daniel Wichs:
Outsourcing Private RAM Computation. IACR Cryptol. ePrint Arch. 2014: 148 (2014) - [i39]Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs:
How to Eat Your Entropy and Have it Too - Optimal Recovery Strategies for Compromised RNGs. IACR Cryptol. ePrint Arch. 2014: 167 (2014) - [i38]Daniel Wichs:
Leveled Fully Homomorphic Signatures from Standard Lattices. IACR Cryptol. ePrint Arch. 2014: 451 (2014) - [i37]Pavel Hubácek, Daniel Wichs:
On the Communication Complexity of Secure Function Evaluation with Long Output. IACR Cryptol. ePrint Arch. 2014: 669 (2014) - [i36]Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia, Daniel Wichs:
A Counterexample to the Chain Rule for Conditional HILL Entropy. IACR Cryptol. ePrint Arch. 2014: 678 (2014) - [i35]Sergey Gorbunov, Vinod Vaikuntanathan, Daniel Wichs:
Leveled Fully Homomorphic Signatures from Standard Lattices. IACR Cryptol. ePrint Arch. 2014: 897 (2014) - [i34]Zahra Jafargholi, Daniel Wichs:
Tamper Detection and Continuous Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2014: 956 (2014) - [i33]Vadim Lyubashevsky, Daniel Wichs:
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. IACR Cryptol. ePrint Arch. 2014: 1027 (2014) - 2013
- [j1]Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. J. Cryptol. 26(3): 513-558 (2013) - [c30]Rosario Gennaro, Daniel Wichs:
Fully Homomorphic Message Authenticators. ASIACRYPT (2) 2013: 301-320 - [c29]Shweta Agrawal, Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
On Continual Leakage of Discrete Log Representations. ASIACRYPT (2) 2013: 401-420 - [c28]Yevgeniy Dodis, David Pointcheval, Sylvain Ruhault, Damien Vergnaud, Daniel Wichs:
Security analysis of pseudo-random number generators with input: /dev/random is not robust. CCS 2013: 647-658 - [c27]Joël Alwen, Stephan Krenn, Krzysztof Pietrzak, Daniel Wichs:
Learning with Rounding, Revisited - New Reduction, Properties and Applications. CRYPTO (1) 2013: 57-74 - [c26]Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. EUROCRYPT 2013: 160-176 - [c25]David Cash, Alptekin Küpçü, Daniel Wichs:
Dynamic Proofs of Retrievability via Oblivious RAM. EUROCRYPT 2013: 279-295 - [c24]Daniel Wichs:
Barriers in cryptography with weak, correlated and leaky sources. ITCS 2013: 111-126 - [c23]Craig Gentry, Kenny A. Goldman, Shai Halevi, Charanjit S. Jutla, Mariana Raykova, Daniel Wichs:
Optimizing ORAM and Using It Efficiently for Secure Computation. Privacy Enhancing Technologies 2013: 1-18 - [c22]Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt, Daniel Wichs:
Why "Fiat-Shamir for Proofs" Lacks a Proof. TCC 2013: 182-201 - [i32]Joël Alwen, Stephan Krenn, Krzysztof Pietrzak, Daniel Wichs:
Learning with Rounding, Revisited: New Reduction, Properties and Applications. IACR Cryptol. ePrint Arch. 2013: 98 (2013) - [i31]Craig Gentry, Kenny A. Goldman, Shai Halevi, Charanjit S. Jutla, Mariana Raykova, Daniel Wichs:
Optimizing ORAM and Using it Efficiently for Secure Computation. IACR Cryptol. ePrint Arch. 2013: 239 (2013) - [i30]Yevgeniy Dodis, David Pointcheval, Sylvain Ruhault, Damien Vergnaud, Daniel Wichs:
Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust. IACR Cryptol. ePrint Arch. 2013: 338 (2013) - [i29]Sebastian Faust, Pratyay Mukherjee, Daniele Venturi, Daniel Wichs:
Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits. IACR Cryptol. ePrint Arch. 2013: 702 (2013) - [i28]Yevgeniy Dodis, Krzysztof Pietrzak, Daniel Wichs:
Key Derivation Without Entropy Waste. IACR Cryptol. ePrint Arch. 2013: 708 (2013) - [i27]Sanjam Garg, Craig Gentry, Shai Halevi, Daniel Wichs:
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 860 (2013) - 2012
- [c21]Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, Daniel Wichs:
Message Authentication, Revisited. EUROCRYPT 2012: 355-374 - [c20]Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, Daniel Wichs:
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. EUROCRYPT 2012: 483-501 - [c19]Yevgeniy Dodis, Abhishek Jain, Tal Moran, Daniel Wichs:
Counterexamples to Hardness Amplification beyond Negligible. TCC 2012: 476-493 - [i26]Yevgeniy Dodis, Abhishek Jain, Tal Moran, Daniel Wichs:
Counterexamples to Hardness Amplification Beyond Negligible. IACR Cryptol. ePrint Arch. 2012: 32 (2012) - [i25]Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, Daniel Wichs:
Message Authentication, Revisited. IACR Cryptol. ePrint Arch. 2012: 59 (2012) - [i24]Rosario Gennaro, Daniel Wichs:
Fully Homomorphic Message Authenticators. IACR Cryptol. ePrint Arch. 2012: 290 (2012) - [i23]Shweta Agrawal, Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
On Continual Leakage of Discrete Log Representations. IACR Cryptol. ePrint Arch. 2012: 367 (2012) - [i22]Daniel Wichs:
Barriers in Cryptography with Weak, Correlated and Leaky Sources. IACR Cryptol. ePrint Arch. 2012: 459 (2012) - [i21]David Cash, Alptekin Küpçü, Daniel Wichs:
Dynamic Proofs of Retrievability via Oblivious RAM. IACR Cryptol. ePrint Arch. 2012: 550 (2012) - [i20]Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2012: 604 (2012) - [i19]Nir Bitansky, Sanjam Garg, Daniel Wichs:
Why "Fiat-Shamir for Proofs" Lacks a Proof. IACR Cryptol. ePrint Arch. 2012: 705 (2012) - 2011
- [b1]Daniel Wichs:
Cryptographic Resilience to Continual Information Leakage. New York University, USA, 2011 - [c18]Stefan Dziembowski, Tomasz Kazana, Daniel Wichs:
Key-Evolution Schemes Resilient to Space-Bounded Leakage. CRYPTO 2011: 335-353 - [c17]Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. EUROCRYPT 2011: 89-108 - [c16]Yevgeniy Dodis, Allison B. Lewko, Brent Waters, Daniel Wichs:
Storing Secrets on Continually Leaky Devices. FOCS 2011: 688-697 - [c15]Craig Gentry, Daniel Wichs:
Separating succinct non-interactive arguments from all falsifiable assumptions. STOC 2011: 99-108 - [c14]Stefan Dziembowski, Tomasz Kazana, Daniel Wichs:
One-Time Computable Self-erasing Functions. TCC 2011: 125-143 - [i18]Yevgeniy Dodis, Allison B. Lewko, Brent Waters, Daniel Wichs:
Storing Secrets on Continually Leaky Devices. IACR Cryptol. ePrint Arch. 2011: 369 (2011) - [i17]Stefan Dziembowski, Tomasz Kazana, Daniel Wichs:
Key-Evolution Schemes Resilient to Space-Bounded Leakage. IACR Cryptol. ePrint Arch. 2011: 530 (2011) - [i16]Gilad Asharov, Abhishek Jain, Daniel Wichs:
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. IACR Cryptol. ePrint Arch. 2011: 613 (2011) - 2010
- [c13]Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs:
Efficient Public-Key Cryptography in the Presence of Key Leakage. ASIACRYPT 2010: 613-631 - [c12]Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs:
Public-Key Encryption in the Bounded-Retrieval Model. EUROCRYPT 2010: 113-134 - [c11]Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs:
Cryptography against Continuous Memory Attacks. FOCS 2010: 511-520 - [c10]Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs:
Non-Malleable Codes. ICS 2010: 434-452 - [c9]Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs:
On Symmetric Encryption and Point Obfuscation. TCC 2010: 52-71 - [i15]Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs:
On Symmetric Encryption and Point Obfuscation. IACR Cryptol. ePrint Arch. 2010: 49 (2010) - [i14]Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs:
Efficient Public-Key Cryptography in the Presence of Key Leakage. IACR Cryptol. ePrint Arch. 2010: 154 (2010) - [i13]Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs:
Cryptography Against Continuous Memory Attacks. IACR Cryptol. ePrint Arch. 2010: 196 (2010) - [i12]Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. IACR Cryptol. ePrint Arch. 2010: 488 (2010) - [i11]Stefan Dziembowski, Tomasz Kazana, Daniel Wichs:
One-time Computable and Uncomputable Functions. IACR Cryptol. ePrint Arch. 2010: 541 (2010) - [i10]Craig Gentry, Daniel Wichs:
Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2010: 610 (2010)
2000 – 2009
- 2009
- [c8]Joël Alwen, Yevgeniy Dodis, Daniel Wichs:
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model. CRYPTO 2009: 36-54 - [c7]Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou:
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer. CRYPTO 2009: 505-523 - [c6]Joël Alwen, Yevgeniy Dodis, Daniel Wichs:
Survey: Leakage Resilience and the Bounded Retrieval Model. ICITS 2009: 1-18 - [c5]Yevgeniy Dodis, Daniel Wichs:
Non-malleable extractors and symmetric key cryptography from weak secrets. STOC 2009: 601-610 - [c4]Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs:
Proofs of Retrievability via Hardness Amplification. TCC 2009: 109-127 - [c3]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
Universally Composable Multiparty Computation with Partially Isolated Parties. TCC 2009: 315-331 - [i9]Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs:
Proofs of Retrievability via Hardness Amplification. IACR Cryptol. ePrint Arch. 2009: 41 (2009) - [i8]Joël Alwen, Yevgeniy Dodis, Daniel Wichs:
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model. IACR Cryptol. ePrint Arch. 2009: 160 (2009) - [i7]Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs:
Public-Key Encryption in the Bounded-Retrieval Model. IACR Cryptol. ePrint Arch. 2009: 512 (2009) - [i6]Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs:
Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2009: 608 (2009) - 2008
- [c2]Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. EUROCRYPT 2008: 471-488 - [c1]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
Isolated Proofs of Knowledge and Isolated Zero Knowledge. EUROCRYPT 2008: 509-526 - [i5]Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. IACR Cryptol. ePrint Arch. 2008: 30 (2008) - [i4]Yevgeniy Dodis, Daniel Wichs:
Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets. IACR Cryptol. ePrint Arch. 2008: 503 (2008) - [i3]Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou:
Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer. IACR Cryptol. ePrint Arch. 2008: 534 (2008) - 2007
- [i2]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
Isolated Proofs of Knowledge and Isolated Zero Knowledge. IACR Cryptol. ePrint Arch. 2007: 331 (2007) - [i1]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
Universally Composable Multiparty Computation with Partially Isolated Parties. IACR Cryptol. ePrint Arch. 2007: 332 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-03 01:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
