Jonathan Katz

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.

[BibT_eX]

[DOI]

Cody Freitag

Nathan Klein

Proceedings of the Cyber Security Cryptography and Machine Learning, 2017

Experimentation for Developing Evidence-Based UI Standards of Mobile Survey Questionnaires.

[BibT_eX]

[DOI]

Erica L. Olmsted-Hawala

Brian Falcone

Ivonne J. Figueroa

Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems, 2017

Global-Scale Secure Multiparty Computation.

[BibT_eX]

[DOI]

Samuel Ranellucci

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

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation.

[BibT_eX]

[DOI]

Samuel Ranellucci

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

Subset Predicate Encryption and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Cryptology and Network Security - 16th International Conference, 2017

2016

Guest Editorial.

[BibT_eX]

[DOI]

IET Inf. Secur., 2016

All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption.

[BibT_eX]

[DOI]

Yupeng Zhang

Charalampos Papamanthou

IACR Cryptol. ePrint Arch., 2016

Faster Two-Party Computation Secure Against Malicious Adversaries in the Single-Execution Setting.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

An Oblivious Parallel RAM with O(log2 N) Parallel Runtime Blowup.

[BibT_eX]

[DOI]

Kartik Nayak

IACR Cryptol. ePrint Arch., 2016

5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Efficiently Enforcing Input Validity in Secure Two-party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Selective-Opening Security in the Presence of Randomness Failures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

The Cut-and-Choose Game and Its Application to Cryptographic Protocols.

[BibT_eX]

[DOI]

Proceedings of the 25th USENIX Security Symposium, 2016

Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on Security and Privacy, 2016

Analysis of a Proposed Hash-Based Signature Standard.

[BibT_eX]

[DOI]

Proceedings of the Security Standardisation Research - Third International Conference, 2016

2015

How to Authenticate any Data Structure.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

Secure Computation of MIPS Machine Code.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2015

Amortizing Garbled Circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Automated Analysis and Synthesis of Authenticated Encryption Schemes.

[BibT_eX]

[DOI]

Viet Tung Hoang

IACR Cryptol. ePrint Arch., 2015

Multi-Client Verifiable Computation with Stronger Security Guarantees.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Feasibility and Completeness of Cryptographic Tasks in the Quantum World.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

10-Round Feistel is Indifferentiable from an Ideal Cipher.

[BibT_eX]

[DOI]

Dana Dachman-Soled

IACR Cryptol. ePrint Arch., 2015

Functional Encryption from (Small) Hardwae Tokens.

[BibT_eX]

[DOI]

Kai-Min Chung

Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2015

Multi-Client Non-Interactive Verifiable Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds.

[BibT_eX]

[DOI]

Dana Dachman-Soled

Vanishree Rao

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

Hash Functions from Defective Ideal Ciphers.

[BibT_eX]

[DOI]

Stefan Lucks

Proceedings of the Topics in Cryptology, 2015

IntegriDB: Verifiable SQL for Outsourced Databases.

[BibT_eX]

[DOI]

Yupeng Zhang

Charalampos Papamanthou

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Nonoutsourceable Scratch-Off Puzzles to Discourage Bitcoin Mining Coalitions.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIGACT News, 2014

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

[BibT_eX]

[DOI]

SIGACT News, 2014

Anon-Pass: Practical Anonymous Subscriptions.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2014

Automated Analysis and Synthesis of Block-Cipher Modes of Operation.

[BibT_eX]

[DOI]

Matthew D. Green

IACR Cryptol. ePrint Arch., 2014

Pseudonymous Secure Computation from Time-Lock Puzzles.

[BibT_eX]

[DOI]

Andrew Miller

Elaine Shi

IACR Cryptol. ePrint Arch., 2014

A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds.

[BibT_eX]

[DOI]

Dana Dachman-Soled

Vanishree Rao

IACR Cryptol. ePrint Arch., 2014

Efficient Three-Party Computation from Cut-and-Choose.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Verifiable Oblivious Storage.

[BibT_eX]

[DOI]

Daniel Apon

Elaine Shi

IACR Cryptol. ePrint Arch., 2014

Implementing Cryptographic Program Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Permacoin: Repurposing Bitcoin Work for Data Preservation.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Automating Efficient RAM-Model Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Authenticated data structures, generically.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Distributing the setup in universally composable multi-party computation.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Multi-input Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

