The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Simple Functional Encryption Schemes for Inner Products
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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 1×
“To start, please notice that a ciphertext for a vector x consists of ElGamal ciphertexts [ElG84] ( g r , ( h ri · g x i ) i ) under public keys h i = g s i , sharing the same randomness r .”
BackgroundIdentity-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
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
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
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060603 · Cited by 2,313
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Reyzin, L., & Smith, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_31 · Cited by 2,038
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
ElGamal, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_2 · Cited by 1,604
Conjunctive, Subset, and Range Queries on Encrypted Data
Boneh, D., & Waters, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_29 · Cited by 1,432
Lewko, A., Okamoto, T., Sahai, A., Takashima, K., & Waters, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_4 · Cited by 1,313
(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,234
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
An Identity Based Encryption Scheme Based on Quadratic Residues
Cocks, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45325-3_32 · Cited by 1,102
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
Functional Encryption: Definitions and Challenges
Boneh, D., Sahai, A., & Waters, B. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19571-6_16 · Cited by 1,010
(2005) · Codes · doi:10.1201/9781420035087-10 · Cited by 913
Practical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
Bellare, M., & Rogaway, P. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_25 · Cited by 672
BiTR: Built-in Tamper Resilience
Choi, S. G., Kiayias, A., & Malkin, T. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_40 · Cited by 590
Horadam, K. (2003) · Lecture notes in computer science · doi:10.1007/b93924 · Cited by 524
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
Advances in Cryptology - Eurocrypt 2006
Serge Vaudenay, B. (2008) · Cited by 514
(2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5 · Cited by 500
More Efficient Constant-Round Multi-party Computation from BMR and SHE
Lindell, Y., Smart, N. P., & Soria-Vazquez, E. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53641-4_21 · Cited by 360
(2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5 · Cited by 223
Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation
Boldyreva, A., Degabriele, J. P., Paterson, K. G., & Stam, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_40 · Cited by 212
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
Okamoto, T., & Takashima, K. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_35 · Cited by 195
Functional Encryption for Regular Languages
Waters, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_14 · Cited by 169
Randomness Re-use in Multi-recipient Encryption Schemeas
Bellare, M., Boldyreva, A., & Staddon, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_7 · Cited by 143
Abdalla, M. F., Bellare, M., & Neven, G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11799-2_28 · Cited by 139
Self-citationHomomorphic Encryption: From Private-Key to Public-Key
Rothblum, R. D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19571-6_14 · Cited by 89
Bellare, M., & O’Neill, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-319-02937-5_12 · Cited by 65
Fully Secure Attribute Based Encryption from Multilinear Maps.Preprint
Garg, S., Gentry, C., Halevi, S., & Zhandry, M. (2014) · IACR Cryptology ePrint Archive · Cited by 46
Bounded-Collusion IBE from Key Homomorphism
Goldwasser, S., Lewko, A. B., & Wilson, D. A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_32 · Cited by 28
Tessaro, S., & Wilson, D. A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54631-0_15 · Cited by 17
Cited by
Fast Homomorphic Evaluation of Deep Discretized Neural Networks
Bourse, F., Minelli, M., Minihold, M., & Paillier, P. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-96878-0_17 · Cited by 300
Self-citationFully Secure Functional Encryption for Inner Products, from Standard Assumptions
Agrawal, S., Libert, B., & Stehlé, D. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53015-3_12 · Cited by 293
Dynamic Decentralized Functional Encryption
Chotard, J., Dufour-Sans, E., Gay, R., Phan, D. H., & Pointcheval, D. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56784-2_25 · Cited by 54
Self-citation
Metadata
- Authors
- Abdalla, M., Bourse, F., De Caro, A., & Pointcheval, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2015
- Pages
- 733-751
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W209244779
- Cited by
- 379
- References
- 36
- FWCI
- 11.17
- 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.