Daniel Wichs

Saikrishna Badrinarayanan

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Nearly Optimal Property Preserving Hashing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

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

[BibT_eX]

[DOI]

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

Witness Encryption and Null-IO from Evasive LWE.

[BibT_eX]

[DOI]

Hoeteck Wee

Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021

Updatable Public Key Encryption in the Standard Model.

[BibT_eX]

[DOI]

Harish Karthikeyan

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Succinct LWE Sampling, Random Polynomials, and Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Candidate Obfuscation via Oblivious LWE Sampling.

[BibT_eX]

[DOI]

Hoeteck Wee

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Targeted Lossy Functions and Applications.

[BibT_eX]

[DOI]

Brent Waters

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Limits on the Adaptive Security of Yao's Garbling.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

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

[BibT_eX]

[DOI]

Shweta Agrawal

Shota Yamada

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Witness Maps and Applications.

[BibT_eX]

[DOI]

Suvradip Chakraborty

Manoj Prabhakaran

Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Statistical ZAPR Arguments from Bilinear Maps.

[BibT_eX]

[DOI]

Alex Lombardi

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Two-Round Oblivious Transfer from CDH or LPN.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Extracting Randomness from Extractor-Dependent Sources.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Incompressible Encodings.

[BibT_eX]

[DOI]

Tal Moran

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Leakage-Resilient Key Exchange and Two-Seed Extractors.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

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

[BibT_eX]

[DOI]

Alex Lombardi

IACR Cryptol. ePrint Arch., 2019

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

[BibT_eX]

[DOI]

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

Reusable Designated-Verifier NIZKs for all NP from CDH.

[BibT_eX]

[DOI]

Ron D. Rothblum

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Private Anonymous Data Access.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

New Constructions of Reusable Designated-Verifier NIZKs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

On the Plausibility of Fully Homomorphic Encryption for RAMs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Adaptively Secure MPC with Sublinear Communication Complexity.

[BibT_eX]

[DOI]

Ran Cohen

Abhi Shelat

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Non-malleable Codes for Decision Trees.

[BibT_eX]

[DOI]

Marshall Ball

Siyao Guo

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

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

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Is There an Oblivious RAM Lower Bound for Online Reads?

[BibT_eX]

[DOI]

Mor Weiss

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

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

[BibT_eX]

[DOI]

Saikrishna Badrinarayanan

Giorgos Zirdelis

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

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

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Succinct delegation for low-space non-deterministic computation.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Multi-Key Searchable Encryption, Revisited.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Laconic Function Evaluation and Applications.

[BibT_eX]

[DOI]

Hoeteck Wee

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Adaptively Indistinguishable Garbled Circuits.

[BibT_eX]

[DOI]

Zahra Jafargholi

Alessandra Scafuro

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

The Edited Truth.

[BibT_eX]

[DOI]

Shafi Goldwasser

Saleet Klein

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Obfuscating Compute-and-Compare Programs under LWE.

[BibT_eX]

[DOI]

Giorgos Zirdelis

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Be Adaptive, Avoid Overcommitting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

A counterexample to the chain rule for conditional HILL entropy.

[BibT_eX]

[DOI]

Comput. Complex., 2016

Adaptive Security of Yao's Garbled Circuits.

[BibT_eX]

[DOI]

Zahra Jafargholi

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

Standard Security Does Not Imply Indistinguishability Under Selective Opening.

[BibT_eX]

[DOI]

Dennis Hofheinz

Vanishree Rao

Proceedings of the Theory of Cryptography - 14th International Conference, 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

From Cryptomania to Obfustopia Through Secret-Key Functional Encryption.

[BibT_eX]

[DOI]

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

Watermarking cryptographic capabilities.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Obfuscating Conjunctions under Entropic Ring LWE.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Ryo Nishimaki

Mark Zhandry

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Two Round Multiparty Computation via Multi-key FHE.

[BibT_eX]

[DOI]

Pratyay Mukherjee

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Essentially Optimal Robust Secret Sharing with Maximal Corruptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Adaptively Secure Garbled Circuits from One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Spooky Encryption and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

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

Perfect Structure on the Edge of Chaos.

[BibT_eX]

[DOI]

Nir Bitansky

Omer Paneth

IACR Cryptol. ePrint Arch., 2015

Tamper Detection and Continuous Non-malleable Codes.

[BibT_eX]

[DOI]

Zahra Jafargholi

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Leveled Fully Homomorphic Signatures from Standard Lattices.

[BibT_eX]

[DOI]

Sergey Gorbunov

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions.

[BibT_eX]

[DOI]

Vadim Lyubashevsky

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

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

[BibT_eX]

[DOI]

Pavel Hubácek

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014

Leveled Fully Homomorphic Signatures from Standard Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Garbled RAM Revisited, Part I.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Outsourcing Private RAM Computation.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Garbled RAM Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Key Derivation without Entropy Waste.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGs.

[BibT_eX]

[DOI]

Adi Shamir

Noah Stephens-Davidowitz

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

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

[BibT_eX]

[DOI]

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

Optimizing ORAM and Using It Efficiently for Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Privacy Enhancing Technologies - 13th International Symposium, 2013

Barriers in cryptography with weak, correlated and leaky sources.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

Leakage-Resilient Cryptography from Minimal Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2013

Dynamic Proofs of Retrievability via Oblivious RAM.

[BibT_eX]

[DOI]

David Cash

Alptekin Küpçü

Proceedings of the Advances in Cryptology, 2013

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Security analysis of pseudo-random number generators with input: /dev/random is not robust.

[BibT_eX]

[DOI]

Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Fully Homomorphic Message Authenticators.

[BibT_eX]

[DOI]

Rosario Gennaro

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

On Continual Leakage of Discrete Log Representations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

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

[BibT_eX]

[DOI]

Nir Bitansky

Sanjam Garg

IACR Cryptol. ePrint Arch., 2012

Counterexamples to Hardness Amplification beyond Negligible.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Message Authentication, Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 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

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

Separating succinct non-interactive arguments from all falsifiable assumptions.

[BibT_eX]

[DOI]

Craig Gentry

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Storing Secrets on Continually Leaky Devices.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Fully Leakage-Resilient Signatures.

[BibT_eX]

[DOI]

Elette Boyle

Gil Segev

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Key-Evolution Schemes Resilient to Space-Bounded Leakage.

[BibT_eX]

[DOI]

Tomasz Kazana

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

One-time Computable and Uncomputable Functions.

[BibT_eX]

[DOI]

Tomasz Kazana

IACR Cryptol. ePrint Arch., 2010

On Symmetric Encryption and Point Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Non-Malleable Codes.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

Proceedings of the Innovations in Computer Science, 2010

Cryptography against Continuous Memory Attacks.

[BibT_eX]

[DOI]

Kristiyan Haralambiev

Adriana López-Alt

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Public-Key Encryption in the Bounded-Retrieval Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

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

[BibT_eX]

[DOI]

Kristiyan Haralambiev

Adriana López-Alt