![]() | 2009 | |
---|---|---|
120 | ![]() ![]() ![]() ![]() ![]() ![]() | Hristo Bojinov, Elie Bursztein, Dan Boneh: XCS: cross channel scripting and its impact on web applications. ACM Conference on Computer and Communications Security 2009: 420-431 |
119 | ![]() ![]() ![]() ![]() ![]() ![]() | Shweta Agrawal, Dan Boneh: Homomorphic MACs: MAC-Based Integrity for Network Coding. ACNS 2009: 292-305 |
118 | ![]() ![]() ![]() ![]() ![]() ![]() | Emily Stark, Michael Hamburg, Dan Boneh: Symmetric Cryptography in Javascript. ACSAC 2009: 373-381 |
117 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, David Freeman, Jonathan Katz, Brent Waters: Signing a Linear Subspace: Signature Schemes for Network Coding. Public Key Cryptography 2009: 68-87 |
116 | ![]() ![]() ![]() ![]() ![]() ![]() | Collin Jackson, Adam Barth, Andrew Bortz, Weidong Shao, Dan Boneh: Protecting browsers from DNS rebinding attacks. TWEB 3(1): 2 (2009) |
2008 | ||
115 | ![]() ![]() ![]() ![]() ![]() ![]() | Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: Cryptography, 16.09. - 21.09.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
114 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Tal Garfinkel, Dug Song: 2nd USENIX Workshop on Offensive Technologies, July 28, 2008, San Jose, CA, USA, Proceedings USENIX Association 2008 |
113 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Moni Naor: Traitor tracing with constant size ciphertext. ACM Conference on Computer and Communications Security 2008: 501-510 |
112 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Michael Hamburg: Generalized Identity Based and Broadcast Encryption Schemes. ASIACRYPT 2008: 455-470 |
111 | ![]() ![]() ![]() ![]() ![]() ![]() | Xiaoxin Chen, Tal Garfinkel, E. Christopher Lewis, Pratap Subrahmanyam, Carl A. Waldspurger, Dan Boneh, Jeffrey S. Dwoskin, Dan R. K. Ports: Overshadow: a virtualization-based approach to retrofitting protection in commodity operating systems. ASPLOS 2008: 2-13 |
110 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Shai Halevi, Michael Hamburg, Rafail Ostrovsky: Circular-Secure Encryption from Decision Diffie-Hellman. CRYPTO 2008: 108-125 |
109 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Periklis A. Papakonstantinou, Charles Rackoff, Yevgeniy Vahlis, Brent Waters: On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations. FOCS 2008: 283-292 |
108 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Xavier Boyen: Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups. J. Cryptology 21(2): 149-177 (2008) |
2007 | ||
107 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel V. Bailey, Dan Boneh, Eu-Jin Goh, Ari Juels: Covert channels in privacy-preserving identification systems. ACM Conference on Computer and Communications Security 2007: 297-306 |
106 | ![]() ![]() ![]() ![]() ![]() ![]() | Collin Jackson, Adam Barth, Andrew Bortz, Weidong Shao, Dan Boneh: Protecting browsers from dns rebinding attacks. ACM Conference on Computer and Communications Security 2007: 421-431 |
105 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III: Public Key Encryption That Allows PIR Queries. CRYPTO 2007: 50-67 |
104 | ![]() ![]() ![]() ![]() ![]() ![]() | Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: 07381 Abstracts Collection -- Cryptography. Cryptography 2007 |
103 | ![]() ![]() ![]() ![]() ![]() ![]() | Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: 07381 Executive Summary - Cryptography. Cryptography 2007 |
102 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: A Brief Look at Pairings Based Cryptography. FOCS 2007: 19-26 |
101 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Craig Gentry, Michael Hamburg: Space-Efficient Identity Based Encryption Without Pairings. FOCS 2007: 647-657 |
100 | ![]() ![]() ![]() ![]() ![]() ![]() | John Bethencourt, Dan Boneh, Brent Waters: Cryptographic Methods for Storing Ballots on a Voting Machine. NDSS 2007 |
99 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Bilinear Groups of Composite Order. Pairing 2007: 1 |
98 | ![]() ![]() ![]() ![]() ![]() ![]() | Manu Kumar, Tal Garfinkel, Dan Boneh, Terry Winograd: Reducing shoulder-surfing by using gaze-based password entry. SOUPS 2007: 13-19 |
97 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Brent Waters: Conjunctive, Subset, and Range Queries on Encrypted Data. TCC 2007: 535-554 |
96 | ![]() ![]() ![]() ![]() ![]() ![]() | Felipe Saint-Jean, Aaron Johnson, Dan Boneh, Joan Feigenbaum: Private web search. WPES 2007: 84-90 |
95 | ![]() ![]() ![]() ![]() ![]() ![]() | Andrew Bortz, Dan Boneh: Exposing private information by timing web applications. WWW 2007: 621-628 |
94 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz: Chosen-Ciphertext Security from Identity-Based Encryption. SIAM J. Comput. 36(5): 1301-1328 (2007) |
2006 | ||
93 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Brent Waters: A fully collusion resistant broadcast, trace, and revoke system. ACM Conference on Computer and Communications Security 2006: 211-220 |
92 | ![]() ![]() ![]() ![]() ![]() ![]() | Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh: Secure function evaluation with ordered binary decision diagrams. ACM Conference on Computer and Communications Security 2006: 410-420 |
91 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Xavier Boyen: On the Impossibility of Efficiently Combining Collision Resistant Hash Functions. CRYPTO 2006: 570-583 |
90 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Xavier Boyen, Shai Halevi: Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles. CT-RSA 2006: 226-243 |
89 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Amit Sahai, Brent Waters: Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys. EUROCRYPT 2006: 573-592 |
88 | ![]() ![]() ![]() ![]() ![]() ![]() | Adam Barth, Dan Boneh, Brent Waters: Privacy in Encrypted Content Distribution Using Private Broadcast Encryption. Financial Cryptography 2006: 52-64 |
87 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Emily Shen, Brent Waters: Strongly Unforgeable Signatures Based on Computational Diffie-Hellman. Public Key Cryptography 2006: 229-240 |
86 | ![]() ![]() ![]() ![]() ![]() ![]() | Collin Jackson, Andrew Bortz, Dan Boneh, John C. Mitchell: Protecting browser state from web privacy attacks. WWW 2006: 737-744 |
85 | ![]() ![]() ![]() ![]() ![]() ![]() | Collin Jackson, Andrew Bortz, Dan Boneh, John C. Mitchell: Protecting browser state from web privacy attacks. WWW 2006: 737-744 |
2005 | ||
84 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Craig Gentry, Brent Waters: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. CRYPTO 2005: 258-275 |
83 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Jonathan Katz: Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption. CT-RSA 2005: 87-103 |
82 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Xavier Boyen, Eu-Jin Goh: Hierarchical Identity Based Encryption with Constant Size Ciphertext. EUROCRYPT 2005: 440-456 |
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Eu-Jin Goh, Kobbi Nissim: Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005: 325-341 |
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: BLS Short Digital Signatures. Encyclopedia of Cryptography and Security 2005 |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Blum-Blum-Shub Pseudorandom Bit Generator. Encyclopedia of Cryptography and Security 2005 |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Blum-Goldwasser Public Key Encryption System. Encyclopedia of Cryptography and Security 2005 |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Cramer-Shoup Public Key System. Encyclopedia of Cryptography and Security 2005 |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Digital Signature Standard. Encyclopedia of Cryptography and Security 2005 |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Elgamal Digital Signature Scheme. Encyclopedia of Cryptography and Security 2005 |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Rabin Digital Signature Scheme. Encyclopedia of Cryptography and Security 2005 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Schnorr Digital Signature Scheme. Encyclopedia of Cryptography and Security 2005 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Secure signatures from the "strong RSA" assumption. Encyclopedia of Cryptography and Security 2005 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Strong RSA Assumption. Encyclopedia of Cryptography and Security 2005 |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | David Brumley, Dan Boneh: Remote timing attacks are practical. Computer Networks 48(5): 701-716 (2005) |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Ninghui Li, Wenliang Du, Dan Boneh: Oblivious signature-based envelope. Distributed Computing 17(4): 293-302 (2005) |
2004 | ||
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Hovav Shacham: Group signatures with verifier-local revocation. ACM Conference on Computer and Communications Security 2004: 168-177 |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Hovav Shacham, Matthew Page, Ben Pfaff, Eu-Jin Goh, Nagendra Modadugu, Dan Boneh: On the effectiveness of address-space randomization. ACM Conference on Computer and Communications Security 2004: 298-307 |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Xavier Boyen, Hovav Shacham: Short Group Signatures. CRYPTO 2004: 41-55 |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Xavier Boyen: Secure Identity Based Encryption Without Random Oracles. CRYPTO 2004: 443-459 |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Xavier Boyen: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. EUROCRYPT 2004: 223-238 |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano: Public Key Encryption with Keyword Search. EUROCRYPT 2004: 506-522 |
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Xavier Boyen: Short Signatures Without Random Oracles. EUROCRYPT 2004: 56-73 |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Hovav Shacham, Dan Boneh, Eric Rescorla: Client-side caching for TLS. ACM Trans. Inf. Syst. Secur. 7(4): 553-575 (2004) |
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Xuhua Ding, Gene Tsudik: Fine-grained control of security capabilities. ACM Trans. Internet Techn. 4(1): 60-82 (2004) |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Joan Feigenbaum, Abraham Silberschatz, Rebecca N. Wright: PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment. IEEE Data Eng. Bull. 27(1): 10-18 (2004) |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Ben Lynn, Hovav Shacham: Short Signatures from the Weil Pairing. J. Cryptology 17(4): 297-319 (2004) |
2003 | ||
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings Springer 2003 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Ilya Mironov, Victor Shoup: A Secure Signature Scheme from Bilinear Maps. CT-RSA 2003: 98-110 |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. EUROCRYPT 2003: 416-432 |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Tal Garfinkel, Mendel Rosenblum, Dan Boneh: Flexible OS Support and Applications for Trusted Computing. HotOS 2003: 145-150 |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Eu-Jin Goh, Dan Boneh, Benny Pinkas, Philippe Golle: The Design and Implementation of Protocol-Based Hidden Key Recovery. ISC 2003: 165-179 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Eu-Jin Goh, Hovav Shacham, Nagendra Modadugu, Dan Boneh: SiRiUS: Securing Remote Untrusted Storage. NDSS 2003 |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Ninghui Li, Wenliang Du, Dan Boneh: Oblivious signature-based envelope. PODC 2003: 182-189 |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Tal Garfinkel, Ben Pfaff, Jim Chow, Mendel Rosenblum, Dan Boneh: Terra: a virtual machine-based platform for trusted computing. SOSP 2003: 193-206 |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Matthew K. Franklin: Identity-Based Encryption from the Weil Pairing. SIAM J. Comput. 32(3): 586-615 (2003) |
2002 | ||
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Proceedings of the 11th USENIX Security Symposium, San Francisco, CA, USA, August 5-9, 2002 USENIX 2002 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Philippe Golle: Almost entirely correct mixing with applications to voting. ACM Conference on Computer and Communications Security 2002: 68-77 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Philippe Golle, Sheng Zhong, Dan Boneh, Markus Jakobsson, Ari Juels: Optimistic Mixing for Exit-Polls. ASIACRYPT 2002: 451-465 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Matthias Jacob, Dan Boneh, Edward W. Felten: Attacking an Obfuscated Cipher by Injecting Faults. Digital Rights Management Workshop 2002: 16-31 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Hovav Shacham, Dan Boneh: Fast-Track Session Establishment for TLS. NDSS 2002 |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Finding Smooth Integers in Short Intervals Using CRT Decoding. J. Comput. Syst. Sci. 64(4): 768-784 (2002) |
2001 | ||
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Shai Halevi, Nick Howgrave-Graham: The Modular Inversion Hidden Number Problem. ASIACRYPT 2001: 36-51 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Ben Lynn, Hovav Shacham: Short Signatures from the Weil Pairing. ASIACRYPT 2001: 514-532 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Igor Shparlinski: On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme. CRYPTO 2001: 201-212 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Matthew K. Franklin: Identity-Based Encryption from the Weil Pairing. CRYPTO 2001: 213-229 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Simplified OAEP for the RSA and Rabin Functions. CRYPTO 2001: 275-291 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Hovav Shacham, Dan Boneh: Improving SSL Handshake Performance via Batching. CT-RSA 2001: 28-43 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Glenn Durfee, Matthew K. Franklin: Lower Bounds for Multicast Message Authentication. EUROCRYPT 2001: 437-452 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Eric B. Baum, Dan Boneh, Charles Garrett: Where Genetic Algorithms Excel. Evolutionary Computation 9(1): 93-124 (2001) |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Matthew K. Franklin: Efficient generation of shared RSA keys. J. ACM 48(4): 702-722 (2001) |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Richard A. DeMillo, Richard J. Lipton: On the Importance of Eliminating Errors in Cryptographic Computations. J. Cryptology 14(2): 101-119 (2001) |
2000 | ||
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Antoine Joux, Phong Q. Nguyen: Why Textbook ElGamal and RSA Encryption Are Insecure. ASIACRYPT 2000: 30-43 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | David Lie, Chandramohan A. Thekkath, Mark Mitchell, Patrick Lincoln, Dan Boneh, John C. Mitchell, Mark Horowitz: Architectural Support for Copy and Tamper Resistant Software. ASPLOS 2000: 168-177 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Moni Naor: Timed Commitments. CRYPTO 2000: 236-254 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Nagendra Modadugu, Michael Kim: Generating RSA Keys on a Handheld Using an Untrusted Server. INDOCRYPT 2000: 271-282 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Finding smooth integers in short intervals using CRT decoding. STOC 2000: 265-272 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Glenn Durfee: Cryptanalysis of RSA with private key d less than N0.292. IEEE Transactions on Information Theory 46(4): 1339 (2000) |
1999 | ||
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Matthew K. Franklin: Anonymous Authentication with Subset Queries (extended abstract). ACM Conference on Computer and Communications Security 1999: 113-119 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Glenn Durfee, Nick Howgrave-Graham: Factoring N = prq for Large r. CRYPTO 1999: 326-337 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Matthew K. Franklin: An Efficient Public Key Traitor Tracing Scheme. CRYPTO 1999: 338-353 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Glenn Durfee: Cryptanalysis of RSA with Private Key d Less than N0.292. EUROCRYPT 1999: 1-11 |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Neil Daswani, Dan Boneh: Experimenting with Electronic Commerce on the PalmPilot. Financial Cryptography 1999: 1-16 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Malkin, Thomas D. Wu, Dan Boneh: Experimenting with Shared Generation of RSA Keys. NDSS 1999 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Eli Biham, Dan Boneh, Omer Reingold: Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring. Inf. Process. Lett. 70(2): 83-87 (1999) |
1998 | ||
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Jeremy Horwitz: Generating a Product of Three Primes with an Unknown Factorization. ANTS 1998: 237-251 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: The Decision Diffie-Hellman Problem. ANTS 1998: 48-63 |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Glenn Durfee, Yair Frankel: An Attack on RSA Given a Small Fraction of the Private Key Bits. ASIACRYPT 1998: 25-34 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Ramarathnam Venkatesan: Breaking RSA May Not Be Equivalent to Factoring. EUROCRYPT 1998: 59-71 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, James Shaw: Collusion-Secure Fingerprinting for Digital Data. IEEE Transactions on Information Theory 44(5): 1897-1905 (1998) |
1997 | ||
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Aviel D. Rubin, Dan Boneh, Kevin Fu: Revocation of Unread E-mail in an Untrusted Network. ACISP 1997: 62-75 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Matthew K. Franklin: Efficient Generation of Shared RSA Keys (Extended Abstract). CRYPTO 1997: 425-439 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Richard A. DeMillo, Richard J. Lipton: On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract). EUROCRYPT 1997: 37-51 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Richard J. Lipton: Effect of Operators on Straight Line Complexity. ISTCS 1997: 1-5 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Ramarathnam Venkatesan: Rounding in Lattices and its Cryptographic Applications. SODA 1997: 675-681 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Eli Biham, Dan Boneh, Omer Reingold: Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring Electronic Colloquium on Computational Complexity (ECCC) 4(61): (1997) |
1996 | ||
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Ramarathnam Venkatesan: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. CRYPTO 1996: 129-142 |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Richard J. Lipton: Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract). CRYPTO 1996: 283-297 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jiri Sgall: On the Computational Power of DNA. Discrete Applied Mathematics 71(1-3): 79-94 (1996) |
1995 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Eric B. Baum, Dan Boneh, Charles Garrett: On Genetic Algorithms. COLT 1995: 230-239 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh: Learning Using Group Representations (Extended Abstract). COLT 1995: 418-426 |
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Richard J. Lipton: Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract). CRYPTO 1995: 424-437 |
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, James Shaw: Collusion-Secure Fingerprinting for Digital Data (Extended Abstract). CRYPTO 1995: 452-465 |
1993 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Dan Boneh, Richard J. Lipton: Amplification of Weak Learning under the Uniform Distribution. COLT 1993: 347-351 |