Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Succinct Classical Verification of Quantum Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

OpenFHE: Open-Source Fully Homomorphic Encryption Library.

[BibT_eX]

[DOI]

Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2022

Witness Encryption and Null-IO from Evasive LWE.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021

Structure Versus Hardness Through the Obfuscation Lens.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs for P.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Rachel Yun Zhang

IACR Cryptol. ePrint Arch., 2021

Does Fully Homomorphic Encryption Need Compute Acceleration?

[BibT_eX]

[DOI]

Leo de Castro

Rashmi Agrawal

Rabia Tugce Yazicigil

Anantha P. Chandrakasan

Chiraag Juvekar

Ajay Joshi

IACR Cryptol. ePrint Arch., 2021

The Fine-Grained Hardness of Sparse Linear Regression.

[BibT_eX]

[DOI]

Aparna Gupte

CoRR, 2021

NeuraCrypt: Hiding Private Health Data via Random Neural Networks for Public Training.

[BibT_eX]

[DOI]

Adam Yala

Homa Esfahanizadeh

Rafael G. L. D'Oliveira

CoRR, 2021

Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Rachel Yun Zhang

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

Oblivious Transfer Is in MiniQCrypt.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

The t-wise Independence of Substitution-Permutation Networks.

[BibT_eX]

[DOI]

Stefano Tessaro

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors.

[BibT_eX]

[DOI]

Leo de Castro

Chiraag Juvekar

Proceedings of the WAHC '21: Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2021

On the Hardness of Average-Case k-SUM.

[BibT_eX]

[DOI]

Noah Stephens-Davidowitz

Proceedings of the Approximation, 2021

2020

Multi-Input Correlation-Intractable Hash Functions via Shift-Hiding.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Data structures meet cryptography: 3SUM with preprocessing.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Cryptography from Information Loss.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Statistical ZAPR Arguments from Bilinear Maps.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Extracting Randomness from Extractor-Dependent Sources.

[BibT_eX]

[DOI]

Yevgeniy Dodis

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Computational Limitations in Robust Classification and Win-Win Results.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Optimized Homomorphic Encryption Solution for Secure Genome-Wide Association Studies.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Homomorphic Encryption Standard.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications.

[BibT_eX]

[DOI]

CoRR, 2019

Lattice Trapdoors and IBE from Middle-Product LWE.

[BibT_eX]

[DOI]

Thuy-Duong Vuong

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Optimal Bounded-Collusion Secure Functional Encryption.

[BibT_eX]

[DOI]

Prabhanjan Ananth

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Adversarially Robust Property-Preserving Hash Functions.

[BibT_eX]

[DOI]

Elette Boyle

Rio LaVigne

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

SETH-Hardness of Coding Problems.

[BibT_eX]

[DOI]

Noah Stephens-Davidowitz

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Reusable Non-Interactive Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Computational Limitations in Robust Classification and Win-Win Results.

[BibT_eX]

[DOI]

Preetum Nakkiran

Proceedings of the Conference on Learning Theory, 2019

2018

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

GAZELLE: A Low Latency Framework for Secure Neural Network Inference.

[BibT_eX]

[DOI]

Chiraag Juvekar

Anantha P. Chandrakasan

Proceedings of the 27th USENIX Security Symposium, 2018

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

[BibT_eX]

[DOI]

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

Breaking the circuit-size barrier in secret sharing.

[BibT_eX]

[DOI]

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

Zero-Knowledge Proofs of Proximity.

[BibT_eX]

[DOI]

Itay Berman

Ron D. Rothblum

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Towards Breaking the Exponential Barrier for General Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates.

[BibT_eX]

[DOI]

Yilei Chen

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Fast Proxy Re-Encryption for Publish/Subscribe Systems.

[BibT_eX]

[DOI]

ACM Trans. Priv. Secur., 2017

Multikey Fully Homomorphic Encryption and Applications.

[BibT_eX]

[DOI]

Adriana López-Alt

Eran Tromer

SIAM J. Comput., 2017

On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Minimizing the Complexity of Goldreich's Pseudorandom Generator.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

New Protocols for Conditional Disclosure of Secrets (and More).

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

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

Private Constrained PRFs (and More) from LWE.

[BibT_eX]

[DOI]

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

Chosen-Ciphertext Secure Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Ran Canetti

Srinivasan Raghuraman

Silas Richelson

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

