The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Circular-Secure Encryption from Decision Diffie-Hellman
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Self-citationA Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
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
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
Polynomial Reconstruction Based Cryptography
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_10 · Cited by 1,361
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Camenisch, J., & Lysyanskaya, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_7 · Cited by 1,321
Self Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,121
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_41 · Cited by 879
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
(2004) · Lecture notes in computer science · doi:10.1007/b99099 · Cited by 709
Advances in Cryptology — CRYPTO ’91: Proceedings
(1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1 · Cited by 687
(2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48000-7 · Cited by 661
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9026-x · Cited by 652
(2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3 · Cited by 613
A Computational Introduction to Number Theory and Algebra
Shoup, V. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814549 · Cited by 549
Advances in Cryptology – EUROCRYPT 2008
Tillich, J., & Zémor, G. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78967-3 · Cited by 521
(2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64840-4 · Cited by 455
The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_19 · Cited by 393
(2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5 · Cited by 333
Secure Hybrid Encryption from Weakened Key Encapsulation
Hofheinz, D., & Kiltz, E. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_31 · Cited by 306
Encryption-Scheme Security in the Presence of Key-Dependent Messages
Black, J., Rogaway, P., & Shrimpton, T. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36492-7_6 · Cited by 249
A Computational Introduction to Number Theory and Algebra
Shoup, V. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9781139165464 · Cited by 204
Bellare, M., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_24 · Cited by 197
Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation
Katz, J. I., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44706-7_20 · Cited by 182
Information Security and Cryptology - ICISC 2003
Wang, G., Bao, F., Zhou, J., & Deng, R. H. (2004) · Lecture notes in computer science · doi:10.1007/b96249 · Cited by 154
On the (Im)Possibility of Key Dependent Encryption
Haitner, I., & Holenstein, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_13 · Cited by 106
Soundness of Formal Encryption in the Presence of Key-Cycles
Adão, P., Bana, G., Herzog, J. C., & Scedrov, A. (2005) · Lecture notes in computer science · doi:10.1007/11555827_22 · Cited by 80
Security under key-dependent inputs
Halevi, S., & Krawczyk, H. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315303 · Cited by 68
Self-citationTowards Key-Dependent Message Security in the Standard Model
Hofheinz, D., & Unruh, D. (2008) · Springer eBooks · doi:10.1007/978-3-540-78967-3_7 · Cited by 61
Cited by
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
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
Public-Key Cryptosystems Resilient to Key Leakage
Naor, M., & Segev, G. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_2 · Cited by 403
Metadata
- Authors
- Boneh, D., Halevi, S., Hamburg, M., & Ostrovsky, R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008-08-20
- Pages
- 108-125
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1949164874
- Cited by
- 293
- References
- 32
- FWCI
- 14.39
- Type
- conference paper
- Language
- en
- Open access
- closed
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.