The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
The Algebraic Group Model and its Applications
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
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0314-9 · Cited by 1,467
On the Size of Pairing-Based Non-interactive Arguments
Groth, J. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49896-5_11 · Cited by 1,271
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Katz, J., Sahai, A., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_9 · Cited by 1,081
Signature Schemes and Anonymous Credentials from Bilinear Maps
Camenisch, J., & Lysyanskaya, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_4 · Cited by 982
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
Sequences of games: a tool for taming complexity in security proofs.
Shoup, V. (2004) · Cited by 760
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
Short 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
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
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
Abdalla, M., Bellare, M., & Rogaway, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_12 · Cited by 445
Camenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks
Damgård, I. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_36 · Cited by 357
Security Analysis of the Strong Diffie-Hellman Problem
Cheon, J. H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_1 · Cited by 274
Succinct Non-interactive Arguments via Linear Interactive Proofs
Bitansky, N., Chiesa, A., Ishai, Y., Paneth, O., & Ostrovsky, R. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-36594-2_18 · Cited by 274
How to win the clonewars: efficient periodic n-times anonymous authentication
Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., & Meyerovich, M. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180431 · Cited by 240
Breaking RSA may not be equivalent to factoring: Extended abstract
Boneh, D., & Venkatesan, R. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054117 · Cited by 235
Abstract Models of Computation in Cryptography
Maurer, U. (2005) · Lecture Notes in Computer Science · doi:10.1007/11586821_1 · Cited by 232
Complexity of a determinate algorithm for the discrete logarithm
Nechaev, V. I. (1994) · Mathematical Notes · doi:10.1007/bf02113297 · Cited by 232
Optimal Security Proofs for PSS and Other Signature Schemes
Coron, J.-S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_18 · Cited by 215
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Paillier, P., & Vergnaud, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11593447_1 · Cited by 176
Untraceable RFID tags via insubvertible encryption
Ateniese, G., Camenisch, J., & de Medeiros, B. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102134 · Cited by 171
Batch Verification of Short Signatures
Camenisch, J., Hohenberger, S., & Pedersen, M. Ø. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72540-4_14 · Cited by 170
Algorithms for Black-Box Fields and their Application to Cryptography
Boneh, D., & Lipton, R. J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_22 · Cited by 167
Code-Based Game-Playing Proofs and the Security of Triple Encryption
Mihir Bellare, Y., & Rogaway, P. (2006) · Cited by 161
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
Maurer, U. M., & Wolf, S. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539796302749 · Cited by 154
Optimal Security Proofs for Signatures from Identification Schemes
Kiltz, E., Masny, D., & Pan, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53008-5_2 · Cited by 102
Self-citationBreaking RSA Generically Is Equivalent to Factoring
Aggarwal, D., & Maurer, U. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01001-9_2 · Cited by 90
Security of the J-PAKE Password-Authenticated Key Exchange Protocol
Abdalla, M. F., Benhamouda, F., & MACKENZIE, P. D. (2015) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2015.41 · Cited by 76
A Cryptographic Framework for the Controlled Release of Certified Data
Bangerter, E., Camenisch, J. L., & Lysyanskaya, A. (2006) · Lecture notes in computer science · doi:10.1007/11861386_4 · Cited by 72
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Garg, S., Bhaskar, R., & Lokam, S. V. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5_6 · Cited by 67
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
Sadeghi, A., & Steiner, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_16 · Cited by 57
Anonymous yet accountable access control
Michael Backes, A., Camenisch, J. L., & Sommer, D. (2005) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1102199.1102208 · Cited by 56
Déjà Q: Using Dual Systems to Revisit q-Type Assumptions
Chase, M., & Meiklejohn, S. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-55220-5_34 · Cited by 49
Automated Analysis of Cryptographic Assumptions in Generic Group Models
Barthe, G., Fagerholm, E., Fiore, D., Mitchell, J. C., Scedrov, A., & Schmidt, B. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44371-2_6 · Cited by 35
On the Existence of Extractable One-Way Functions
Bitansky, N., Canetti, R., Paneth, O., & Rosen, A. (2016) · SIAM Journal on Computing · doi:10.1137/140975048 · Cited by 24
The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
Jager, T., & Rupp, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17373-8_31 · Cited by 23
Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups
Ghadafi, E., & Groth, J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70697-9_3 · Cited by 20
Rupp, A., Leander, G., Bangerter, E., Dent, A. W., & Sadeghi, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89255-7_30 · Cited by 17
Cited by
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., & Ward, N. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-45721-1_26 · Cited by 358
Metadata
- Authors
- Fuchsbauer, G., Kiltz, E., & Loss, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2018
- Pages
- 33-62
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2884510571
- Cited by
- 310
- References
- 43
- FWCI
- 7.59
- 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.