Jonathan Katz

According to our database1, Jonathan Katz authored at least 304 papers between 2000 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens.
J. Cryptology, 2019

Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers.
IACR Cryptology ePrint Archive, 2019

Synchronous Consensus with Optimal Asynchronous Fallback Guarantees.
IACR Cryptology ePrint Archive, 2019

Constant-Round Group Key Exchange from the Ring-LWE Assumption.
IACR Cryptology ePrint Archive, 2019

Competing (Semi)-Selfish Miners in Bitcoin.
CoRR, 2019

Statistical Privacy in Distributed Average Consensus on Bounded Real Inputs.
CoRR, 2019

Constant-Round Group Key Exchange from the Ring-LWE Assumption.
Proceedings of the Post-Quantum Cryptography - 10th International Conference, 2019

Covert Security with Public Verifiability: Faster, Leaner, and Simpler.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Statistical Privacy in Distributed Average Consensus on Bounded Real Inputs.
Proceedings of the 2019 American Control Conference, 2019

2018
Verifiable Graph Processing.
ACM Trans. Priv. Secur., 2018

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.
IACR Cryptology ePrint Archive, 2018

Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures.
IACR Cryptology ePrint Archive, 2018

Covert Security with Public Verifiability: Faster, Leaner, and Simpler.
IACR Cryptology ePrint Archive, 2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting.
IACR Cryptology ePrint Archive, 2018

Efficient 3-Party Distributed ORAM.
IACR Cryptology ePrint Archive, 2018

Simple and Efficient Two-Server ORAM.
IACR Cryptology ePrint Archive, 2018

Information-Theoretic Privacy in Distributed Average Consensus.
CoRR, 2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting.
CoRR, 2018

vRAM: Faster Verifiable RAM with Program-Independent Preprocessing.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

Simple and Efficient Two-Server ORAM.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
A Zero-Knowledge Version of vSQL.
IACR Cryptology ePrint Archive, 2017

vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases.
IACR Cryptology ePrint Archive, 2017

Authenticated Garbling and Efficient Maliciously Secure Multi-Party Computation.
IACR Cryptology ePrint Archive, 2017

Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.
IACR Cryptology ePrint Archive, 2017

Provable Security of Substitution-Permutation Networks.
IACR Cryptology ePrint Archive, 2017

Efficient, Reusable Fuzzy Extractors from LWE.
IACR Cryptology ePrint Archive, 2017

vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

Incentivizing Blockchain Forks via Whale Transactions.
Proceedings of the Financial Cryptography and Data Security, 2017

An Expressive (Zero-Knowledge) Set Accumulator.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

Faster Secure Two-Party Computation in the Single-Execution Setting.
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

Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited.
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

Symmetric-Key Broadcast Encryption: The Multi-sender Case.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2017

Efficient, Reusable Fuzzy Extractors from LWE.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2017

Experimentation for Developing Evidence-Based UI Standards of Mobile Survey Questionnaires.
Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems, 2017

Global-Scale Secure Multiparty Computation.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

Subset Predicate Encryption and Its Applications.
Proceedings of the Cryptology and Network Security - 16th International Conference, 2017

2016
Guest Editorial.
IET Information Security, 2016

All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption.
IACR Cryptology ePrint Archive, 2016

Faster Two-Party Computation Secure Against Malicious Adversaries in the Single-Execution Setting.
IACR Cryptology ePrint Archive, 2016

An Oblivious Parallel RAM with O(log2 N) Parallel Runtime Blowup.
IACR Cryptology ePrint Archive, 2016

5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs.
IACR Cryptology ePrint Archive, 2016

Efficiently Enforcing Input Validity in Secure Two-party Computation.
IACR Cryptology ePrint Archive, 2016

Selective-Opening Security in the Presence of Randomness Failures.
IACR Cryptology ePrint Archive, 2016

The Cut-and-Choose Game and Its Application to Cryptographic Protocols.
Proceedings of the 25th USENIX Security Symposium, 2016

All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption.
Proceedings of the 25th USENIX Security Symposium, 2016

Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

Analysis of a Proposed Hash-Based Signature Standard.
Proceedings of the Security Standardisation Research - Third International Conference, 2016

A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

