The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Random oracles are practical: a paradigm for designing efficient protocols
Open accessAbstract
We argue that the random oracle model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol PR for the random oracle model, and then replacing oracle accesses by the computation of an “appropriately chosen” function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including encryption, signatures, and zero-knowledge proofs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
Ciphertext-Policy Attribute-Based Encryption
Bethencourt, J., Sahai, A., & Waters, B. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.11 · Cited by 5,131
Attribute-based encryption for fine-grained access control of encrypted data
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180418 · Cited by 5,009
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
“For a random oracle [2] hash function, the only way to find a solution is to iterate through candidate values of x”
BackgroundIdentity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Provable data possession at untrusted stores
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315318 · Cited by 2,705
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Self-citationEnabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing
Wang, Q., Wang, C., Ren, K., Lou, W., & Li, J. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.183 · Cited by 1,511
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
The Bitcoin Backbone Protocol: Analysis and Applications
Garay, J., Kiayias, A., & Leonardos, N. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_10 · Cited by 1,366
On the (Im)possibility of Obfuscating Programs
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., & Yang, K. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_1 · Cited by 1,286
Zheng, Y. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052234 · Cited by 1,250
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
“In the random oracle model [9], the adversary A is additionally given access to a random oracle that it can query up to qH times.”
MethodBulletproofs: Short Proofs for Confidential Transactions and More
Bunz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., & Maxwell, G. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00020 · Cited by 1,154
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_34 · Cited by 1,132
A pairwise key pre-distribution scheme for wireless sensor networks
Du, W., Deng, J., Han, Y. S., & Varshney, P. K. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948118 · Cited by 1,107
Efficient group signature schemes for large groups: Extended abstract
Camenisch, J., & Stadler, M. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052252 · Cited by 1,083
Security Proofs for Signature Schemes
Pointcheval, D., & Stern, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_33 · Cited by 1,077
A pairwise key predistribution scheme for wireless sensor networks
Du, W., Deng, J., Han, Y. S., Varshney, P. K., Katz, J., & Khalili, A. (2005) · ACM Transactions on Information and System Security · doi:10.1145/1065545.1065548 · Cited by 1,038
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
The random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
Cramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 978
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
Self-citationBellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
Self-citationChosen-Ciphertext Security from Identity-Based Encryption
Canetti, R., Halevi, S., & Katz, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_13 · Cited by 900
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
Password-Based Authenticated Key Exchange in the Three-Party Setting
Abdalla, M., Fouque, P.-A., & Pointcheval, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_6 · Cited by 833
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Cramer, R., & Shoup, V. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_4 · Cited by 831
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Self-citationPractical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
Ateniese, G., Camenisch, J., Joye, M., & Tsudik, G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_16 · Cited by 800
EPPA: An Efficient and Privacy-Preserving Aggregation Scheme for Secure Smart Grid Communications
Lu, R., Liang, X., Li, X., Lin, X., & Shen, X. (2012) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.86 · Cited by 772
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Deterministic and Efficiently Searchable Encryption
Bellare, M., Boldyreva, A., & O’Neill, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_30 · Cited by 745
Self-citationImproved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743
HMQV: A High-Performance Secure Diffie-Hellman Protocol: (Extended Abstract)
Krawczyk, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_33 · Cited by 730
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Boyko, V., MacKenzie, P., & Patel, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_12 · Cited by 729
Quadratic Span Programs and Succinct NIZKs without PCPs
Gennaro, R., Gentry, C., Parno, B., & Raykova, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_37 · Cited by 724
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
Stronger Security of Authenticated Key Exchange
LaMacchia, B., Lauter, K., & Mityagin, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75670-5_1 · Cited by 695
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation
Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., & Steiner, M. (2014) · Proceedings 2014 Network and Distributed System Security Symposium · doi:10.14722/ndss.2014.23264 · Cited by 677
Multi-signatures in the plain public-Key model and a general forking lemma
Bellare, M., & Neven, G. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180453 · Cited by 654
Self-citationLossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
Reclaiming space from duplicate files in a serverless distributed file system
Douceur, J. R., Adya, A., Bolosky, W. J., Simon, P., & Theimer, M. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022312 · Cited by 645
Information sharing across private databases
Agrawal, R., Evfimievski, A., & Srikant, R. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872771 · Cited by 634
Message-Locked Encryption and Secure Deduplication
Bellare, M., Keelveedhi, S., & Ristenpart, T. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_18 · Cited by 632
Self-citationEfficient oblivious transfer protocols
Naor, M., & Benny Pinkas, B. (2001) · Symposium on Discrete Algorithms · doi:10.5555/365411.365502 · Cited by 614
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*
Abadi, M., & Rogaway, P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0014-7 · Cited by 613
Self-citationShort Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Boneh, D., & Boyen, X. (2008) · Journal of Cryptology · doi:10.1007/s00145-007-9005-7 · Cited by 605
On the (im)possibility of obfuscating programs
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., & Yang, K. (2012) · Journal of the ACM · doi:10.1145/2160158.2160159 · Cited by 595
A Forward-Secure Digital Signature Scheme
Bellare, M., & Miner, S. K. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_28 · Cited by 591
Self-citationNon-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Sahai, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814628 · Cited by 575
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Barić, N., & Pfitzmann, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_33 · Cited by 557
Foundations of garbled circuits
Bellare, M., Hoang, V. T., & Rogaway, P. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382279 · Cited by 541
Self-citationFaster Secure Two-Party Computation Using Garbled Circuits
Huang, Y., Evans, D., Katz, J. I., & Malka, L. (2011) · doi:10.18130/v3hj5c · Cited by 532
Lysyanskaya, A., Rivest, R. L., Sahai, A., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46513-8_14 · Cited by 521
A Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and TrendsŴ in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 504
Johnson, R., Molnar, D., Song, D., & Wagner, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45760-7_17 · Cited by 501
Public Key Encryption with Keyword Search Revisited
Baek, J., Safavi-Naini, R., & Susilo, W. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69839-5_96 · Cited by 498
Tree-based group key agreement
Kim, Y., Perrig, A., & Tsudik, G. (2004) · ACM Transactions on Information and System Security · doi:10.1145/984334.984337 · Cited by 492
Efficient Proofs that a Committed Number Lies in an Interval
Boudot, F. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_31 · Cited by 489
Simple and fault-tolerant key agreement for dynamic collaborative groups
Kim, Y., Perrig, A., & Tsudik, G. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352638 · Cited by 488
Optimistic fair exchange of digital signatures
Asokan, N., Shoup, V., & Waidner, M. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839935 · Cited by 480
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Okamoto, T., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_8 · Cited by 477
MR-PDP: Multiple-Replica Provable Data Possession
Curtmola, R., Khan, O., Burns, R., & Ateniese, G. (2008) · 2008 The 28th International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2008.68 · Cited by 473
Attribute-Based Encryption With Verifiable Outsourced Decryption
Lai, J., Deng, R. H., Guan, C., & Weng, J. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2271848 · Cited by 466
A Lightweight Message Authentication Scheme for Smart Grid Communications
Fouda, M. M., Fadlullah, Z. M., Kato, N., Lu, R., & Shen, X. (2011) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2011.2160661 · Cited by 457
A Modular Analysis of the Fujisaki-Okamoto Transformation
Hofheinz, D., Hövelmanns, K., & Kiltz, E. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70500-2_12 · Cited by 451
Random Oracles in a Quantum World
Boneh, D., Dagdelen, Ö., Fischlin, M., Lehmann, A., Schaffner, C., & Zhandry, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_3 · Cited by 449
Fast batch verification for modular exponentiation and digital signatures
Bellare, M., Garay, J. A., & Rabin, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054130 · Cited by 443
Self-citationKey-Privacy in Public-Key Encryption
Bellare, M., Boldyreva, A., Desai, A., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_33 · Cited by 442
Self-citationShort Pairing-Based Non-interactive Zero-Knowledge Arguments
Groth, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_19 · Cited by 440
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
Barreto, P. S. L. M., Libert, B., McCullagh, N., & Quisquater, J.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11593447_28 · Cited by 437
On the Indifferentiability of the Sponge Construction
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_11 · Cited by 425
Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424
Chosen‐Ciphertext Security from Identity‐Based Encryption
Boneh, D., Canetti, R., Halevi, S., & Katz, J. (2007) · SIAM Journal on Computing · doi:10.1137/s009753970544713x · Cited by 415
Coercion-resistant electronic elections
Juels, A., Catalano, D., & Jakobsson, M. (2005) · Proceedings of the 2005 ACM workshop on Privacy in the electronic society · doi:10.1145/1102199.1102213 · Cited by 414
Cryptographic Extraction and Key Derivation: The HKDF Scheme
Krawczyk, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_34 · Cited by 408
On enabling secure applications through off-line biometric identification
Davida, G. I., Frankel, Y., & Matt, B. J. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674831 · Cited by 406
Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups
Liu, J. K., Wei, V. K., & Wong, D. S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27800-9_28 · Cited by 405
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (2013) · Journal of Cryptology · doi:10.1007/s00145-011-9114-1 · Cited by 402
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
Katz, J., Ostrovsky, R., & Yung, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_29 · Cited by 398
Civitas: Toward a Secure Voting System
Clarkson, M. R., Chong, S., & Myers, A. C. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.32 · Cited by 397
Applications of multilinear forms to cryptography
Boneh, D., & Silverberg, A. (2003) · Contemporary Mathematics · doi:10.1090/conm/324/05731 · Cited by 395
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 395
Scalable Protocols for Authenticated Group Key Exchange
Katz, J., & Yung, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_7 · Cited by 393
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Groth, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11935230_29 · Cited by 390
When private set intersection meets big data: an efficient and scalable protocol
Dong, C., Chen, L., & Wen, Z. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516701 · Cited by 387
A Provably Secure, Efficient, and Flexible Authentication Scheme for Ad hoc Wireless Sensor Networks
Chang, C.-C., & Le, H.-D. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2015.2473165 · Cited by 385
Authentication and integrity in outsourced databases
Mykletun, E., Narasimha, M., & Tsudik, G. (2006) · ACM Transactions on Storage · doi:10.1145/1149976.1149977 · Cited by 382
Privacy-Friendly Aggregation for the Smart-Grid
Kursawe, K., Danezis, G., & Kohlweiss, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22263-4_10 · Cited by 378
Provably authenticated group Diffie-Hellman key exchange
Bresson, E., Chevassut, O., Pointcheval, D., & Quisquater, J.-J. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502018 · Cited by 372
Metadata
- Authors
- Bellare, M., & Rogaway, P.
- Venue
- Proceedings of the 1st ACM conference on Computer and communications security - CCS '93
- Publisher
- ACM Press
- Published
- 1993
- Pages
- 62-73
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2052267638
- Cited by
- 4,712
- References
- 44
- FWCI
- 8.16
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.