The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Revocation Systems with Very Small Private Keys
Abstract
In this work, we design a method for creating public key broadcast encryption systems. Our main technical innovation is based on a new "two equation" technique for revoking users. This technique results in two key contributions: First, our new scheme has ciphertext size overhead O(r), where r is the number of revoked users, and the size of public and private keys is only a constant number of group elements from an elliptic-curve group of prime order. In addition, the public key allows us to encrypt to an unbounded number of users. Our system is the first to achieve such parameters. We give two versions of our scheme: a simpler version which we prove to be selectively secure in the standard model under a new, but non-interactive assumption, and another version that employs the new dual system encryption technique of Waters to obtain adaptive security under the d-BDH and decisional Linear assumptions. Second, we show that our techniques can be used to realize Attribute-Based Encryption (ABE) systems with nonmonotonic access formulas, where our key storage is significantly more efficient than previous solutions. This result is also proven selectively secure in the standard model under our new non-interactive assumption.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Self-citationFuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Self-citationEfficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
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
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_26 · Cited by 1,334
Revocation and Tracing Schemes for Stateless Receivers
Naor, D., Naor, M., & Lotspiech, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_3 · Cited by 1,118
Multi-authority Attribute Based Encryption
Chase, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_28 · Cited by 1,112
Attribute-based encryption with non-monotonic access structures
Ostrovsky, R., Sahai, A., & Waters, B. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315270 · Cited by 1,059
Self-citationCollusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Boneh, D., Gentry, C., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_16 · Cited by 1,047
Self-citationA One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722028_23 · Cited by 1,039
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
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
Secure schemes for secret sharing and key distribution
Beimel, A. (1996) · Medical Entomology and Zoology · Cited by 779
Key establishment in large dynamic groups using one-way function trees
Sherman, A. T., & McGrew, D. A. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1199073 · Cited by 713
A Forward-Secure Public-Key Encryption Scheme
Canetti, R., Halevi, S., & Katz, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_16 · Cited by 701
(2016) · Elsevier eBooks · doi:10.1016/c2013-0-19116-7 · Cited by 689
Bounded Ciphertext Policy Attribute Based Encryption
Goyal, V., Jain, A., Pandey, O., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_47 · Cited by 544
Self-citationCamenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
The LSD Broadcast Encryption Scheme
Halevy, D., & Shamir, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_4 · Cited by 411
Problems and Theorems in Linear Algebra
Prasolov, V. (1994) · Translations of Mathematical Monographs · doi:10.1090/mmono/134 · Cited by 359
Efficient Trace and Revoke Schemes
Naor, M., & Pinkas, B. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_1 · Cited by 298
Controlling Access to Published Data Using Cryptography
Miklau, G., & Suciu, D. (2003) · Proceedings 2003 VLDB Conference · doi:10.1016/b978-012722442-8/50084-7 · Cited by 289
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
Stinson, D. R., & Wei, R. (1998) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480196304246 · Cited by 275
Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups
Joux, A., & Nguyen, K. (2003) · Journal of Cryptology · doi:10.1007/s00145-003-0052-4 · Cited by 239
Optimum traitor tracing and asymmetric schemes
Kurosawa, K., & Desmedt, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054123 · Cited by 170
On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
Stinson, D. R. (1997) · Designs, Codes and Cryptography · doi:10.1023/a:1008268610932 · Cited by 166
Concealing complex policies with hidden credentials
Bradshaw, R. W., Holt, J. E., & Seamons, K. E. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030104 · Cited by 166
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups.
Joux, A., & Nguyen, K. T. (2001) · Cited by 143
Long-Lived Broadcast Encryption
Garay, J. A., Staddon, J., & Wool, A. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_21 · Cited by 136
Some New Results on Key Distribution Patterns and Broadcast Encryption
Stinson, D. R., & van Trung, T. (1998) · Designs Codes and Cryptography · doi:10.1023/a:1008209004667 · Cited by 115
Access Control Using Pairing Based Cryptography
Smart, N. P. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36563-x_8 · Cited by 86
Escrow-free encryption supporting cryptographic workflow
Al-Riyami, S. S., Malone-Lee, J., & Smart, N. P. (2006) · International Journal of Information Security · doi:10.1007/s10207-006-0002-x · Cited by 40
Policy-based encryption schemes from bilinear pairings
Bagga, W., Molva, R. A., & Crosta, S. (2006) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1128817.1128886 · Cited by 20
Secure Cryptographic Workflow in the Standard Model
Barbosa, M., & Farshim, P. (2006) · Lecture notes in computer science · doi:10.1007/11941378_27 · Cited by 19
Cited by
Charm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
Data security and privacy-preserving in edge computing paradigm: survey and open issues
Zhang, J., Chen, B., Zhao, Y., Cheng, X., & Hu, F. (2018) · IEEE Access · doi:10.1109/access.2018.2820162 · Cited by 514
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts
Attrapadung, N., Libert, B., & de Panafieu, E. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_6 · Cited by 377
Security and privacy protection in cloud computing: Discussions and challenges
Sun, P. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102642 · Cited by 287
Improving Security and Efficiency in Attribute-Based Data Sharing
Hur, J. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.78 · Cited by 259
Metadata
- Authors
- Lewko, A., Sahai, A., & Waters, B.
- Venue
- 2010 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2010
- Pages
- 273-285
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2087000693
- Cited by
- 260
- References
- 35
- FWCI
- 15.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.