ALITHEIA: Towards Practical Verifiable Graph Processing.

[BibT_eX]

[DOI]

Yupeng Zhang

Charalampos Papamanthou

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

Cryptography.

[BibT_eX]

Proceedings of the Computing Handbook, 2014

Introduction to Modern Cryptography, Second Edition

[BibT_eX]

[DOI]

CRC Press, ISBN: 9781466570269, 2014

2013

One-round multi-party communication complexity of distinguishing sums.

[BibT_eX]

[DOI]

Daniel Apon

Theor. Comput. Sci., 2013

Review of identity-based encryption by Sanjit Chattarjee and Palash Sarkar.

[BibT_eX]

[DOI]

SIGACT News, 2013

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

[BibT_eX]

[DOI]

SIGACT News, 2013

Round-Optimal Password-Based Authenticated Key Exchange.

[BibT_eX]

[DOI]

J. Cryptol., 2013

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.

[BibT_eX]

[DOI]

Amit Sahai

Brent Waters

J. Cryptol., 2013

Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose.

[BibT_eX]

[DOI]

Yan Huang

David Evans

IACR Cryptol. ePrint Arch., 2013

Multi-Input Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Rational Protocol Design: Cryptography Against Incentive-driven Adversaries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Brief announcement: a game-theoretic model motivated by the darpa network challenge.

[BibT_eX]

[DOI]

Rajesh Hemant Chitnis

MohammadTaghi Hajiaghayi

Koyel Mukherjee

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy.

[BibT_eX]

[DOI]

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

Functional Encryption from (Small) Hardware Tokens.

[BibT_eX]

[DOI]

Kai-Min Chung

Hong-Sheng Zhou

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

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

[BibT_eX]

[DOI]

SIGACT News, 2012

Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009).

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Partial Fairness in Secure Two-Party Computation.

[BibT_eX]

[DOI]

J. Cryptol., 2012

Two-server password-only authenticated key exchange.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

A Game-Theoretic Model Motivated by the DARPA Network Challenge

[BibT_eX]

[DOI]

Rajesh Hemant Chitnis

MohammadTaghi Hajiaghayi

Koyel Mukherjee

CoRR, 2012

Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution.

[BibT_eX]

[DOI]

Yan Huang

David Evans

Proceedings of the IEEE Symposium on Security and Privacy, 2012

Knowledge-oriented secure multiparty computation.

[BibT_eX]

[DOI]

Proceedings of the 2012 Workshop on Programming Languages and Analysis for Security, 2012

Constant-Round Multi-party Private Set Union Using Reversed Laurent Series.

[BibT_eX]

[DOI]

Jae Hong Seo

Jung Hee Cheon

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?

[BibT_eX]

[DOI]

Yan Huang

David Evans

Proceedings of the 19th Annual Network and Distributed System Security Symposium, 2012

Byzantine Agreement with a Rational Adversary.

[BibT_eX]

[DOI]

Vassilis Zikas

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Secure two-party computation in sublinear (amortized) time.

[BibT_eX]

[DOI]

Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Complete Fairness in Secure Two-Party Computation.

[BibT_eX]

[DOI]

J. ACM, 2011

Universally Composable Synchronous Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Fair Computation with Rational Players.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

A Group Signature Scheme from Lattice Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Secure Computation with Sublinear Amortized Work.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

On the Security of the Free-XOR Technique.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Collusion-Preserving Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Faster Secure Two-Party Computation Using Garbled Circuits.

[BibT_eX]

[DOI]

Proceedings of the 20th USENIX Security Symposium, 2011

Impossibility of Blind Signatures from One-Way Permutations.

[BibT_eX]

[DOI]

Dominique Schröder

Arkady Yerukhimovich

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

Limits of Computational Differential Privacy in the Client/Server Setting.

[BibT_eX]

[DOI]

Arkady Yerukhimovich

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

Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.

[BibT_eX]

[DOI]

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

Adaptively secure broadcast, revisited.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Efficient Privacy-Preserving Biometric Identification.

[BibT_eX]

[DOI]

Proceedings of the Network and Distributed System Security Symposium, 2011

Efficient Secure Computation with Garbled Circuits.

[BibT_eX]

[DOI]

Proceedings of the Information Systems Security - 7th International Conference, 2011

2010

Public-Key Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Information and Communication Security, 2010

Bounds on the efficiency of black-box commitment schemes.

[BibT_eX]