10-Round Feistel is Indifferentiable from an Ideal Cipher.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Secure Computation of MIPS Machine Code.
Proceedings of the Computer Security - ESORICS 2016, 2016

5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Selective-Opening Security in the Presence of Randomness Failures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
How to Authenticate any Data Structure.
TinyToCS, 2015

Secure Computation of MIPS Machine Code.
IACR Cryptology ePrint Archive, 2015

Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption.
IACR Cryptology ePrint Archive, 2015

Amortizing Garbled Circuits.
IACR Cryptology ePrint Archive, 2015

Automated Analysis and Synthesis of Authenticated Encryption Schemes.
IACR Cryptology ePrint Archive, 2015

Multi-Client Verifiable Computation with Stronger Security Guarantees.
IACR Cryptology ePrint Archive, 2015

How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality.
IACR Cryptology ePrint Archive, 2015

Feasibility and Completeness of Cryptographic Tasks in the Quantum World.
IACR Cryptology ePrint Archive, 2015

10-Round Feistel is Indifferentiable from an Ideal Cipher.
IACR Cryptology ePrint Archive, 2015

Feasibility and Infeasibility of Secure Computation with Malicious PUFs.
IACR Cryptology ePrint Archive, 2015

Functional Encryption from (Small) Hardwae Tokens.
IACR Cryptology ePrint Archive, 2015

Multi-Client Non-Interactive Verifiable Computation.
IACR Cryptology ePrint Archive, 2015

Multi-Client Verifiable Computation with Stronger Security Guarantees.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

How Fair is Your Protocol?: A Utility-based Approach to Protocol Optimality.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Hash Functions from Defective Ideal Ciphers.
Proceedings of the Topics in Cryptology, 2015

IntegriDB: Verifiable SQL for Outsourced Databases.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Nonoutsourceable Scratch-Off Puzzles to Discourage Bitcoin Mining Coalitions.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Automated Analysis and Synthesis of Authenticated Encryption Schemes.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Review of networked life: 20 questions and answers by Mung Chiang.
SIGACT News, 2014

Review of the block cipher companion by Lars R. Knudsen and Matthew J.B. Robshaw.
SIGACT News, 2014

Anon-Pass: Practical Anonymous Subscriptions.
IEEE Security & Privacy, 2014

Authenticated broadcast with a partially compromised public-key infrastructure.
Inf. Comput., 2014

Automated Analysis and Synthesis of Block-Cipher Modes of Operation.
IACR Cryptology ePrint Archive, 2014

Pseudonymous Secure Computation from Time-Lock Puzzles.
IACR Cryptology ePrint Archive, 2014

A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation.
IACR Cryptology ePrint Archive, 2014

Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds.
IACR Cryptology ePrint Archive, 2014

Efficient Three-Party Computation from Cut-and-Choose.
IACR Cryptology ePrint Archive, 2014

Verifiable Oblivious Storage.
IACR Cryptology ePrint Archive, 2014

Implementing Cryptographic Program Obfuscation.
IACR Cryptology ePrint Archive, 2014

