- Blockwise-Adaptive Attackers Revisiting the (In)Security of Some Provably Secure
- Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions
- TwoServer PasswordOnly Authenticated Key Jonathan Katz 1# , Philip MacKenzie 2 , Gelareh Taban 3 , and Virgil Gligor 3
- Title of dissertation: Fast Scalable Peer-to-Peer Lookup Services for Multi-Hop Wireless Networks
- Impossibility of Blind Signatures From One-Way Permutations
- Reducing Complexity Assumptions for Statistically-Hiding Iftach Haitner
- Chosen-Ciphertext Security from Identity-Based Encryption
- Round E#ciency of MultiParty Computation with a Dishonest Majority #
- Binary Tree Encryption: Constructions and Applications
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Provably Secure Threshold PasswordAuthenticated Key Exchange
- DYNAMIC SPECTRUM ACCESS IN COGNITIVE RADIO NETWORKS
- Introduction 1.1 Cryptography and Modern Cryptography
- Universally Composable PasswordBased Key Exchange
- E#cient Cryptographic Protocols Preventing ``ManintheMiddle'' Attacks
- Strong KeyInsulated Signature Schemes Yevgeniy Dodis 1 , Jonathan Katz 2 , Shouhuai Xu 3 , and Moti Yung 4
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Secure Remote Authentication Using Biometric Data
- Title of dissertation: ON FAIRNESS IN SECURE COMPUTATION S. Dov Gordon, Doctor of Philosophy, 2010
- Jonathan Katz and Yehuda Lindell Introduction to Modern
- Implementation of Chosen-Ciphertext Attacks against PGP and GnuPG
- Bridging Game Theory and Cryptography: Recent Results and Future Directions
- Round E#ciency of MultiParty Computation with a Dishonest Majority
- Handling Expected PolynomialTime Strategies in SimulationBased Security Proofs
- Cryptographic Counters and Applications to Electronic Voting
- Probabilistically Checkable Proofs and their Consequences for Approximation Algorithms
- Secure Text Processing with Applications to Private DNA Matching
- Design Notes for an Efficient Password-Authenticated Key Exchange Implementation Using Human-Memorable Passwords
- Composability and On-Line Deniability of Authentication
- Title of dissertation: LOOKUP PROTOCOLS AND TECHNIQUES FOR ANONYMITY
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Scalable Protocols for Authenticated Group Key Exchange
- On Achieving the "Best of Both Worlds" in Secure Multiparty Computation
- Bounds on the Efficiency of Black-Box Commitment Omer Horvitz1
- Ring Signatures: Stronger Definitions, and Constructions without Random Oracles
- Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
- Chosen-Ciphertext Security from Identity-Based Encryption
- Complete Fairness in Secure Two-Party Computation S. Dov Gordon
- Two-Server Password-Only Authenticated Key Exchange Jonathan Katz
- Faster Secure Two-Party Computation Using Garbled Circuits Yan Huang David Evans
- Limits of Computational Differential Privacy in the Client/Server Setting
- A Group Signature Scheme from Lattice Assumptions S. Dov Gordon
- On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
- Complete Fairness in Secure Two-Party Computation S. Dov Gordon
- Universally Composable Multi-Party Computation with an Unreliable Common
- Universally-Composable Two-Party Computation in Two Rounds
- Universally Composable Multi-Party Computation Using Tamper-Proof Hardware
- Round-Efficient Secure Computation in Point-to-Point Networks
- Round-Optimal Secure Two-Party Computation Jonathan Katz1
- Scalable Protocols for Authenticated Group Key Exchange
- Provably Secure Threshold Password-Authenticated Key Exchange
- Cryptanalysis of the the Polynomial Reconstruction Based Public-Key Cryptosystem of Eurocrypt'03 in the Optimal
- Errata/Typos for "Introduction to Modern Cryptography"
- In Section 4.6.3 we described a "birthday attack" for finding a collision in an arbitrary hash function. If the output length of the hash function is bits, the
- Title of dissertation: EXPRESSIVENESS OF DEFINITIONS AND EFFICIENCY OF CONSTRUCTIONS
- Computing Securely with Untrusted Resources Seny Kamara
- Title of dissertation: ALGORITHMS FOR SOLVING LINEAR AND POLYNOMIAL
- Title of thesis: AN ANALYSIS OF CHAUM'S VOTER-VERIFIABLE
- Title of Document: A SURVEY OF THE ATTACK ON MD5. Prathap Sridharan, MS Applied Mathematics,
- Computational Geometry1 David M. Mount
- University of Maryland CMSC858K --Introduction to Cryptography
- Notes on Complexity Theory Last updated: September, 2007 Jonathan Katz
- Notes on Complexity Theory Last updated: October, 2008 Lecture Space-Bounded Derandomization
- CMSC 858K --Advanced Topics in Cryptography January 27, 2004 Lecturer: Jonathan Katz Scribe(s): Jonathan Katz
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- A ForwardSecure PublicKey Encryption Ran Canetti 1 , Shai Halevi 1 , and Jonathan Katz 2
- Magnetic Swipe Card System Security A case study of the University of Maryland, College Park
- Notes on Complexity Theory Last updated: March, 2008 Lecture on Parity
- Title of dissertation: ON SOLVING UNIVARIATE POLYNOMIAL EQUATIONS OVER FINITE FIELDS
- Bounds on the Eciency of \Black-Box" Commitment Schemes
- Toward Secure Key Distribution in Truly AdHoc Networks Aram Khalili
- A GameTheoretic Framework for Analyzing TrustInference Protocols
- ChosenCiphertext Security of Multiple Yevgeniy Dodis 1# and Jonathan Katz 2##
- Reducing Complexity Assumptions for StatisticallyHiding Commitment
- Round Complexity of Authenticated Broadcast with a Dishonest Majority Juan A. Garay
- Parallel and Concurrent Security of the Jonathan Katz
- Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure
- A Forward-Secure Public-Key Encryption Scheme Ran Canetti
- Adaptively-Secure, Non-Interactive Public-Key Ran Canetti1
- A ForwardSecure PublicKey Encryption Ran Canetti 1 , Shai Halevi 1 , and Jonathan Katz 2
- Lower Bounds on the Efficiency of Encryption and Digital Signature Schemes
- Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based
- On Expected Constant-Round Protocols for Byzantine Agreement
- Efficient and Secure Authenticated Key Exchange Using Weak Passwords
- Title of dissertation: STUDIES ON FAULT-TOLERANT BROADCAST
- One-Round Protocols for Two-Party Authenticated Key Exchange
- Universally Composable PasswordBased Key Exchange Ran Canetti # Shai Halevi # Jonathan Katz + Yehuda Lindell #
- Improving the Round Complexity of VSS in Point-to-Point Networks
- Forward Secrecy in Password-Only Key Exchange Protocols
- E#cient and NonMalleable Proofs of Plaintext Knowledge and Applications #
- Notes on Complexity Theory Last updated: October, 2008 Lecture on Relativization
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems
- Compact Signatures for Network Coding Jonathan Katz
- Characterization of Security Notions for Probabilistic PrivateKey Encryption #
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Title of dissertation: A STUDY OF SEPARATIONS IN CRYPTOGRAPHY: NEW RESULTS AND NEW MODELS
- Notes on Complexity Theory Last updated: July, 2011 Lecture Time-Bounded Derandomization
- Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?
- Quid Pro Quo-tocols: Strengthening Semi-Honest Protocols with Dual Execution University of Virginia