[DOI]

Omer Horvitz

Theor. Comput. Sci., 2010

Parallel and Concurrent Security of the HB and HB+ Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2010

VMCrypt - Modular Software Architecture for Scalable Secure Computation.

[BibT_eX]

[DOI]

Lior Malka

IACR Cryptol. ePrint Arch., 2010

One-Round Password-Based Authenticated Key Exchange.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Constant-Round Private Function Evaluation with Linear Complexity.

[BibT_eX]

[DOI]

Lior Malka

IACR Cryptol. ePrint Arch., 2010

A New Framework for Password-Based Authenticated Key Exchange.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Secure text processing with applications to private DNA matching.

[BibT_eX]

[DOI]

Lior Malka

Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

A new framework for efficient password-based authenticated key exchange.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

Digital Signatures.

[BibT_eX]

[DOI]

Springer, ISBN: 978-0-387-27711-0, 2010

2009

Reducing Complexity Assumptions for Statistically-Hiding Commitment.

[BibT_eX]

[DOI]

J. Cryptol., 2009

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

[BibT_eX]

[DOI]

Adam Bender

Ruggero Morselli

J. Cryptol., 2009

On expected constant-round protocols for Byzantine agreement.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

Efficient and secure authenticated key exchange using weak passwords.

[BibT_eX]

[DOI]

J. ACM, 2009

Signature Schemes with Bounded Leakage Resilience.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Secure Network Coding Over the Integers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Attacking Cryptographic Schemes Based on "Perturbation Polynomials".

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Composability and On-Line Deniability of Authentication.

[BibT_eX]

[DOI]

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

Collusion-Free Multiparty Computation in the Mediated Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations.

[BibT_eX]

[DOI]

Arkady Yerukhimovich

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

Proofs of Storage from Homomorphic Identification Protocols.

[BibT_eX]

[DOI]

Giuseppe Ateniese

Seny Kamara

Proceedings of the Advances in Cryptology, 2009

2008

Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.

[BibT_eX]

[DOI]

J. Cryptol., 2008

Collusion-Free Multiparty Computation in the Mediated Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Complete Fairness in Multi-Party Computation Without an Honest Majority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Efficient Rational Secret Sharing in Standard Communication Networks.

[BibT_eX]

[DOI]

Georg Fuchsbauer

David Naccache

IACR Cryptol. ePrint Arch., 2008

Signing a Linear Subspace: Signature Schemes for Network Coding.

[BibT_eX]

[DOI]

Dan Boneh

David Mandell Freeman

Brent Waters

IACR Cryptol. ePrint Arch., 2008

Bridging Game Theory and Cryptography: Recent Results and Future Directions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

How to Encrypt with a Malicious Random Number Generator.

[BibT_eX]

[DOI]

Seny Kamara

Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

Aggregate Message Authentication Codes.

[BibT_eX]

[DOI]

Andrew Y. Lindell

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.

[BibT_eX]

[DOI]

SIGACT News, 2007

Chosen-Ciphertext Security from Identity-Based Encryption.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Scalable Protocols for Authenticated Group Key Exchange.

[BibT_eX]

[DOI]

J. Cryptol., 2007

Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems.

[BibT_eX]

[DOI]

J. Cryptol., 2007

A Forward-Secure Public-Key Encryption Scheme.

[BibT_eX]

[DOI]

Ran Canetti

Shai Halevi

J. Cryptol., 2007

Improving the Round Complexity of VSS in Point-to-Point Networks.

[BibT_eX]

[DOI]

Ranjit Kumaresan

IACR Cryptol. ePrint Arch., 2007

Universally Composable Multi-Party Computation with an Unreliable Common Reference String.

[BibT_eX]

[DOI]

Vipul Goyal

IACR Cryptol. ePrint Arch., 2007

Which Languages Have 4-Round Zero-Knowledge Proofs?.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions.

[BibT_eX]

[DOI]

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

Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2007

Round Complexity of Authenticated Broadcast with a Dishonest Majority.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Round-Efficient Secure Computation in Point-to-Point Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Universally Composable Multi-party Computation Using Tamper-Proof Hardware.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Universally-Composable Two-Party Computation in Two Rounds.

[BibT_eX]

[DOI]

Omer Horvitz

Proceedings of the Advances in Cryptology, 2007

Exploiting approximate transitivity of trust.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Broadband Communications, 2007