(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Permacoin: Repurposing Bitcoin Work for Data Preservation.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Automating Efficient RAM-Model Secure Computation.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Authenticated data structures, generically.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Distributing the setup in universally composable multi-party computation.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Verifiable Oblivious Storage.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Multi-input Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Automated Analysis and Synthesis of Block-Cipher Modes of Operation.
Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014

Amortizing Garbled Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Feasibility and Infeasibility of Secure Computation with Malicious PUFs.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Efficient Three-Party Computation from Cut-and-Choose.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

ALITHEIA: Towards Practical Verifiable Graph Processing.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

Cryptography.
Proceedings of the Computing Handbook, 2014

Introduction to Modern Cryptography, Second Edition
CRC Press, ISBN: 9781466570269, 2014

2013
One-round multi-party communication complexity of distinguishing sums.
Theor. Comput. Sci., 2013

Review of identity-based encryption by Sanjit Chattarjee and Palash Sarkar.
SIGACT News, 2013

Review of Applied Information Security by David Basin, Patrick Schaller, and Michael Schläpfer.
SIGACT News, 2013

Round-Optimal Password-Based Authenticated Key Exchange.
J. Cryptology, 2013

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.
J. Cryptology, 2013

Anon-Pass: Practical Anonymous Subscriptions.
IACR Cryptology ePrint Archive, 2013

Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose.
IACR Cryptology ePrint Archive, 2013

Multi-Input Functional Encryption.
IACR Cryptology ePrint Archive, 2013

Rational Protocol Design: Cryptography Against Incentive-driven Adversaries.
IACR Cryptology ePrint Archive, 2013

(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens.
IACR Cryptology ePrint Archive, 2013

One-Round Multi-Party Communication Complexity of Distinguishing Sums.
Electronic Colloquium on Computational Complexity (ECCC), 2013

One-Round Multi-Party Communication Complexity of Distinguishing Sums
CoRR, 2013

Universally Composable Synchronous Computation.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Feasibility and Completeness of Cryptographic Tasks in the Quantum World.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Multi-Client Non-interactive Verifiable Computation.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Brief announcement: a game-theoretic model motivated by the darpa network challenge.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Anon-Pass: Practical Anonymous Subscriptions.
Proceedings of the 2013 IEEE Symposium on Security and Privacy, 2013

Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Rational Protocol Design: Cryptography against Incentive-Driven Adversaries.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Functional Encryption from (Small) Hardware Tokens.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets.
IEEE Trans. Information Theory, 2012

Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell.
SIGACT News, 2012

Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009).
SIAM J. Comput., 2012

Which Languages Have 4-Round Zero-Knowledge Proofs?
J. Cryptology, 2012

Partial Fairness in Secure Two-Party Computation.
J. Cryptology, 2012

Two-server password-only authenticated key exchange.
J. Comput. Syst. Sci., 2012

Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS.
IACR Cryptology ePrint Archive, 2012

A Game-Theoretic Model Motivated by the DARPA Network Challenge
CoRR, 2012

On the Security of the "Free-XOR" Technique.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution.
Proceedings of the IEEE Symposium on Security and Privacy, 2012

Knowledge-oriented secure multiparty computation.
Proceedings of the 2012 Workshop on Programming Languages and Analysis for Security, 2012

Constant-Round Multi-party Private Set Union Using Reversed Laurent Series.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?
Proceedings of the 19th Annual Network and Distributed System Security Symposium, 2012

Byzantine Agreement with a Rational Adversary.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Fair Computation with Rational Players.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces.
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

Collusion-Preserving Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Secure two-party computation in sublinear (amortized) time.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
SIAM J. Comput., 2011

Complete Fairness in Secure Two-Party Computation.
J. ACM, 2011

Universally Composable Synchronous Computation.
IACR Cryptology ePrint Archive, 2011

Fair Computation with Rational Players.
IACR Cryptology ePrint Archive, 2011

A Group Signature Scheme from Lattice Assumptions.
IACR Cryptology ePrint Archive, 2011

Secure Computation with Sublinear Amortized Work.
IACR Cryptology ePrint Archive, 2011

On the Security of the Free-XOR Technique.
IACR Cryptology ePrint Archive, 2011

Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces.
IACR Cryptology ePrint Archive, 2011

Collusion-Preserving Computation.
IACR Cryptology ePrint Archive, 2011

Faster Secure Two-Party Computation Using Garbled Circuits.
Proceedings of the 20th USENIX Security Symposium, 2011

Round-Optimal Password-Based Authenticated Key Exchange.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Impossibility of Blind Signatures from One-Way Permutations.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Limits of Computational Differential Privacy in the Client/Server Setting.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Adaptively secure broadcast, revisited.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Efficient Privacy-Preserving Biometric Identification.
Proceedings of the Network and Distributed System Security Symposium, 2011

Efficient Secure Computation with Garbled Circuits.
Proceedings of the Information Systems Security - 7th International Conference, 2011

Constant-Round Private Function Evaluation with Linear Complexity.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
Public-Key Cryptography.
Proceedings of the Handbook of Information and Communication Security, 2010

Bounds on the efficiency of black-box commitment schemes.
Theor. Comput. Sci., 2010

Parallel and Concurrent Security of the HB and HB+ Protocols.
J. Cryptology, 2010

VMCrypt - Modular Software Architecture for Scalable Secure Computation.
IACR Cryptology ePrint Archive, 2010

One-Round Password-Based Authenticated Key Exchange.
IACR Cryptology ePrint Archive, 2010

Constant-Round Private Function Evaluation with Linear Complexity.
IACR Cryptology ePrint Archive, 2010

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2010

A New Framework for Password-Based Authenticated Key Exchange.
IACR Cryptology ePrint Archive, 2010

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.
IACR Cryptology ePrint Archive, 2010

Overcoming the Hole In The Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage.
IACR Cryptology ePrint Archive, 2010

Efficient Rational Secret Sharing in Standard Communication Networks.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Secure Network Coding over the Integers.
Proceedings of the Public Key Cryptography, 2010

Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Partial Fairness in Secure Two-Party Computation.
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

Secure text processing with applications to private DNA matching.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

A new framework for efficient password-based authenticated key exchange.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

A Group Signature Scheme from Lattice Assumptions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

Digital Signatures.
Springer, ISBN: 978-0-387-27711-0, 2010

2009
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
J. Cryptology, 2009

Ring Signatures: Stronger Definitions, and Constructions without Random Oracles.
J. Cryptology, 2009

On expected constant-round protocols for Byzantine agreement.
J. Comput. Syst. Sci., 2009

Efficient and secure authenticated key exchange using weak passwords.
J. ACM, 2009

Improving the round complexity of VSS in point-to-point networks.
Inf. Comput., 2009

Signature Schemes with Bounded Leakage Resilience.
IACR Cryptology ePrint Archive, 2009

Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure.
IACR Cryptology ePrint Archive, 2009

Secure Network Coding Over the Integers.
IACR Cryptology ePrint Archive, 2009

Attacking Cryptographic Schemes Based on "Perturbation Polynomials".
IACR Cryptology ePrint Archive, 2009

Complete Fairness in Multi-party Computation without an Honest Majority.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Composability and On-Line Deniability of Authentication.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Signing a Linear Subspace: Signature Schemes for Network Coding.
Proceedings of the Public Key Cryptography, 2009

Collusion-Free Multiparty Computation in the Mediated Model.
Proceedings of the Advances in Cryptology, 2009

Attacking cryptographic schemes based on "perturbation polynomials".
Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations.
Proceedings of the Advances in Cryptology, 2009

Signature Schemes with Bounded Leakage Resilience.
Proceedings of the Advances in Cryptology, 2009

Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices.
Proceedings of the Advances in Cryptology, 2009

Proofs of Storage from Homomorphic Identification Protocols.
Proceedings of the Advances in Cryptology, 2009

2008
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.
J. Cryptology, 2008

Collusion-Free Multiparty Computation in the Mediated Model.
IACR Cryptology ePrint Archive, 2008

Complete Fairness in Multi-Party Computation Without an Honest Majority.
IACR Cryptology ePrint Archive, 2008

Partial Fairness in Secure Two-Party Computation.
IACR Cryptology ePrint Archive, 2008

Complete Fairness in Secure Two-Party Computation.
IACR Cryptology ePrint Archive, 2008

Efficient Rational Secret Sharing in Standard Communication Networks.
IACR Cryptology ePrint Archive, 2008

Signing a Linear Subspace: Signature Schemes for Network Coding.
IACR Cryptology ePrint Archive, 2008

Bridging Game Theory and Cryptography: Recent Results and Future Directions.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Which Languages Have 4-Round Zero-Knowledge Proofs?
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Universally Composable Multi-party Computation with an Unreliable Common Reference String.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Complete fairness in secure two-party computation.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Improving the Round Complexity of VSS in Point-to-Point Networks.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

How to Encrypt with a Malicious Random Number Generator.
Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.
Proceedings of the Advances in Cryptology, 2008

Aggregate Message Authentication Codes.
Proceedings of the Topics in Cryptology, 2008

2007
Review of "Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli Upfal", Cambridge University Press, 2005.
SIGACT News, 2007

Chosen-Ciphertext Security from Identity-Based Encryption.
SIAM J. Comput., 2007

Scalable Protocols for Authenticated Group Key Exchange.
J. Cryptology, 2007

Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems.
J. Cryptology, 2007

A Forward-Secure Public-Key Encryption Scheme.
J. Cryptology, 2007

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.
IACR Cryptology ePrint Archive, 2007

Improving the Round Complexity of VSS in Point-to-Point Networks.
IACR Cryptology ePrint Archive, 2007

Which Languages Have 4-Round Zero-Knowledge Proofs?
IACR Cryptology ePrint Archive, 2007

Universally Composable Multi-Party Computation with an Unreliable Common Reference String.
IACR Cryptology ePrint Archive, 2007

Which Languages Have 4-Round Zero-Knowledge Proofs?.
Electronic Colloquium on Computational Complexity (ECCC), 2007

Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

On achieving the "best of both worlds" in secure multiparty computation.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise.
Proceedings of the Cryptography and Coding, 2007

Round Complexity of Authenticated Broadcast with a Dishonest Majority.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Round-Efficient Secure Computation in Point-to-Point Networks.
Proceedings of the Advances in Cryptology, 2007

Universally Composable Multi-party Computation Using Tamper-Proof Hardware.
Proceedings of the Advances in Cryptology, 2007

Universally-Composable Two-Party Computation in Two Rounds.
Proceedings of the Advances in Cryptology, 2007

Exploiting approximate transitivity of trust.
Proceedings of the Fourth International Conference on Broadband Communications, 2007

Introduction to Modern Cryptography
Chapman and Hall/CRC Press, ISBN: 978-1-58488-551-1, 2007

2006
Review of "Primality Testing in Polynomial Time by Martin Dietzfelbinger", Springer-Verlag, 2004.
SIGACT News, 2006

Review of "A Computational Introduction to Number Theory and Algebra by Victor Shoup", Cambridge University Press, 2005.
SIGACT News, 2006

Characterization of Security Notions for Probabilistic Private-Key Encryption.
J. Cryptology, 2006

Analyzing the HB and HB+ Protocols in the "Large Error" Case.
IACR Cryptology ePrint Archive, 2006

On Expected Constant-Round Protocols for Byzantine Agreement.
IACR Cryptology ePrint Archive, 2006

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2006

Rational Secret Sharing, Revisited.
IACR Cryptology ePrint Archive, 2006

On Expected Constant-Round Protocols for Byzantine Agreement.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Rational Secret Sharing, Revisited.
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

Reliable broadcast in radio networks: the bounded collision case.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Parallel and Concurrent Security of the HB and HB+ Protocols.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

On Expected Constant-Round Protocols for Byzantine Agreement.
Proceedings of the Advances in Cryptology, 2006

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.
Proceedings of the Advances in Cryptology, 2006

2005
A pairwise key predistribution scheme for wireless sensor networks.
ACM Trans. Inf. Syst. Secur., 2005

Comparative book review: Cryptography: An Introduction by V. V. Yaschenko (American Mathematical Society, 2002); Cryptanalysis of Number Theoretic Ciphers by S.S. Wagstaff, Jr. (Chapman & Hall/CRC Press, 2003); RSA and Public-Key Cryptography by R. A. Mollin (Chapman & Hall/CRC Press, 2003); Foundations of Cryptography, vol. 1: Basic Tools by O. Goldreich, (Cambridge University Press, 2001).
SIGACT News, 2005

Bounds on the Efficiency of Generic Cryptographic Constructions.
SIAM J. Comput., 2005

Parallel and Concurrent Security of the HB and HB+ Protocols.
IACR Cryptology ePrint Archive, 2005

Modeling Insider Attacks on Group Key-Exchange Protocols.
IACR Cryptology ePrint Archive, 2005

Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.
IACR Cryptology ePrint Archive, 2005

On Constructing Universal One-Way Hash Functions from Arbitrary One-Way Functions.
IACR Cryptology ePrint Archive, 2005

Universally Composable Password-Based Key Exchange.
IACR Cryptology ePrint Archive, 2005

Ring Signatures: Stronger Definitions, and Constructions without Random Oracles.
IACR Cryptology ePrint Archive, 2005

Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Chosen-Ciphertext Security of Multiple Encryption.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Adaptively-Secure, Non-interactive Public-Key Encryption.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Bounds on the Efficiency of "Black-Box" Commitment Schemes.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Reducing Complexity Assumptions for Statistically-Hiding Commitment.
Proceedings of the Advances in Cryptology, 2005

Universally Composable Password-Based Key Exchange.
Proceedings of the Advances in Cryptology, 2005

Secure Remote Authentication Using Biometric Data.
Proceedings of the Advances in Cryptology, 2005

Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption.
Proceedings of the Topics in Cryptology, 2005

Modeling insider attacks on group key-exchange protocols.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

Two-Server Password-Only Authenticated Key Exchange.
Proceedings of the Applied Cryptography and Network Security, 2005

2004
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
IACR Cryptology ePrint Archive, 2004

Adaptively-Secure, Non-Interactive Public-Key Encryption.
IACR Cryptology ePrint Archive, 2004

Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption.
IACR Cryptology ePrint Archive, 2004

Identity-Based Zero Knowledge.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Trust-Preserving Set Operations.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Chosen-Ciphertext Security from Identity-Based Encryption.
Proceedings of the Advances in Cryptology, 2004

A Generic Construction for Intrusion-Resilient Public-Key Encryption.
Proceedings of the Topics in Cryptology, 2004

Round-Optimal Secure Two-Party Computation.
Proceedings of the Advances in Cryptology, 2004

One-Round Protocols for Two-Party Authenticated Key Exchange.
Proceedings of the Applied Cryptography and Network Security, 2004

2003
Scalable Protocols for Authenticated Group Key Exchange.
IACR Cryptology ePrint Archive, 2003

Chosen-Ciphertext Security from Identity-Based Encryption.
IACR Cryptology ePrint Archive, 2003

A Forward-Secure Public-Key Encryption Scheme.
IACR Cryptology ePrint Archive, 2003

Lower bounds on the efficiency of encryption and digital signature schemes.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Toward Secure Key Distribution in Truly Ad-Hoc Networks.
Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT 2003), 27-31 January 2003, 2003

