Daniel Wichs

Commun. ACM, March, 2024

Adaptively Secure Attribute-Based Encryption from Witness Encryption.

[BibT_eX]

[DOI]

Brent Waters

IACR Cryptol. ePrint Arch., 2024

Detecting and Correcting Computationally Bounded Errors: A Simple Construction Under Minimal Assumptions.

[BibT_eX]

[DOI]

Jad Silbak

IACR Cryptol. ePrint Arch., 2024

PIR with Client-Side Preprocessing: Information-Theoretic Constructions and Lower Bounds.

[BibT_eX]

[DOI]

Yuval Ishai

Elaine Shi

IACR Cryptol. ePrint Arch., 2024

Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Interval Key-Encapsulation Mechanism.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

Efficient Maliciously Secure Oblivious Exponentiations.

[BibT_eX]

[DOI]

IACR Commun. Cryptol., 2024

How to Simulate Random Oracles with Auxiliary Input.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC.

[BibT_eX]

[DOI]

Wei-Kai Lin

Ethan Mook

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

Adaptively Secure MPC with Sublinear Communication Complexity.

[BibT_eX]

[DOI]

Ran Cohen

Abhi Shelat

J. Cryptol., April, 2023

Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM.

[BibT_eX]

[DOI]

Brent Waters

IACR Cryptol. ePrint Arch., 2023

Lower Bounds on Anonymous Whistleblowing.

[BibT_eX]

[DOI]

LaKyah Tyner

IACR Cryptol. ePrint Arch., 2023

Somewhere Randomness Extraction and Security against Bounded-Storage Mass Surveillance.

[BibT_eX]

[DOI]

Jiaxin Guan

IACR Cryptol. ePrint Arch., 2023

Security with Functional Re-Encryption from CPA.

[BibT_eX]

[DOI]

Shai Halevi

IACR Cryptol. ePrint Arch., 2023

A Map of Witness Maps: New Definitions and Connections.

[BibT_eX]

[DOI]

Suvradip Chakraborty

Manoj Prabhakaran

IACR Cryptol. ePrint Arch., 2023

Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance.

[BibT_eX]

[DOI]

Jiaxin Guan

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022

Witness Encryption and Null-IO from Evasive LWE.

[BibT_eX]

[DOI]

Hoeteck Wee

IACR Cryptol. ePrint Arch., 2022

Post-Quantum Insecurity from LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE.

[BibT_eX]

[DOI]

Wei-Kai Lin

Ethan Mook

IACR Cryptol. ePrint Arch., 2022

Boosting Batch Arguments and RAM Delegation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

The Pseudorandom Oracle Model and Ideal Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Nearly Optimal Property Preserving Hashing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Authentication in the Bounded Storage Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Small-Box Cryptography.

[BibT_eX]

[DOI]

Harish Karthikeyan

IACR Cryptol. ePrint Arch., 2022

Updatable Public Key Encryption in the Standard Model.

[BibT_eX]

[DOI]

Harish Karthikeyan

Saikrishna Badrinarayanan

IACR Cryptol. ePrint Arch., 2022

Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

Is There an Oblivious RAM Lower Bound for Online Reads?

[BibT_eX]

[DOI]

Mor Weiss

J. Cryptol., 2021

Targeted Lossy Functions and Applications.

[BibT_eX]

[DOI]

Brent Waters

IACR Cryptol. ePrint Arch., 2021

Limits on the Adaptive Security of Yao's Garbling.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Incompressible Cryptography.

[BibT_eX]

[DOI]

Jiaxin Guan

IACR Cryptol. ePrint Arch., 2021

Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Succinct LWE Sampling, Random Polynomials, and Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

2020

From Cryptomania to Obfustopia Through Secret-Key Functional Encryption.

[BibT_eX]

[DOI]

J. Cryptol., 2020

Candidate Obfuscation via Oblivious LWE Sampling.

[BibT_eX]

[DOI]

Hoeteck Wee

IACR Cryptol. ePrint Arch., 2020

Incompressible Encodings.

[BibT_eX]

[DOI]

Tal Moran

IACR Cryptol. ePrint Arch., 2020

Statistical ZAPR Arguments from Bilinear Maps.

[BibT_eX]

[DOI]

Alex Lombardi

IACR Cryptol. ePrint Arch., 2020

Leakage-Resilient Key Exchange and Two-Seed Extractors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Witness Maps and Applications.

[BibT_eX]

[DOI]

Suvradip Chakraborty

Manoj Prabhakaran

IACR Cryptol. ePrint Arch., 2020

Optimal Broadcast Encryption from LWE and Pairings in the Standard Model.

[BibT_eX]

[DOI]

Shweta Agrawal

