| A taxonomy of pairing-friendly elliptic curves D Freeman, M Scott, E Teske Journal of cryptology 23, 224-280, 2010 | 676 | 2010 |
| Signing a linear subspace: Signature schemes for network coding D Boneh, D Freeman, J Katz, B Waters Public Key Cryptography–PKC 2009: 12th International Conference on Practice …, 2009 | 439 | 2009 |
| Converting pairing-based cryptosystems from composite-order groups to prime-order groups DM Freeman Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference …, 2010 | 391 | 2010 |
| Homomorphic signatures for polynomial functions D Boneh, DM Freeman Advances in Cryptology–EUROCRYPT 2011: 30th Annual International Conference …, 2011 | 364 | 2011 |
| Functional encryption for inner product predicates from learning with errors S Agrawal, DM Freeman, V Vaikuntanathan Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the …, 2011 | 290 | 2011 |
| Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures D Boneh, DM Freeman International Workshop on Public Key Cryptography, 1-16, 2011 | 275 | 2011 |
| Machine learning and security: Protecting systems with data and algorithms C Chio, D Freeman " O'Reilly Media, Inc.", 2018 | 259 | 2018 |
| Detecting clusters of fake accounts in online social networks C Xiao, DM Freeman, T Hwa Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security …, 2015 | 220 | 2015 |
| Constructing pairing-friendly elliptic curves with embedding degree 10 D Freeman International Algorithmic Number Theory Symposium, 452-465, 2006 | 173 | 2006 |
| Who Are You? A Statistical Approach to Measuring User Authenticity. D Freeman, S Jain, M Dürmuth, B Biggio, G Giacinto NDSS 16, 21-24, 2016 | 149 | 2016 |
| Improved security for linearly homomorphic signatures: A generic framework DM Freeman Public Key Cryptography–PKC 2012: 15th International Conference on Practice …, 2012 | 142 | 2012 |
| More constructions of lossy and correlation-secure trapdoor functions DM Freeman, O Goldreich, E Kiltz, A Rosen, G Segev Public Key Cryptography–PKC 2010: 13th International Conference on Practice …, 2010 | 140 | 2010 |
| Using naive bayes to detect spammy names in social networks DM Freeman Proceedings of the 2013 ACM workshop on Artificial intelligence and security …, 2013 | 81 | 2013 |
| “real attackers don't compute gradients”: bridging the gap between adversarial ml research and practice G Apruzzese, HS Anderson, S Dambra, D Freeman, F Pierazzi, K Roundy 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), 339-364, 2023 | 67 | 2023 |
| Deniable encryption with negligible detection probability: An interactive construction M Dürmuth, DM Freeman Advances in Cryptology–EUROCRYPT 2011: 30th Annual International Conference …, 2011 | 66 | 2011 |
| Preventing pollution attacks in multi-source network coding S Agrawal, D Boneh, X Boyen, DM Freeman Public Key Cryptography–PKC 2010: 13th International Conference on Practice …, 2010 | 64 | 2010 |
| More constructions of lossy and correlation-secure trapdoor functions DM Freeman, O Goldreich, E Kiltz, A Rosen, G Segev Journal of cryptology 26, 39-74, 2013 | 56 | 2013 |
| Limitations on transformations from composite-order to prime-order groups: The case of round-optimal blind signatures S Meiklejohn, H Shacham, DM Freeman Advances in Cryptology-ASIACRYPT 2010: 16th International Conference on the …, 2010 | 54 | 2010 |
| Deep entity classification: Abusive account detection for online social networks T Xu, G Goossen, HK Cevahir, S Khodeir, Y Jin, F Li, S Shan, S Patel, ... 30th {USENIX} Security Symposium ({USENIX} Security 21), 2021 | 48 | 2021 |
| Abelian varieties with prescribed embedding degree D Freeman, P Stevenhagen, M Streng International Algorithmic Number Theory Symposium, 60-73, 2008 | 43 | 2008 |
Dan BonehProfessor of Computer Science, Stanford University在 cs.stanford.edu 的电子邮件经过验证