Introduction to Modern Cryptography

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIGACT News, 2006

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

[BibT_eX]

[DOI]

SIGACT News, 2006

Characterization of Security Notions for Probabilistic Private-Key Encryption.

[BibT_eX]

[DOI]

J. Cryptol., 2006

Analyzing the HB and HB+ Protocols in the "Large Error" Case.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Rational Secret Sharing, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Reliable broadcast in radio networks: the bounded collision case.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Parallel and Concurrent Security of the HB and HB+ Protocols.

[BibT_eX]

[DOI]

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

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

A pairwise key predistribution scheme for wireless sensor networks.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

SIGACT News, 2005

Bounds on the Efficiency of Generic Cryptographic Constructions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Parallel and Concurrent Security of the HB and HB+ Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Modeling Insider Attacks on Group Key-Exchange Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

On Constructing Universal One-Way Hash Functions from Arbitrary One-Way Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Universally Composable Password-Based Key Exchange.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Chosen-Ciphertext Security of Multiple Encryption.

[BibT_eX]

[DOI]

Yevgeniy Dodis

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Secure Remote Authentication Using Biometric Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Reducing Complexity Assumptions for Statistically-Hiding Commitment.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Adaptively-Secure, Non-Interactive Public-Key Encryption.

[BibT_eX]

[DOI]

Ran Canetti

Shai Halevi

IACR Cryptol. ePrint Arch., 2004

Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption.

[BibT_eX]

[DOI]

Dan Boneh

IACR Cryptol. ePrint Arch., 2004

Identity-Based Zero Knowledge.

[BibT_eX]

[DOI]

Michael O. Rabin

Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Trust-Preserving Set Operations.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

A Generic Construction for Intrusion-Resilient Public-Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2004

Round-Optimal Secure Two-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

One-Round Protocols for Two-Party Authenticated Key Exchange.

[BibT_eX]

[DOI]

Ik Rae Jeong

Dong Hoon Lee

Proceedings of the Applied Cryptography and Network Security, 2004

2003

Chosen-Ciphertext Security from Identity-Based Encryption.

[BibT_eX]

[DOI]

Ran Canetti

Shai Halevi

IACR Cryptol. ePrint Arch., 2003

Lower bounds on the efficiency of encryption and digital signature schemes.

[BibT_eX]

[DOI]

Rosario Gennaro

Yael Gertner

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Toward Secure Key Distribution in Truly Ad-Hoc Networks.

[BibT_eX]

[DOI]

Aram Khalili

William A. Arbaugh

Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT 2003), 27-31 January 2003, 2003

Strong Key-Insulated Signature Schemes.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2003

Binary Tree Encryption: Constructions and Applications.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 2003

Round Efficiency of Multi-party Computation with a Dishonest Majority.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

Intrusion-Resilient Public-Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2003

Efficiency improvements for signature schemes with tight security reductions.

[BibT_eX]

[DOI]

Nan Wang

Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2002

A Forward-Secure Public-Key Encryption Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

Key-Insulated Public-Key Cryptosystems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

Forward Secrecy in Password-Only Key Exchange Protocols.

[BibT_eX]

[DOI]

Proceedings of the Security in Communication Networks, Third International Conference, 2002

Implementation of Chosen-Ciphertext Attacks against PGP and GnuPG.

[BibT_eX]

[DOI]

Kahil Jallad

Bruce Schneier

Proceedings of the Information Security, 5th International Conference, 2002

2001

Threshold Cryptosystems Based on Factoring.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

Efficient and Non-Interactive Non-Malleable Commitment.

[BibT_eX]

[DOI]

Giovanni Di Crescenzo

IACR Cryptol. ePrint Arch., 2001

Incremental Unforgeable Encryption.

[BibT_eX]

[DOI]

Enrico Buonanno

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

Cryptographic Counters and Applications to Electronic Voting.

[BibT_eX]

[DOI]

Steven A. Myers

Proceedings of the Advances in Cryptology, 2001

2000

A Chosen Ciphertext Attack Against Several E-Mail Encryption Protocols.

[BibT_eX]

[DOI]

Bruce Schneier

Proceedings of the 9th USENIX Security Symposium, 2000

Complete characterization of security notions for probabilistic private-key encryption.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

On the efficiency of local decoding procedures for error-correcting codes.

[BibT_eX]

[DOI]

Luca Trevisan

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation.

[BibT_eX]

[DOI]