The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Attribute-based encryption for circuits
Abstract
In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an l-bit public index pind and a message m, and a secret key is associated with a Boolean predicate P. The secret key allows to decrypt the ciphertext and learn m iff P(pind) = 1. Moreover, the scheme should be secure against collusions of users, namely, given secret keys for polynomially many predicates, an adversary learns nothing about the message if none of the secret keys can individually decrypt the ciphertext.
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
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
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 · cited 1×
“This construction forms the cornerstone of the subsequent work of Goldwasser, Kalai, Popa, Vaikuntanathan and Zeldovich [24] who construct reusable garbled circuits with input and circuit privacy, by additionally leveraging the power of fully homomorphic encryption [14, 22].”
MethodIdentity-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
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
Self-citationOn lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
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
Divertible protocols and atomic proxy cryptography
Blaze, M., Bleumer, G., & Strauss, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054122 · Cited by 1,582
Improved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475 · cited 2×
“Our primitive (TOR) can be thought of as a generalization of the notion of proxy re-encryption [7, 9, 28] which can be thought of as a one-to-one re-encryption mechanism.”
BackgroundEfficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
Self-citationLewko, 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
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Micciancio, D., & Peikert, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_41 · Cited by 1,224
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,145
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
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
Efficient Lattice (H)IBE in the Standard Model
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_28 · Cited by 976
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_36 · Cited by 919
Outsourcing the decryption of abe ciphertexts
Green, M., Hohenberger, S., & Waters, B. R. (2011) · Cited by 900
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Peikert, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536461 · Cited by 813
A sieve algorithm for the shortest lattice vector problem
Ajtai, M., Kumar, R., & Sivakumar, D. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380857 · Cited by 558
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
Lewko, A., & Waters, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11799-2_27 · Cited by 556
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
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
Okamoto, T., & Takashima, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_11 · Cited by 507
Delegating computation: interactive proofs for muggles
Goldwasser, S., Kalai, Y. T., & Rothblum, G. N. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374396 · Cited by 484
Reusable garbled circuits and succinct functional encryption
Goldwasser, S., Kalai, Y., Popa, R. A., Vaikuntanathan, V., & Zeldovich, N. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488678 · Cited by 457
Self-citationMicali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_6 · Cited by 416
Improved Delegation of Computation Using Fully Homomorphic Encryption
Chung, K.-M., Kalai, Y., & Vadhan, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_26 · Cited by 403
Generating Hard Instances of the Short Basis Problem
Ajtai, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48523-6_1 · Cited by 396
Lewko, A., & Waters, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_12 · Cited by 371
How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
Parno, B., Raykova, M., & Vaikuntanathan, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-28914-9_24 · Cited by 355
Self-citationFaster Fully Homomorphic Encryption
Stehlé, D., & Steinfeld, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_22 · Cited by 330
Attribute-Based Encryption for Circuits from Multilinear Maps
Garg, S., Gentry, C., Halevi, S., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_27 · Cited by 328
Bonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2012) · Journal of Cryptology · doi:10.1007/s00145-011-9105-2 · Cited by 297
Functional Encryption with Bounded Collusions via Multi-party Computation
Gorbunov, S., Vaikuntanathan, V., & Wee, H. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_11 · Cited by 294
Self-citationFunctional Encryption for Inner Product Predicates from Learning with Errors
Agrawal, S., Freeman, D. M., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_2 · Cited by 239
Self-citationMicciancio, D., & Voulgaris, P. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806739 · Cited by 226
From Secrecy to Soundness: Efficient Verification via Secure Computation: (Extended Abstract)
Applebaum, B., Ishai, Y., & Kushilevitz, E. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14165-2_14 · Cited by 198
Attribute-Based Functional Encryption on Lattices
Boyen, X. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36594-2_8 · Cited by 179
Worry-free encryption: functional encryption with public keys
Sahai, A., & Seyalioglu, H. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866359 · Cited by 177
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
Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
Agrawal, S., Boyen, X., Vaikuntanathan, V., Voulgaris, P., & Wee, H. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30057-8_17 · Cited by 151
Self-citationSecurely Obfuscating Re-Encryption
Hohenberger, S., Rothblum, G. N., Shelat, A. A., & Vaikuntanathan, V. (2010) · Journal of Cryptology · doi:10.1007/s00145-010-9077-7 · Cited by 67
Self-citation
Cited by
Gentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492
Security and Privacy on Blockchain
Zhang, R., Xue, R., & Liu, L. (2020) · ACM Computing Surveys · doi:10.1145/3316481 · Cited by 959
Lattice Signatures and Bimodal Gaussians
Ducas, L., Durmus, A., Lepoint, T., & Lyubashevsky, V. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_3 · Cited by 557
A Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and TrendsŴ in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 504
Reusable garbled circuits and succinct functional encryption
Goldwasser, S., Kalai, Y., Popa, R. A., Vaikuntanathan, V., & Zeldovich, N. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488678 · Cited by 457
Self-citation
Metadata
- Authors
- Gorbunov, S., Vaikuntanathan, V., & Wee, H.
- Venue
- Proceedings of the forty-fifth annual ACM symposium on Theory of Computing
- Publisher
- ACM
- Published
- 2013-06
- Pages
- 545-554
- OpenAlex
- W2008701790
- Cited by
- 406
- References
- 44
- FWCI
- 36.64
- 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.