Shota Yamada

IACR Cryptol. ePrint Arch., 2020

2019

Reusable Designated-Verifier NIZKs for all NP from CDH.

[BibT_eX]

[DOI]

Ron D. Rothblum

IACR Cryptol. ePrint Arch., 2019

2-Message Publicly Verifiable WI from (Subexponential) LWE.

[BibT_eX]

[DOI]

Alex Lombardi

IACR Cryptol. ePrint Arch., 2019

New Constructions of Reusable Designated-Verifier NIZKs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

On the Plausibility of Fully Homomorphic Encryption for RAMs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Two-Round Oblivious Transfer from CDH or LPN.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Extracting Randomness from Extractor-Dependent Sources.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Non-Malleable Codes for Decision Trees.

[BibT_eX]

[DOI]

Marshall Ball

Siyao Guo

IACR Cryptol. ePrint Arch., 2019

Fiat-Shamir: from practice to theory.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Broadcast and Trace with N^ε Ciphertext Size from Standard Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Watermarking Cryptographic Capabilities.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Non-Malleable Codes.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

J. ACM, 2018

Watermarking PRFs under Standard Assumptions: Public Marking and Security with Extraction Queries.

[BibT_eX]

[DOI]

Giorgos Zirdelis

IACR Cryptol. ePrint Arch., 2018

Laconic Function Evaluation and Applications.

[BibT_eX]

[DOI]

Hoeteck Wee

IACR Cryptol. ePrint Arch., 2018

Multi-Key Searchable Encryption, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Private Anonymous Data Access.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Traitor-Tracing from LWE Made Simple and Attribute-Based.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE.

[BibT_eX]

[DOI]

Ran Canetti

Alex Lombardi

Saikrishna Badrinarayanan

IACR Cryptol. ePrint Arch., 2018

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Non-Interactive Delegation for Low-Space Non-Deterministic Computation.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Succinct delegation for low-space non-deterministic computation.

[BibT_eX]

[DOI]

Saikrishna Badrinarayanan

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Dynamic Proofs of Retrievability Via Oblivious RAM.

[BibT_eX]

[DOI]

David Cash

Alptekin Küpçü

J. Cryptol., 2017

Obfuscating Compute-and-Compare Programs under LWE.

[BibT_eX]

[DOI]

Giorgos Zirdelis

IACR Cryptol. ePrint Arch., 2017

Hardness of Non-Interactive Differential Privacy from One-Way Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Adaptively Indistinguishable Garbled Circuits.

[BibT_eX]

[DOI]

Zahra Jafargholi

Alessandra Scafuro

IACR Cryptol. ePrint Arch., 2017

Be Adaptive, Avoid Overcommitting.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

The Edited Truth.

[BibT_eX]

[DOI]

Shafi Goldwasser

Saleet Klein

IACR Cryptol. ePrint Arch., 2017

Non-Trivial Witness Encryption and Null-iO from Standard Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

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

[BibT_eX]

[DOI]

Algorithmica, 2017

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

[BibT_eX]

[DOI]

Adi Shamir

Noah Stephens-Davidowitz

Algorithmica, 2017

2016

Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Leakage-Resilient Cryptography from Minimal Assumptions.

[BibT_eX]

[DOI]

J. Cryptol., 2016

Adaptive Security of Yao's Garbled Circuits.

[BibT_eX]

[DOI]

Zahra Jafargholi

IACR Cryptol. ePrint Arch., 2016

Spooky Encryption and its Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

A counterexample to the chain rule for conditional HILL entropy.

[BibT_eX]

[DOI]

Comput. Complex., 2016

Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM.

[BibT_eX]

[DOI]

Srinivas Devadas

Marten van Dijk

Christopher W. Fletcher

Ling Ren

Elaine Shi

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

Nir Bitansky

Omer Paneth

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Obfuscating Conjunctions under Entropic Ring LWE.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Two Round Multiparty Computation via Multi-key FHE.

[BibT_eX]

[DOI]

Pratyay Mukherjee

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015

New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key.

[BibT_eX]

[DOI]

Ryo Nishimaki

IACR Cryptol. ePrint Arch., 2015

Watermarking Cryptographic Programs Against Arbitrary Removal Strategies.

[BibT_eX]

[DOI]

Ryo Nishimaki

IACR Cryptol. ePrint Arch., 2015

Two Round MPC from LWE via Multi-Key FHE.

[BibT_eX]

[DOI]

Pratyay Mukherjee

IACR Cryptol. ePrint Arch., 2015

Standard Security Does Not Imply Indistinguishability Under Selective Opening.

[BibT_eX]

[DOI]

Dennis Hofheinz

Vanishree Rao