Splinter: Practical Private Queries on Public Data.

[BibT_eX]

[DOI]

Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, 2017

Low-Complexity Cryptographic Hash Functions .

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Some Open Problems in Information-Theoretic Cryptography.

[BibT_eX]

[DOI]

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

A Note on Perfect Correctness by Derandomization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Conditional Disclosure of Secrets via Non-linear Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Structure vs. Hardness Through the Obfuscation Lens.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers.

[BibT_eX]

[DOI]

Alhassan Khedr

P. Glenn Gulak

IEEE Trans. Computers, 2016

On Basing Private Information Retrieval on NP-Hardness.

[BibT_eX]

[DOI]

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

Indistinguishability Obfuscation: From Approximate to Exact.

[BibT_eX]

[DOI]

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

3-Message Zero Knowledge Against Human Ignorance.

[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

Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds.

[BibT_eX]

[DOI]

Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation, 2016

Obfuscating Conjunctions under Entropic Ring LWE.

[BibT_eX]

[DOI]

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

Time-Lock Puzzles from Randomized Encodings.

[BibT_eX]

[DOI]

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

Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings.

[BibT_eX]

[DOI]

Huijia Lin

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Fine-Grained Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Improvements to Secure Computation with Penalties.

[BibT_eX]

[DOI]

Ranjit Kumaresan

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

2015

From Statistical Zero Knowledge to Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Publicly Verifiable Software Watermarking.

[BibT_eX]

[DOI]

Aloni Cohen

Justin Holmgren

IACR Cryptol. ePrint Arch., 2015

Aggregatable Pseudorandom Functions and Connections to Learning.

[BibT_eX]

[DOI]

Aloni Cohen

IACR Cryptol. ePrint Arch., 2015

Aggregate Pseudorandom Functions and Connections to Learning.

[BibT_eX]

[DOI]

Aloni Cohen

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

Obfuscation of Probabilistic Circuits and Applications.

[BibT_eX]

[DOI]

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

Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions - Or: How to Secretly Embed a Circuit in Your PRF.

[BibT_eX]

[DOI]

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

Leveled Fully Homomorphic Signatures from Standard Lattices.

[BibT_eX]

[DOI]

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

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs.

[BibT_eX]

[DOI]

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

Indistinguishability Obfuscation from Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Predicate Encryption for Circuits from LWE.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

From Selective to Adaptive Security in Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Secret Sharing and Statistical Zero Knowledge.

[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

Protecting Circuits from Computationally Bounded and Noisy Leakage.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

(Leveled) Fully Homomorphic Signatures from Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation of Iterated Circuits and RAM Programs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Lattice-based FHE as secure as PKE.

[BibT_eX]

[DOI]

Dhinakaran Vinayagamurthy

Proceedings of the Innovations in Theoretical Computer Science, 2014

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013

Inspection-Resistant Memory Architectures.

[BibT_eX]

[DOI]

Jonathan Kaveh Valamehr

IEEE Micro, 2013

Overcoming the Worst-Case Curse for Cryptographic Constructions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

How to Compress (Reusable) Garbled Circuits.

[BibT_eX]

[DOI]

Dhinakaran Vinayagamurthy

IACR Cryptol. ePrint Arch., 2013

Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups.

[BibT_eX]

[DOI]

Ran Canetti

IACR Cryptol. ePrint Arch., 2013

Tight Bounds for Set Disjointness in the Message Passing Model

[BibT_eX]

[DOI]

CoRR, 2013

Attribute-based encryption for circuits.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Reusable garbled circuits and succinct functional encryption.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

A Tight Bound for Set Disjointness in the Message-Passing Model.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

How to Run Turing Machines on Encrypted Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Functional Encryption: New Perspectives and Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

On Continual Leakage of Discrete Log Representations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption.

[BibT_eX]

[DOI]

Bryan Parno

Mariana Raykova

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

Functional Re-encryption and Collusion-Resistant Obfuscation.

[BibT_eX]

[DOI]

Nishanth Chandran

Melissa Chase

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

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption.

[BibT_eX]

[DOI]

Adriana López-Alt

Eran Tromer

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Efficient Password Authenticated Key Exchange via Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Inspection resistant memory: Architectural support for security from physical examination.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computer Architecture (ISCA 2012), 2012

(Leveled) fully homomorphic encryption without bootstrapping.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

How to Compute on Encrypted Data.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2012

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Functional Encryption with Bounded Collusions via Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Adriana López-Alt

Eran Tromer

IACR Cryptol. ePrint Arch., 2011

Collusion Resistant Obfuscation and Functional Re-encryption.

[BibT_eX]

[DOI]

Nishanth Chandran

Melissa Chase

IACR Cryptol. ePrint Arch., 2011

Fuzzy Identity Based Encryption from Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Fully Homomorphic Encryption without Bootstrapping.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Round-Optimal Password-Based Authenticated Key Exchange.

[BibT_eX]

[DOI]

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

New Developments in Leakage-Resilient Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2011, 2011

Computing Blindfolded: New Developments in Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

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

Efficient Fully Homomorphic Encryption from (Standard) LWE.

[BibT_eX]

[DOI]

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

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Can homomorphic encryption be practical?

[BibT_eX]

[DOI]

Michael Naehrig

Kristin E. Lauter

Proceedings of the 3rd ACM Cloud Computing Security Workshop, 2011

Functional Encryption for Inner Product Predicates from Learning with Errors.

[BibT_eX]

[DOI]

Shweta Agrawal

David Mandell Freeman

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

One-Round Password-Based Authenticated Key Exchange.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits.

[BibT_eX]

[DOI]

Shai Halevi

IACR Cryptol. ePrint Arch., 2010

Public-Key Encryption Schemes with Auxiliary Inputs.

[BibT_eX]

[DOI]

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

Robustness of the Learning with Errors Assumption.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2010

Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage.

[BibT_eX]

[DOI]

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

A Simple BGN-Type Cryptosystem from LWE.

[BibT_eX]

[DOI]

Shai Halevi

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

Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases.

[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

Fully Homomorphic Encryption over the Integers.

[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

<i>i</i>-Hop Homomorphic Encryption and Rerandomizable Yao Circuits.

[BibT_eX]

[DOI]

Shai Halevi

Proceedings of the Advances in Cryptology, 2010

A Group Signature Scheme from Lattice Assumptions.

[BibT_eX]

[DOI]

S. Dov Gordon

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Randomized algorithms for reliable broadcast.

[BibT_eX]

[DOI]

PhD thesis, 2009

How Efficient Can Memory Checking Be?.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Weak Verifiable Random Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Simultaneous Hardcore Bits and Cryptography against Memory Attacks.

[BibT_eX]

[DOI]

Adi Akavia

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Signature Schemes with Bounded Leakage Resilience.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Trapdoors for hard lattices and new cryptographic constructions.

[BibT_eX]

[DOI]

Chris Peikert

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

A Framework for Efficient and Composable Oblivious Transfer.

[BibT_eX]

[DOI]

Chris Peikert

Brent Waters

Proceedings of the Advances in Cryptology, 2008

Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems.

[BibT_eX]

[DOI]

Chris Peikert

Proceedings of the Advances in Cryptology, 2008

Adaptive One-Way Functions and Applications.

[BibT_eX]

[DOI]

Omkant Pandey

Rafael Pass

Proceedings of the Advances in Cryptology, 2008

2007

Securely Obfuscating Re-encryption.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Secure Computation from Random Error Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Relations Among Notions of Non-malleability for Encryption.

[BibT_eX]

[DOI]

Rafael Pass

Abhi Shelat

Proceedings of the Advances in Cryptology, 2007

Bounded CCA2-Secure Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Byzantine agreement in the full-information model in O(log n) rounds.

[BibT_eX]

[DOI]

Michael Ben-Or

Elan Pavlov

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Fault-Tolerant Distributed Computing in Full-Information Networks.

[BibT_eX]

[DOI]

Elan Pavlov

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.

[BibT_eX]

[DOI]

Rafael Pass

Abhi Shelat

Proceedings of the Advances in Cryptology, 2006

2005

Distributed Computing with Imperfect Randomness.

[BibT_eX]

[DOI]

Madhu Sudan

Proceedings of the Distributed Computing, 19th International Conference, 2005

Brief announcement: broadcast in radio networks in the presence of byzantine adversaries.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004

Information Leak in the Chord Lookup Protocol.

[BibT_eX]

[DOI]

Charles W. O'Donnell

Proceedings of the 4th International Conference on Peer-to-Peer Computing (P2P 2004), 2004

2003

Brief announcement: efficient perfectly secure communication over synchronous networks.

[BibT_eX]

[DOI]

K. Srinathan