Strong Key-Insulated Signature Schemes.
Proceedings of the Public Key Cryptography, 2003

Binary Tree Encryption: Constructions and Applications.
Proceedings of the Information Security and Cryptology, 2003

Round Efficiency of Multi-party Computation with a Dishonest Majority.
Proceedings of the Advances in Cryptology, 2003

Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications.
Proceedings of the Advances in Cryptology, 2003

A Forward-Secure Public-Key Encryption Scheme.
Proceedings of the Advances in Cryptology, 2003

Intrusion-Resilient Public-Key Encryption.
Proceedings of the Topics in Cryptology, 2003

Scalable Protocols for Authenticated Group Key Exchange.
Proceedings of the Advances in Cryptology, 2003

Efficiency improvements for signature schemes with tight security reductions.
Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2002
A Forward-Secure Public-Key Encryption Scheme.
IACR Cryptology ePrint Archive, 2002

Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications.
IACR Cryptology ePrint Archive, 2002

Key-Insulated Public-Key Cryptosystems.
IACR Cryptology ePrint Archive, 2002

Forward Secrecy in Password-Only Key Exchange Protocols.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

Implementation of Chosen-Ciphertext Attacks against PGP and GnuPG.
Proceedings of the Information Security, 5th International Conference, 2002

Key-Insulated Public Key Cryptosystems.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Threshold Cryptosystems Based on Factoring.
Proceedings of the Advances in Cryptology, 2002

2001
Threshold Cryptosystems Based on Factoring.
IACR Cryptology ePrint Archive, 2001

Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords.
IACR Cryptology ePrint Archive, 2001

Efficient and Non-Interactive Non-Malleable Commitment.
IACR Cryptology ePrint Archive, 2001

Incremental Unforgeable Encryption.
Proceedings of the Fast Software Encryption, 8th International Workshop, 2001

Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords.
Proceedings of the Advances in Cryptology, 2001

Cryptographic Counters and Applications to Electronic Voting.
Proceedings of the Advances in Cryptology, 2001

Efficient and Non-interactive Non-malleable Commitment.
Proceedings of the Advances in Cryptology, 2001

2000
A Chosen Ciphertext Attack Against Several E-Mail Encryption Protocols.
Proceedings of the 9th USENIX Security Symposium, 2000

Complete characterization of security notions for probabilistic private-key encryption.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

On the efficiency of local decoding procedures for error-correcting codes.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation.
Proceedings of the Fast Software Encryption, 7th International Workshop, 2000


  Loading...