IACR Cryptol. ePrint Arch., 2015

Adaptively Secure Garbled Circuits from One-Way Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Perfect Structure on the Edge of Chaos.

[BibT_eX]

[DOI]

Nir Bitansky

Omer Paneth

IACR Cryptol. ePrint Arch., 2015

Essentially Optimal Robust Secret Sharing with Maximal Corruptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2014

Leveled Fully Homomorphic Signatures from Standard Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions.

[BibT_eX]

[DOI]

Vadim Lyubashevsky

IACR Cryptol. ePrint Arch., 2014

Tamper Detection and Continuous Non-Malleable Codes.

[BibT_eX]

[DOI]

Zahra Jafargholi

IACR Cryptol. ePrint Arch., 2014

On the Communication Complexity of Secure Function Evaluation with Long Output.

[BibT_eX]

[DOI]

Pavel Hubácek

IACR Cryptol. ePrint Arch., 2014

Leveled Fully Homomorphic Signatures from Standard Lattices.

[BibT_eX]

[DOI]

Sergey Gorbunov

IACR Cryptol. ePrint Arch., 2014

Outsourcing Private RAM Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Garbled RAM Revisited, Part I.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Garbled RAM Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013

Fully Leakage-Resilient Signatures.

[BibT_eX]

[DOI]

Elette Boyle

Gil Segev

J. Cryptol., 2013

Optimizing ORAM and Using it Efficiently for Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Key Derivation Without Entropy Waste.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

IACR Cryptol. ePrint Arch., 2013

Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Learning with Rounding, Revisited: New Reduction, Properties and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Why "Fiat-Shamir for Proofs" Lacks a Proof.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012

Barriers in Cryptography with Weak, Correlated and Leaky Sources.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Fully Homomorphic Message Authenticators.

[BibT_eX]

[DOI]

Rosario Gennaro

IACR Cryptol. ePrint Arch., 2012

Message Authentication, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Counterexamples to Hardness Amplification Beyond Negligible.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Why "Fiat-Shamir for Proofs" Lacks a Proof.

[BibT_eX]

[DOI]

Nir Bitansky

Sanjam Garg

IACR Cryptol. ePrint Arch., 2012

On Continual Leakage of Discrete Log Representations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011

Cryptographic Resilience to Continual Information Leakage.

[BibT_eX]

[DOI]

PhD thesis, 2011

Key-Evolution Schemes Resilient to Space-Bounded Leakage.

[BibT_eX]

[DOI]

Tomasz Kazana

IACR Cryptol. ePrint Arch., 2011

Storing Secrets on Continually Leaky Devices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.

[BibT_eX]

[DOI]

Gilad Asharov

Abhishek Jain

IACR Cryptol. ePrint Arch., 2011

One-Time Computable Self-erasing Functions.

[BibT_eX]

[DOI]

Tomasz Kazana

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010

Separating Succinct Non-Interactive Arguments From All Falsifiable Assumptions.

[BibT_eX]

[DOI]

Craig Gentry

IACR Cryptol. ePrint Arch., 2010

One-time Computable and Uncomputable Functions.

[BibT_eX]

[DOI]

Tomasz Kazana

IACR Cryptol. ePrint Arch., 2010

Cryptography Against Continuous Memory Attacks.

[BibT_eX]

[DOI]

Kristiyan Haralambiev

Adriana López-Alt

IACR Cryptol. ePrint Arch., 2010

Efficient Public-Key Cryptography in the Presence of Key Leakage.

[BibT_eX]

[DOI]

Kristiyan Haralambiev

Adriana López-Alt

IACR Cryptol. ePrint Arch., 2010

On Symmetric Encryption and Point Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

2009

Proofs of Retrievability via Hardness Amplification.

[BibT_eX]

[DOI]

Salil P. Vadhan

IACR Cryptol. ePrint Arch., 2009

Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.

[BibT_eX]

[DOI]

Joël Alwen

IACR Cryptol. ePrint Arch., 2009

Public-Key Encryption in the Bounded-Retrieval Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Survey: Leakage Resilience and the Bounded Retrieval Model.

[BibT_eX]

[DOI]

Joël Alwen

Proceedings of the Information Theoretic Security, 4th International Conference, 2009

2008

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer.

[BibT_eX]

[DOI]

Juan A. Garay

Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2008

Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

2007

Universally Composable Multiparty Computation with Partially Isolated Parties.

[BibT_eX]

[DOI]

Ivan Damgård

Jesper Buus Nielsen

IACR Cryptol. ePrint Arch., 2007

Isolated Proofs of Knowledge and Isolated Zero Knowledge.

[BibT_eX]

[DOI]

Ivan Damgård

Jesper Buus Nielsen