Dan Boneh
Cryptography Professor, Professor of Electrical Engineering and Senior Fellow at the Freeman Spogli Institute for International Studies
Computer Science
Bio
Professor Boneh heads the applied cryptography group and co-direct the computer security lab. Professor Boneh's research focuses on applications of cryptography to computer security. His work includes cryptosystems with novel properties, web security, security for mobile devices, and cryptanalysis. He is the author of over a hundred publications in the field and is a Packard and Alfred P. Sloan fellow. He is a recipient of the 2014 ACM prize and the 2013 Godel prize. In 2011 Dr. Boneh received the Ishii award for industry education innovation. Professor Boneh received his Ph.D from Princeton University and joined Stanford in 1997.
Academic Appointments
-
Professor, Computer Science
-
Professor, Electrical Engineering
-
Senior Fellow, Freeman Spogli Institute for International Studies
Honors & Awards
-
ACM prize, ACM (2015)
-
Simons investigator, Simons foundation (2015)
-
Godel prize, ACM (2013)
-
IACR fellow, IACR (2013)
-
Horizon Award, Computerworld (2006)
-
Packard Fellow and Sloan Fellow, Packard (present)
Professional Education
-
PhD, Princeton (1996)
2024-25 Courses
- Computer and Network Security
CS 155 (Spr) - Introduction to Cryptography
CS 255 (Win) -
Independent Studies (22)
- Advanced Reading and Research
CS 499 (Aut, Win, Spr) - Advanced Reading and Research
CS 499P (Aut, Win, Spr) - Community Health and Prevention Research Master's Thesis Writing
CHPR 399 (Aut, Win, Spr, Sum) - Curricular Practical Training
CS 390A (Aut, Win, Spr) - Curricular Practical Training
CS 390B (Aut, Win, Spr) - Curricular Practical Training
CS 390C (Aut, Win, Spr) - Curricular Practical Training and Internship
CHPR 290 (Aut, Win, Spr, Sum) - Directed Studies in Applied Physics
APPPHYS 290 (Aut, Win, Spr) - Independent Project
CS 399 (Aut, Win, Spr) - Independent Project
CS 399P (Aut, Win, Spr) - Independent Work
CS 199 (Aut, Win, Spr) - Independent Work
CS 199P (Aut, Win, Spr) - Master's Thesis and Thesis Research
EE 300 (Aut, Win, Spr) - Part-time Curricular Practical Training
CS 390D (Aut, Win, Spr) - Programming Service Project
CS 192 (Aut, Win, Spr) - Research
PHYSICS 490 (Aut, Win, Spr) - Senior Project
CS 191 (Aut, Win, Spr) - Special Studies and Reports in Electrical Engineering
EE 191 (Aut, Win, Spr) - Special Studies and Reports in Electrical Engineering
EE 391 (Aut, Win, Spr) - Special Studies or Projects in Electrical Engineering
EE 190 (Aut, Win, Spr) - Special Studies or Projects in Electrical Engineering
EE 390 (Aut, Win, Spr) - Writing Intensive Senior Research Project
CS 191W (Aut, Win, Spr)
- Advanced Reading and Research
-
Prior Year Courses
2023-24 Courses
- Computer and Network Security
CS 155 (Spr) - Cryptocurrencies and blockchain technologies
CS 251 (Aut) - Introduction to Cryptography
CS 255 (Win)
2022-23 Courses
- Computer and Network Security
CS 155 (Spr) - Cryptocurrencies and blockchain technologies
CS 251 (Aut) - Introduction to Cryptography
CS 255 (Win)
2021-22 Courses
- Computer and Network Security
CS 155 (Spr) - Cryptocurrencies and blockchain technologies
CS 251 (Aut) - Introduction to Cryptography
CS 255 (Win)
- Computer and Network Security
Stanford Advisees
-
Doctoral Dissertation Reader (AC)
Agur Adams, Jason Anderson, Kamilla Nazirkhanova, Joachim Neu, Luke Sammarone, Kavya Sreedhar, Srivatsan Sridhar, Ertem Tas, Gina Yuan -
Postdoctoral Faculty Sponsor
Binyi Chen, Lior Rotem Benvenisty -
Orals Evaluator
Jason Anderson -
Doctoral Dissertation Advisor (AC)
Alex Ozdemir -
Master's Program Advisor
Billy Bao, Gareth A Cockroft, Brylie Corelis, Devin Fung, Andrew Gan, Vidur Gupta, Basant Khalil, Aman Ladia, Kerui Lu, Sasha Ronaghi, Parth Shroff, Diego Stone -
Doctoral Dissertation Co-Advisor (AC)
Keller Blackwell -
Doctoral (Program)
Trisha Datta, Rohit Nema, Wilson Nguyen, Alex Ozdemir, Aditi Partap, Neil Perry, Megha Srivastava
All Publications
-
Falcon — A Flexible Architecture For Accelerating Cryptography
2019 IEEE 16th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)
2019
View details for DOI 10.1109/MASS.2019.00025
-
Stickler: Defending against Malicious Content Distribution Networks in an Unmodified Browser
IEEE SECURITY & PRIVACY
2016; 14 (2): 22-28
View details for Web of Science ID 000374552300005
-
Computing on Authenticated Data
JOURNAL OF CRYPTOLOGY
2015; 28 (2): 351-395
View details for DOI 10.1007/s00145-014-9182-0
View details for Web of Science ID 000350245700006
-
An Experimental Study of TLS Forward Secrecy Deployments
IEEE INTERNET COMPUTING
2014; 18 (6): 43-51
View details for DOI 10.1109/MIC.2014.86
View details for Web of Science ID 000344591800008
-
Neuroscience Meets Cryptography: Crypto Primitives Secure Against Rubber Hose Attacks
COMMUNICATIONS OF THE ACM
2014; 57 (5): 110-118
View details for DOI 10.1145/2594445
View details for Web of Science ID 000335571800021
-
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
33rd Annual International Association for Cryptologic Research Eurocrypt Conference on the Theory and Applications of Cryptographic Techniques
SPRINGER-VERLAG BERLIN. 2014: 533–556
View details for Web of Science ID 000352691200030
-
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records
34th IEEE Symposium on Security and Privacy (SP)
IEEE. 2013: 334–348
View details for DOI 10.1109/SP.2013.30
View details for Web of Science ID 000326249300022
- Privacy-Preserving Ridge Regression on Hundreds of Millions of Records. 2013
- Message-Locked Encryption for Lock-Dependent Messages. 2013
- Key Homomorphic PRFs and Their Applications. 2013
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation. Cryptology ePrint Archive: Report 2013: 642
- Quantum-Secure Message Authentication Codes. 2013
- Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption. 2013
- Private Database Queries Using Somewhat Homomorphic Encryption. 2013
- Ensuring high-quality randomness in cryptographic key generation. 2013
- Function-Private Subspace-Membership Encryption and Its Applications. 2013
- OSS: Using Online Scanning Services for Censorship Circumvention. 2013
- Constrained Pseudorandom Functions and Their Applications. 2013
- Privacy-preserving matrix factorization. 2013
- Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World. 2013
- Attribute-Based Encryption for Arithmetic Circuits. Cryptology ePrint Archive: Report 2013: 669
-
Functional Encryption: A New Vision for Public-Key Cryptography
COMMUNICATIONS OF THE ACM
2012; 55 (11): 56-64
View details for DOI 10.1145/2366316.2366333
View details for Web of Science ID 000311293300025
-
Privacy and Cybersecurity: The Next 100 Years
PROCEEDINGS OF THE IEEE
2012; 100: 1659-1673
View details for DOI 10.1109/JPROC.2012.2189794
View details for Web of Science ID 000309838000049
- StegoTorus: a camouflage proxy for the Tor anonymity system. 2012
- Persistent OSPF Attacks. 2012
- SessionJuggler: Secure Web Login From an Untrusted Terminal Using Session Hijacking. 2012
- Towards Short-Lived Certificates. 2012
- Computing on Authenticated Data. 2012
- The case for prefetching and prevalidating TLS server certificates. 2012
- Who Killed My Battery: Analyzing Mobile Browser Energy Consumption 2012
- The most dangerous code in the world: validating SSL certificates in non-browser software. 2012
- Evading Censorship with Browser-Based Proxies 2012
- Neuroscience Meets Cryptography: Designing Crypto Primitives Secure Against Rubber Hose Attacks 2012
- Targeted malleability: homomorphic encryption for restricted computations. 2012
-
Efficient Selective Identity-Based Encryption Without Random Oracles
JOURNAL OF CRYPTOLOGY
2011; 24 (4): 659-693
View details for DOI 10.1007/s00145-010-9078-6
View details for Web of Science ID 000294804700002
-
Finding composite order ordinary elliptic curves using the Cocks-Pinch method
JOURNAL OF NUMBER THEORY
2011; 131 (5): 832-841
View details for DOI 10.1016/j.jnt.2010.05.001
View details for Web of Science ID 000288687700003
-
Functional Encryption: Definitions and Challenges
8th Theory Cryptography Conference
SPRINGER-VERLAG BERLIN. 2011: 253–273
View details for Web of Science ID 000297038500016
- Functional encryption: definitions and challenges. 2011
- Homomorphic Signatures for Polynomial Functions. 2011
- Location privacy via private proximity testing. 2011
- Random Oracles in a Quantum World. 2011
- OpenConflict: preventing real time map hacks in online games. 2011
-
Homomorphic Signatures for Polynomial Functions
30th Annual International Conference on the Theory and Applications of Cryptographic Techniques
SPRINGER-VERLAG BERLIN. 2011: 149–168
View details for Web of Science ID 000301949500010
-
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
14th International Conference on Practice and Theory in Public Key Cryptography (PKC 2011)
SPRINGER-VERLAG BERLIN. 2011: 1–16
View details for Web of Science ID 000297040400001
-
OpenConflict: Preventing Real Time Map Hacks in Online Games
32nd IEEE Symposium on Security and Privacy (SP 2011)
IEEE COMPUTER SOC. 2011: 506–520
View details for DOI 10.1109/SP.2011.28
View details for Web of Science ID 000295408400032
-
Address Space Randomization for Mobile Devices
4th ACM Conference on Wireless Network Security
ASSOC COMPUTING MACHINERY. 2011: 127–137
View details for Web of Science ID 000292117100016
-
Random Oracles in a Quantum World
17th Annual International conference on the Theory and Application of Cryptology and Information Security
SPRINGER. 2011: 41–69
View details for Web of Science ID 000308844100003
-
Reliable Location-Based Services from Radio Navigation Systems
SENSORS
2010; 10 (12): 11369-11389
Abstract
Loran is a radio-based navigation system originally designed for naval applications. We show that Loran-C's high-power and high repeatable accuracy are fantastic for security applications. First, we show how to derive a precise location tag--with a sensitivity of about 20 meters--that is difficult to project to an exact location. A device can use our location tag to block or allow certain actions, without knowing its precise location. To ensure that our tag is reproducible we make use of fuzzy extractors, a mechanism originally designed for biometric authentication. We build a fuzzy extractor specifically designed for radio-type errors and give experimental evidence to show its effectiveness. Second, we show that our location tag is difficult to predict from a distance. For example, an observer cannot predict the location tag inside a guarded data center from a few hundreds of meters away. As an application, consider a location-aware disk drive that will only work inside the data center. An attacker who steals the device and is capable of spoofing Loran-C signals, still cannot make the device work since he does not know what location tag to spoof. We provide experimental data supporting our unpredictability claim.
View details for DOI 10.3390/s101211369
View details for Web of Science ID 000285708700050
View details for PubMedID 22163532
View details for PubMedCentralID PMC3231104
-
The Emergence of Cross Channel Scripting
COMMUNICATIONS OF THE ACM
2010; 53 (8): 105-113
View details for DOI 10.1145/1787234.1787257
View details for Web of Science ID 000280545500028
-
Kamouflage: Loss-Resistant Password Management
15th European Symposium on Research in Computer Security
SPRINGER-VERLAG BERLIN. 2010: 286–302
View details for Web of Science ID 000286151000018
- Algebraic pseudorandom functions with improved efficiency from the augmented cascade. 2010
- Busting frame busting: a study of clickjacking vulnerabilities at popular sites. 2010
- Kamouflage: loss-resistant password management. 2010
- Privacy preserving targeted advertising. 2010
- Preventing pollution attacks in multi-source network coding. 2010
- The case for ubiquitous transport-level encryption 2010
- An analysis of private browsing modes in modern browsers. 2010
- Lattice basis delegation in fixed dimension and shorter ciphertext hierarchical IBE 2010
- Framing attacks on smart phones and dumb routers: tap-jacking and geo-localization attacks. 2010
- Efficient lattice (H)IBE in the standard model. 2010
-
Preventing Pollution Attacks in Multi-source Network Coding
13th International Conference on Practice and Theory in Public Key Cryptography
SPRINGER-VERLAG BERLIN. 2010: 161–176
View details for Web of Science ID 000279498800010
-
Protecting Browsers from DNS Rebinding Attacks
14th ACM Conference on Computer and Communication Security
ASSOC COMPUTING MACHINERY. 2009
View details for DOI 10.1145/1462148.1462150
View details for Web of Science ID 000265880100002
- Signing a Linear Subspace: Signature Schemes for Network Coding. 2009
- XCS: cross channel scripting and its impact on web applications. 2009
- Homomorphic MACs: MAC-Based Integrity for Network Coding. 2009
- Fast symmetric cryptography in Javascript. 2009
-
Robust Location Tag Generation from Noisy Location Data for Security Applications
2009 International Technical Meeting of the Institute-of-Navigation
INST NAVIGATION. 2009: 586–597
View details for Web of Science ID 000279863400052
-
Physical Pseudo Random Function in Radio Frequency Sources for Security
2009 International Technical Meeting of the Institute-of-Navigation
INST NAVIGATION. 2009: 84–92
View details for Web of Science ID 000279863400009
-
Pattern Classification for Geotag Generation
22nd International Technical Meeting of the Satellite Division of the Institute-of-Navigation (ION GNSS-09)
INST NAVIGATION. 2009: 1819–1827
View details for Web of Science ID 000284356201084
-
Homomorphic MACs: MAC-Based Integrity for Network Coding
7th International Conference on Applied Cryptography and Network Security
SPRINGER-VERLAG BERLIN. 2009: 292–305
View details for Web of Science ID 000267695100018
-
Symmetric Cryptography in Javascript
25th Annual Computer Security Applications Conference
IEEE COMPUTER SOC. 2009: 373–381
View details for DOI 10.1109/ACSAC.2009.42
View details for Web of Science ID 000291011300035
-
Signing a Linear Subspace: Signature Schemes for Network Coding
12th International Conference on Practice and Theory in Public Key Cryptograhy
SPRINGER-VERLAG BERLIN. 2009: 68–87
View details for Web of Science ID 000265135200005
-
XCS: Cross Channel Scripting and its Impact on Web Applications
16th ACM Conference on Computer and Communications Security
ASSOC COMPUTING MACHINERY. 2009: 420–431
View details for Web of Science ID 000281662800039
-
Short signatures without random oracles and the SDH assumption in bilinear groups
JOURNAL OF CRYPTOLOGY
2008; 21 (2): 149-177
View details for DOI 10.1007/s00145-007-9005-7
View details for Web of Science ID 000253481800001
-
Overshadow: A virtualization-based approach to retrofitting protection in commodity operating systems
13th International Conference on Architectural Support for Programming Languages and Operating Systems
ASSOC COMPUTING MACHINERY. 2008: 2–13
View details for Web of Science ID 000256501300003
-
Generalized Identity Based and Broadcast Encryption Schemes
14th International Conference on the Theory and Application of Cryptology and Information Security
SPRINGER-VERLAG BERLIN. 2008: 455–470
View details for Web of Science ID 000263142700028
- Generalized Identity Based and Broadcast Encryption Schemes. 2008
- On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. 2008
- Overshadow: A Virtualization-Based Approach to Retrofitting Protection in Commodity Operating Systems. 2008
- Circular-Secure Encryption from Decision Diffie-Hellman. 2008
- Traitor Tracing with Constant Size Ciphertext. 2008
-
On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
49th Annual Symposium on Foundations-of-Computer-Science
IEEE COMPUTER SOC. 2008: 283–292
View details for DOI 10.1109/FOCS.2008.67
View details for Web of Science ID 000262484800030
-
Circular-secure encryption from decision Diffie-Hellman
28th Annual International Cryptology Conference
SPRINGER-VERLAG BERLIN. 2008: 108–125
View details for Web of Science ID 000259488300007
-
Traitor Tracing with Constant Size Ciphertext
15th ACM Conference on Computer and Communications Security
ASSOC COMPUTING MACHINERY. 2008: 501–510
View details for Web of Science ID 000267057800045
-
Conjunctive, subset, and range queries on encrypted data
4th Theory of Cryptography Conference
SPRINGER-VERLAG BERLIN. 2007: 535–554
View details for Web of Science ID 000245275900029
- Public Key Encryption That Allows PIR Queries. 2007
- Transaction Generators: Root Kits for the Web. 2007
- Cryptographic Methods for Storing Ballots on a Voting Machine. 2007
- Covert Channels in Privacy-Preserving Identification Systems. 2007
- Conjunctive, subset, and range queries on encrypted data. 2007
- Exposing private information by timing web applications. 2007
- Space-Efficient Identity Based Encryption Without Pairings. 2007
- Geoencryption using Loran. 2007
- Private Web Search 2007
- Reducing Shoulder-surfing by Using Gaze-based Password Entry. 2007
-
Geoencryption Using Loran
2007 National Technical Meeting of the Institute-of-Navigation
INST NAVIGATION. 2007: 104–115
View details for Web of Science ID 000279780100003
-
A brief look at pairings based cryptography
48th Annual IEEE Symposium on Foundations of Computer Science
IEEE COMPUTER SOC. 2007: 19–26
View details for DOI 10.1109/FOCS.2007.51
View details for Web of Science ID 000252161900002
-
Private Web Search
6th ACM Workshop on Privacy in the Electronic Society
ASSOC COMPUTING MACHINERY. 2007: 84–90
View details for Web of Science ID 000267259700014
-
Protecting Browsers from DNS Rebinding Attacks
14th ACM Conference on Computer and Communication Security
ASSOC COMPUTING MACHINERY. 2007: 421–431
View details for Web of Science ID 000266205800039
-
Space-efficient identity based encryption without pairings
48th Annual IEEE Symposium on Foundations of Computer Science
IEEE COMPUTER SOC. 2007: 647–657
View details for Web of Science ID 000252161900059
-
Covert Channels in Privacy-Preserving Identification Systems
14th ACM Conference on Computer and Communication Security
ASSOC COMPUTING MACHINERY. 2007: 297–306
View details for Web of Science ID 000266205800028
-
Public key encryption that allows PIR queries
27th Annual International Cryptology Conference
SPRINGER-VERLAG BERLIN. 2007: 50–67
View details for Web of Science ID 000251184300004
-
Chosen-ciphertext security from identity-based encryption
SIAM JOURNAL ON COMPUTING
2006; 36 (5): 1301-1328
View details for DOI 10.1137/S009753970544713X
View details for Web of Science ID 000244630600004
- Private encrypted content distribution using private broadcast encryption. 2006
- On the impossibility of efficiently combining collision resistant hash functions. 2006
- A collusion resistant broadcast, trace and revoke system. 2006
- Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles. 2006
- Secure function evaluation with ordered binary decision diagrams. 2006
- Strongly Unforgeable Signatures Based on Computational Diffie-Hellman. 2006
- SANE: A protection architecture for enterprise networks. 2006
- Fully Collusion Resistant Traitor Tracing With Short Ciphertexts and Private Keys. 2006
-
SANE: A protection architecture for enterprise networks
15th USENIX Security Symposium
USENIX ASSOC. 2006: 137–151
View details for Web of Science ID 000245599800010
-
Privacy in encrypted content distribution using private broadcast encryption
10th International Conference on Financial Cryptography and Data Security
SPRINGER-VERLAG BERLIN. 2006: 52–64
View details for Web of Science ID 000241687500004
-
Fully collusion resistant traitor tracing with short ciphertexts and private keys
24th Annual International Conference on Theory and Applications of Cryptographic Techniques
SPRINGER-VERLAG BERLIN. 2006: 573–592
View details for Web of Science ID 000238574200034
-
Strongly unforgeable signatures based on computational Diffie-Hellman
9th International Conference on Theory and Practice of Public Key Cryptography
SPRINGER-VERLAG BERLIN. 2006: 229–240
View details for Web of Science ID 000238186800015
-
Chosen ciphertext secure public key threshold encryption without random oracles
Cryptographers Track held at the RSA Conference (CT-RSA)
SPRINGER-VERLAG BERLIN. 2006: 226–243
View details for Web of Science ID 000236884700015
-
On the impossibility of efficiently combining collision resistant hash functions
26th Annual International Cryptology Conference
SPRINGER-VERLAG BERLIN. 2006: 570–583
View details for Web of Science ID 000240079900034
-
Remote timing attacks are practical
COMPUTER NETWORKS
2005; 48 (5): 701-716
View details for DOI 10.1016/j.comnet.2005.01.010
View details for Web of Science ID 000231609300002
-
Oblivious signature-based envelope
22nd ACM Symposium on Principles of Distributed Computing (PODC 03)
SPRINGER. 2005: 293–302
View details for DOI 10.1007/s00446-004-0116-1
View details for Web of Science ID 000229022200002
-
Improved efficiency for CCA-secure cryptosystems built using identity-based encryption
Cryptographers Track held at the RSA Conference (CT-RSA)
SPRINGER-VERLAG BERLIN. 2005: 87–103
View details for Web of Science ID 000228402200008
- Evaluating 2-DNF Formulas on Ciphertexts. 2005
- Stronger Password Authentication Using Browser Extensions. 2005
- Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity Based Encryption. 2005
-
Collusion resistant broadcast encryption with short ciphertexts and private keys
25th Annual International Cryptology Conference
SPRINGER-VERLAG BERLIN. 2005: 258–275
View details for Web of Science ID 000233382200016
-
Hierarchical identity based encryption with constant size ciphertext
24th Annual International Conference on Theory and Applications of CryptographicTechniques
SPRINGER-VERLAG BERLIN. 2005: 440–456
View details for Web of Science ID 000229801200026
-
Evaluating 2-DNF formulas on ciphertexts
2nd Theory of Cryptography Conference (TCC 2005)
SPRINGER-VERLAG BERLIN. 2005: 325–341
View details for Web of Science ID 000228553300018
-
Stronger password authentication using browser extensions
14th USENIX Security Symposium
USENIX ASSOC. 2005: 17–31
View details for Web of Science ID 000231792900002
-
Short signatures from the Weil pairing
JOURNAL OF CRYPTOLOGY
2004; 17 (4): 297-319
View details for DOI 10.1007/s00145-004-0314-9
View details for Web of Science ID 000224027300005
- Efficient Selective Identity-Based Encryption Without Random Oracles. 2004
- On the Effectiveness of Address-Space Randomization 2004
- Short Group Signatures. 2004
- Secure Identity Based Encryption Without Random Oracles. 2004
- Group Signatures with Verifier-Local Revocation. 2004
- Public key encryption with keyword search. 2004
- Short Signatures Without Random Oracles. 2004
-
Public key encryption with keyword search
23rd Annual Eurocrypt Conference
SPRINGER-VERLAG BERLIN. 2004: 506–522
View details for Web of Science ID 000221612100030
-
Short signatures without random oracles
23rd Annual Eurocrypt Conference
SPRINGER-VERLAG BERLIN. 2004: 56–73
View details for Web of Science ID 000221612100004
-
Efficient selective-ID secure identity-based encryption without random oracles
23rd Annual Eurocrypt Conference
SPRINGER-VERLAG BERLIN. 2004: 223–238
View details for Web of Science ID 000221612100014
-
Short group signatures
24th Annual International Cryptology Conference
SPRINGER-VERLAG BERLIN. 2004: 41–55
View details for Web of Science ID 000223568800003
-
Secure identity based encryption without random oracles
24th Annual International Cryptology Conference
SPRINGER-VERLAG BERLIN. 2004: 443–459
View details for Web of Science ID 000223568800027
-
Identity-based encryption from the Weil pairing
SIAM JOURNAL ON COMPUTING
2003; 32 (3): 586-615
View details for Web of Science ID 000183459000002
- SiRiUS: Securing Remote Untrusted Storage. 2003
- Oblivious Signature-Based Envelope. 2003
- Remote timing attacks are practical. 2003
- A Survey of Two Signature Aggregation Techniques. In CryptoBytes 2003; 6 (2)
- Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. 2003
- The Design and Implementation of Protocol-based Hidden Key Recovery. 2003
- Flexible OS support and applications for trusted computing. In the 9th Hot Topics in Operating Systems (HOTOS-IX) 2003
- Applications of Multilinear Forms to Cryptography. Contemporary Mathematics, American Mathematical Society 2003; 324
- Terra: A Virtual Machine-Based Platform for Trusted Computing. 2003
-
The design and implementation of protocol-based hidden key recovery
6th International Information Security Conference (ISC 2003)
SPRINGER-VERLAG BERLIN. 2003: 165–179
View details for Web of Science ID 000188037700013
-
Remote timing attacks are practical
12th USENIX Security Symposium
USENIX ASSOC. 2003: 1–13
View details for Web of Science ID 000221657500001
-
A secure signature scheme from bilinear maps
Cryptographers Track held at the RSA Conference (CT-RSA)
SPRINGER-VERLAG BERLIN. 2003: 98–110
View details for Web of Science ID 000183012200007
-
Aggregate and verifiably encrypted signatures from bilinear maps
International Conference on Theory and Applications of Cryptographic Techniques (EUROCRYPT 2003)
SPRINGER-VERLAG BERLIN. 2003: 416–432
View details for Web of Science ID 000183540000026
-
Finding smooth integers in short intervals using CRT decoding
32nd Annual ACM Symposium on Theory of Computing
ACADEMIC PRESS INC ELSEVIER SCIENCE. 2002: 768–84
View details for DOI 10.1006/jcss.2002.1827
View details for Web of Science ID 000176720500003
-
Attacking an obfuscated cipher by injecting faults
2nd Workshop on Digital Rights Management
SPRINGER-VERLAG BERLIN. 2002: 16–31
View details for Web of Science ID 000185044500002
- Attacking an obfuscated cipher by injecting faults. 2002
- Fast variants of RSA. CryptoBytes 2002; 5 (1): 1-9
- Almost entirely correct mixing with applications to voting. 2002
-
Optimistic mixing for exit-polls
8th International Conference on the Theory and Application of Cryptology and Information Security
SPRINGER-VERLAG BERLIN. 2002: 451–465
View details for Web of Science ID 000182854800028
-
Efficient generation of shared RSA keys
JOURNAL OF THE ACM
2001; 48 (4): 702-722
View details for Web of Science ID 000173093400005
-
On the importance of eliminating errors in cryptographic computations
JOURNAL OF CRYPTOLOGY
2001; 14 (2): 101-119
View details for Web of Science ID 000167723300003
-
Where genetic algorithms excel
EVOLUTIONARY COMPUTATION
2001; 9 (1): 93-124
Abstract
We analyze the performance of a genetic algorithm (GA) we call Culling, and a variety of other algorithms, on a problem we refer to as the Additive Search Problem (ASP). We show that the problem of learning the Ising perceptron is reducible to a noisy version of ASP. Noisy ASP is the first problem we are aware of where a genetic-type algorithm bests all known competitors. We generalize ASP to k-ASP to study whether GAs will achieve "implicit parallelism" in a problem with many more schemata. GAs fail to achieve this implicit parallelism, but we describe an algorithm we call Explicitly Parallel Search that succeeds. We also compute the optimal culling point for selective breeding, which turns out to be independent of the fitness function or the population distribution. We also analyze a mean field theoretic algorithm performing similarly to Culling on many problems. These results provide insight into when and how GAs can beat competing methods.
View details for Web of Science ID 000172244700006
View details for PubMedID 11290286
-
Lower bounds for multicast message authentication
International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT 2001)
SPRINGER-VERLAG BERLIN. 2001: 437–452
View details for Web of Science ID 000174810500027
- Lower Bounds for Multicast Message Authentication. 2001
- Simplified OAEP for the RSA and Rabin functions. 2001
- The Modular Inversion Hidden Number Problem. 2001
- On the importance of checking cryptographic protocols for faults. Journal of Cryptology, Springer-Verlag 2001; 14 (2): 101-119
- Improving SSL Handshake Performance via Batching. 2001
- On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme. 2001
-
A method for fast revocation of public key certificates and security capabilities
10th USENIX Security Symposium
USENIX ASSOC. 2001: 297–308
View details for Web of Science ID 000174316300021
-
Improving SSL handshake performance via batching
Cryptographers Track held at the RSA Conference (CT-RSA)
SPRINGER-VERLAG BERLIN. 2001: 28–43
View details for Web of Science ID 000174347700003
-
Architectural support for copy and tamper resistant software
9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS_IX)
ASSOC COMPUTING MACHINERY. 2000: 168–77
View details for Web of Science ID 000165257200017
-
Cryptanalysis of RSA with private key d less than N-0.292
IEEE TRANSACTIONS ON INFORMATION THEORY
2000; 46 (4): 1339-1349
View details for Web of Science ID 000088206200012
-
Why textbook ElGamal and RSA encryption are insecure - (Extended abstract)
6th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2000)
SPRINGER-VERLAG BERLIN. 2000: 30–43
View details for Web of Science ID 000174810100003
- Why Textbook ElGamal and RSA Encryption are Insecure. 2000
- Generating RSA Keys on a Handheld Using an Untrusted Server. 2000
-
Timed commitments
20th Annual International Cryptology Conference
SPRINGER-VERLAG BERLIN. 2000: 236–254
View details for Web of Science ID 000171179300015
-
Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
INFORMATION PROCESSING LETTERS
1999; 70 (2): 83-87
View details for Web of Science ID 000080904300006
-
Experimenting with electronic commerce on the PalmPilot
3rd International Financial Cryptography Conference (FC 99)
SPRINGER-VERLAG BERLIN. 1999: 1–16
View details for Web of Science ID 000086109700001
- Twenty years of attacks on the RSA cryptosystem. Notices of the American Mathematical Society (AMS) 1999; 46 (2): 203-213
- Factoring N=prq for large r. 1999
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring. 1999
- Experimenting with Shared Generation of RSA keys. 1999
- Experimenting with electronic commerce on the PalmPilot. 1999
- Building intrusion tolerant applications. 1999
- An efficient public key traitor tracing scheme. 1999
- Anonymous authentication with subset queries. 1999
-
Cryptanalysis of RSA with private key d less than N-0.292
International Conference on the Theory and Application of Cryptographic Techniques
SPRINGER-VERLAG BERLIN. 1999: 1–11
View details for Web of Science ID 000165175200001
-
Building intrusion tolerant applications
8th USENIX Security Symposium (Security 99)
USENIX ASSOC. 1999: 79–91
View details for Web of Science ID 000082926600007
-
Collusion-secure fingerprinting for digital data
IEEE TRANSACTIONS ON INFORMATION THEORY
1998; 44 (5): 1897-1905
View details for Web of Science ID 000075317000014
-
Breaking RSA may not be equivalent to factoring (Extended abstract)
International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT 98)
SPRINGER-VERLAG BERLIN. 1998: 59–71
View details for Web of Science ID 000078927600005
- An attack on RSA given a small fraction of the private key bits. 1998
- Breaking RSA may not be equivalent to factoring. 1998
- Cryptanalysis of RSA with private key d less than N0.292. 1998
- The decision Diffie-Hellman problem. 1998
- Generating a Product of Three Primes With an Unknown Factorization. 1998
- A generalized wallet architecture. 1998
-
An attack on RSA given a small fraction of the private key bits
International Conference on the Theory and Application of Cryptology and Information Security
SPRINGER-VERLAG BERLIN. 1998: 25–34
View details for Web of Science ID 000083636700003
-
SWAPEROO: A simple wallet architecture for payments, exchanges, refunds, and other operations
3rd USENIX Workshop on Electronic Commerce
USENIX ASSOC. 1998: 121–139
View details for Web of Science ID 000077907300011
- Revocation of unread E-mail in an untrusted network. 1997
- Rounding in lattices and its cryptographic applications. 1997
- Effect of operators on straight line complexity. 1997
- On the importance of checking cryptographic protocols for faults. 1997
- A revocable backup system. 1996
- Running dynamic programming algorithms on a DNA computer. 1996
- Algorithms for black box fields and their application to cryptography. 1996
- Making DNA computers error resistant. 1996
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. 1996
- On the computational power of DNA. In Discrete Applied Mathematics, Special Issue on Computational Molecular Biology 1996; 71: 79-94
- Collusion secure fingerprinting for digital data. 1995
- Quantum cryptanalysis of hidden linear forms. 1995
- Breaking DES using a molecular computer. 1995
- Learning using group representations. 1995
- Amplification of weak learning over the uniform distribution. 1993
- A Secure Signature Scheme from Bilinear Maps.
- Protecting Browsers from DNS Rebinding Attacks. 2009, 2007
- Client side caching for TLS. ACM Trans. Info. and Sys. Security 2,004; 4 (7): 553-75
- Protecting Browser State from Web Privacy Attacks.
- Hierarchical Identity Based Encryption with Constant Size Ciphertext.
- A Method for Fast Revocation of Public Key Certificates and Security Capabilities.
- Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys.