- Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys
- On The Computational Power of DNA Dan Boneh Christopher Dunworth Richard J. Lipton 3
- Twenty Years of Attacks on the RSA Cryptosystem dabo@cs.stanford.edu
- Efficient Selective Identity-Based Encryption Without Random Oracles
- Homomorphic MACs: MAC-based Integrity for Network Coding Shweta Agrawal1 and Dan Boneh2
- Ecient Generation of Shared RSA keys Dan Boneh Matthew Franklin
- Exposing Private Information by Timing Web Applications
- Making DNA computers error resistant Dan Boneh Christopher Dunworth Richard J. Lipton \Lambda
- Exposing an RSA Private Key Given a Small Fraction of its Bits Dan Boneh Glenn Durfee y Yair Frankel
- Generating RSA Keys on a Handheld Using an Untrusted Server Nagendra Modadugu Dan Boneh Michael Kim
- Short Group Signatures dabo@cs.stanford.edu
- Flexible OS Support and Applications for Trusted Computing Tal Garfinkel Mendel Rosenblum Dan Boneh
- An Analysis of Private Browsing Modes in Modern Browsers Gaurav Aggarwal Elie Bursztein
- Lower Bounds for Multicast Message Authentication Dan Boneh Glenn Durfee Matt Franklin
- Twenty Years of Attacks on the RSA Cryptosystem dabo@cs.stanford.edu
- Improving SSL Handshake Performance via Batching Hovav Shacham Dan Boneh
- Breaking DES Using a Molecular Computer (Extended Abstract)
- Breaking RSA May Be Easier Than Factoring (Extended Abstract)
- SWAPEROO: A Simple Wallet Architecture for Payments, Exchanges, Refunds, and Other Operations *
- Conjunctive, Subset, and Range Queries on Encrypted Data dabo@cs.stanford.edu
- Experimenting with Electronic Commerce on the PalmPilot
- Quantum Cryptanalysis of Hidden Linear (Extended Abstract)
- SiRiUS: Securing Remote Untrusted Storage EuJin Goh , Hovav Shacham y , Nagendra Modadugu, Dan Boneh z
- An E#cient Public Key Traitor Tracing Scheme Dan Boneh Matthew Franklin
- Efficient Lattice (H)IBE in the Standard Model Shweta Agrawal
- Efficient Lattice (H)IBE in the Standard Model Shweta Agrawal 1
- Cryptographic Methods for Storing Ballots on a Voting Machine John Bethencourt
- CS55N: Ten Ideas in Computer Security Fall 2005 Course Project
- Cryptanalysis of RSA with Private Key d Less Than N 0:292 Dan Boneh Glenn Durfee y
- Dan Boneh 3 Richard J. Lipton dabo@cs.princeton.edu rjl@cs.princeton.edu
- Rounding in lattices and its cryptographic applications dabo@cs.princeton.edu
- Running dynamic programming algorithms on a DNA computer Eric B. Baum Dan Boneh
- Timed Commitments (Extended Abstract)
- Short Signatures from the Weil Pairing Dan Boneh y
- Breaking RSA May Be Easier Than Factoring Extended Abstract
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles
- Remote Timing Attacks are Practical David Brumley Dan Boneh
- Framing Attacks on Smart Phones and Dumb Routers: Tap-jacking and Geo-localization Attacks
- Flexible OS Support and Applications for Trusted Computing Tal Garfinkel Mendel Rosenblum Dan Boneh
- Attacking an obfuscated cipher by injecting faults Matthias Jacob
- Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
- Experimenting with Shared Generation of RSA keys \Lambda Michael Malkin Thomas Wu Dan Boneh y
- A Revocable Backup System (extended abstract)
- The Decision Di e-Hellman Problem dabo@cs.stanford.edu
- A Survey of Two Signature Aggregation Techniques dabo@cs.stanford.edu
- OpenConflict: Preventing Real Time Map Hacks in Online Games Elie Bursztein
- Location Privacy via Private Proximity Testing Arvind Narayanan Narendran Thiagarajan Mugdha Lakhani
- Kamouflage: Loss-Resistant Password Hristo Bojinov1
- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
- Chosen-Ciphertext Security from Identity-Based Encryption
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Evaluating 2-DNF Formulas on Ciphertexts dabo@cs.stanford.edu
- Secure Identity Based Encryption Without Random Oracles dabo@cs.stanford.edu
- Terra: A Virtual Machine-Based Platform for Trusted Computing Tal Garfinkel Ben Pfaff Jim Chow Mendel Rosenblum Dan Boneh
- Client Side Caching for TLS Hovav Shacham Dan Boneh Eric Rescorla
- Identity-Based Encryption from the Weil Pairing Matthew Franklin
- A Revocable Backup System(extended abstract) Dan Boneh Richard J. Lipton
- Generating a Product of Three Primes With an Unknown Factorization
- Ecient Generation of Shared RSA keys Dan Boneh Matthew Franklin
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Traitor Tracing with Constant Size Ciphertext Stanford University
- Public Key Encryption with keyword Search Giovanni Di Crescenzo
- Aggregate and Verifiably Encrypted Signatures from Bilinear Maps dabo@cs.stanford.edu
- A Simple Attack on ElGamal Public Key Encryption (Extended Abstract)
- Learning Using Group Representations (Extended Abstract)
- Effect of Operators on Straight Line Complexity (Extended Abstract)
- Space-Efficient Identity Based Encryption Without Pairings Craig Gentry
- Searching for Elements in Black Box Fields and Applications Dan Boneh Richard Lipton \Lambda
- Simpli ed OAEP for the RSA and Rabin Functions
- Hardness of Computing the Most Significant Bits of Secret Keys in DiffieHellman and
- CollusionSecure Fingerprinting for Digital Data Dan Boneh James Shaw
- On the Unpredictability of Bits of the Elliptic Curve Die{Hellman Scheme
- Building Intrusion Tolerant Applications Thomas Wu Michael Malkin Dan Boneh y
- Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade
- Breaking Generalized DiffieHellman Modulo a Composite is no Easier than Factoring
- The Decision DiffieHellman Problem dabo@cs.stanford.edu
- On the Importance of Eliminating Errors in Cryptographic Computations
- Strongly Unforgeable Signatures Based on Computational Diffie-Hellman
- Contemporary Mathematics Applications of Multilinear Forms to Cryptography
- Circular-Secure Encryption from Decision Diffie-Hellman Dan Boneh1 , Shai Halevi2, Mike Hamburg1, and Rafail Ostrovsky3
- A Secure Signature Scheme from Bilinear Maps Dan Boneh Ilya Mironov Victor Shoup
- The Case for Prefetching and Prevalidating TLS Server Certificates
