research-article

FAME: Fast Attribute-based Message Encryption

Authors:

Shashank Agrawal,

Melissa ChaseAuthors Info & Claims

CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

Pages 665 - 682

https://doi.org/10.1145/3133956.3134014

Published: 30 October 2017 Publication History

Abstract

Time and again, attribute-based encryption has been shown to be the natural cryptographic tool for building various types of conditional access systems with far-reaching applications, but the deployment of such systems has been very slow. A central issue is the lack of an encryption scheme that can operate on sensitive data very efficiently and, at the same time, provides features that are important in practice.

This paper proposes the first fully secure ciphertext-policy and key-policy ABE schemes based on a standard assumption on Type-III pairing groups, which do not put any restriction on policy type or attributes. We implement our schemes along with several other prominent ones using the Charm library, and demonstrate that they perform better on almost all parameters of interest.

References

[1]

Masayuki Abe, Jens Groth, Miyako Ohkubo, and Takeya Tango. 2014. Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups CRYPTO 2014, Part I (LNCS), Juan A. Garay and Rosario Gennaro (Eds.), Vol. Vol. 8616. Springer, Heidelberg, 241--260. https://doi.org/10.1007/978-3-662-44371-2_14

[2]

Shashank Agrawal and Melissa Chase 2016. A Study of Pair Encodings: Predicate Encryption in Prime Order Groups TCC 2016-A, Part II (LNCS), Eyal Kushilevitz and Tal Malkin (Eds.), Vol. Vol. 9563. Springer, Heidelberg, 259--288. https://doi.org/10.1007/978-3-662-49099-0_10

[3]

Shashank Agrawal and Melissa Chase 2017. Simplifying Design and Analysis of Complex Predicate Encryption Schemes EUROCRYPT 2017, Part I (LNCS), Jean-Sébastien Coron and Jesper Buus Nielsen (Eds.), Vol. Vol. 10210. Springer, Heidelberg, 627--656.

[4]

Joseph A. Akinyele, Christina Garman, and Susan Hohenberger 2015. Automating Fast and Secure Translations from Type-I to Type-III Pairing Schemes ACM CCS 15, Indrajit Ray, Ninghui Li, and Christopher Kruegel: (Eds.). ACM Press, 1370--1381.

[5]

Joseph A. Akinyele, Christina Garman, Ian Miers, Matthew W. Pagano, Michael Rushanan, Matthew Green, and Aviel D. Rubin. 2013. Charm: a framework for rapidly prototyping cryptosystems. Journal of Cryptographic Engineering (2013), 111--128.

[6]

Joseph A. Akinyele, Matthew Green, and Susan Hohenberger. 2013. Using SMT solvers to automate design tasks for encryption and signature schemes ACM CCS 13, Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung (Eds.). ACM Press, 399--410.

[7]

Joseph A. Akinyele, Matthew W. Pagano, Matthew D. Green, Christoph U. Lehmann, Zachary N. J. Peterson, and Aviel D. Rubin. 2011. Securing electronic medical records using attribute-based encryption on mobile devices SPSM '11. 75--86.

[8]

Nuttapong Attrapadung. 2014. Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More EUROCRYPT 2014 (LNCS), Phong Q. Nguyen and Elisabeth Oswald (Eds.), Vol. Vol. 8441. Springer, Heidelberg, 557--577. https://doi.org/10.1007/978-3-642-55220-5_31

[9]

Nuttapong Attrapadung. 2016. Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings ASIACRYPT 2016, Part II (LNCS), Jung Hee Cheon and Tsuyoshi Takagi (Eds.), Vol. Vol. 10032. Springer, Heidelberg, 591--623. https://doi.org/10.1007/978-3-662-53890-6_20

Digital Library

[10]

Randolph Baden, Adam Bender, Neil Spring, Bobby Bhattacharjee, and Daniel Starin. 2009. Persona: an online social network with user-defined privacy ACM SIGCOMM 2009. 135--146.

[11]

Amos Beimel. 2011. Secret-Sharing Schemes: A Survey. Coding and Cryptology. 11--46.

[12]

Mihir Bellare and Phillip Rogaway 1993. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols ACM CCS 93, V. Ashby (Ed.). ACM Press, 62--73.

Digital Library

[13]

Mihir Bellare and Phillip Rogaway 1995. Optimal Asymmetric Encryption. In EUROCRYPT'94 (LNCS), Alfredo De Santis (Ed.), Vol. Vol. 950. Springer, Heidelberg, 92--111.

[14]

John Bethencourt, Amit Sahai, and Brent Waters. 2007. Ciphertext-Policy Attribute-Based Encryption. In 2007 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 321--334.

Digital Library

[15]

Dan Boneh, Xavier Boyen, and Hovav Shacham 2004. Short Group Signatures. In CRYPTO 2004 (LNCS), Matthew Franklin (Ed.), Vol. Vol. 3152. Springer, Heidelberg, 41--55.

[16]

Jan Camenisch, Maria Dubovitskaya, Robert R. Enderlein, and Gregory Neven 2012. Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption SCN 12 (LNCS), Ivan Visconti and Roberto De Prisco (Eds.), Vol. Vol. 7485. Springer, Heidelberg, 559--579.

[17]

Jie Chen, Romain Gay, and Hoeteck Wee 2015. Improved Dual System ABE in Prime-Order Groups via Predicate Encodings EUROCRYPT 2015, Part II (LNCS), Elisabeth Oswald and Marc Fischlin (Eds.), Vol. Vol. 9057. Springer, Heidelberg, 595--624. https://doi.org/10.1007/978-3-662-46803-6_20

[18]

Jie Chen, Romain Gay, and Hoeteck Wee 2015. Improved Dual System ABE in Prime-Order Groups via Predicate Encodings. Cryptology ePrint Archive, Report 2015/409. (2015). http://eprint.iacr.org/2015/409.

[19]

Jie Chen and Hoeteck Wee 2013. Fully, (Almost) Tightly Secure IBE and Dual System Groups CRYPTO 2013, Part II (LNCS), Ran Canetti and Juan A. Garay (Eds.), Vol. Vol. 8043. Springer, Heidelberg, 435--460. https://doi.org/10.1007/978-3-642-40084-1_25

[20]

Alex Escala, Gottfried Herold, Eike Kiltz, Carla Ràfols, and Jorge Villar 2013. An Algebraic Framework for Diffie-Hellman Assumptions CRYPTO 2013, Part II (LNCS), Ran Canetti and Juan A. Garay (Eds.), Vol. Vol. 8043. Springer, Heidelberg, 129--147. https://doi.org/10.1007/978-3-642-40084-1_8

[21]

David Mandell Freeman. 2010. Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups EUROCRYPT 2010 (LNCS), Henri Gilbert (Ed.), Vol. Vol. 6110. Springer, Heidelberg, 44--61.

[22]

Steven Galbraith. 2014. New discrete logarithm records, and the death of Type 1 pairings. https://ellipticnews.wordpress.com/2014/02/01/new-discrete-logarithm-records-and-the-death-of-type-1-pairings/. (2014).

[23]

Steven D. Galbraith, Kenneth G. Paterson, and Nigel P. Smart 2008. Pairings for cryptographers. Discrete Applied Mathematics (2008), 3113--3121.

Digital Library

[24]

Essam Ghadafi, Nigel P. Smart, and Bogdan Warinschi. 2010. Groth-Sahai Proofs Revisited. In PKC 2010 (LNCS), bibfieldeditorPhong Q. Nguyen and David Pointcheval (Eds.), Vol. Vol. 6056. Springer, Heidelberg, 177--192.

Digital Library

[25]

Vipul Goyal, Abhishek Jain, Omkant Pandey, and Amit Sahai. 2008. Bounded Ciphertext Policy Attribute Based Encryption ICALP 2008, Part II (LNCS), Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, and Igor Walukiewicz (Eds.), Vol. Vol. 5126. Springer, Heidelberg, 579--591.

[26]

Vipul Goyal, Omkant Pandey, Amit Sahai, and Brent Waters. 2006. Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data ACM CCS 06, Ari Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati (Eds.). ACM Press, 89--98. Available as Cryptology ePrint Archive Report 2006/309.

[27]

Vipul Goyal, Omkant Pandey, Amit Sahai, and Brent Waters. 2006. Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data. Cryptology ePrint Archive, Report 2006/309. (2006). shownotehttp://eprint.iacr.org/2006/309.

[28]

Matthew Green and Susan Hohenberger 2008. Universally Composable Adaptive Oblivious Transfer ASIACRYPT 2008 (LNCS), Josef Pieprzyk (Ed.), Vol. Vol. 5350. Springer, Heidelberg, 179--197.

[29]

Matthew Green, Susan Hohenberger, and Brent Waters. 2011. Outsourcing the Decryption of ABE Ciphertexts. In USENIX Security Symposium 2011. 34--34.

[30]

Matthew D. Green and Ian Miers 2015. Forward Secure Asynchronous Messaging from Puncturable Encryption 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 305--320. https://doi.org/10.1109/SP.2015.26

Digital Library

[31]

Aurore Guillevic. 2013. Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves ACNS 13 (LNCS), bibfieldeditorMichael J. Jacobson Jr., Michael E. Locasto, Payman Mohassel, and Reihaneh Safavi-Naini (Eds.), Vol. Vol. 7954. Springer, Heidelberg, 357--372. https://doi.org/10.1007/978-3-642-38980-1_22

Digital Library

[32]

Aurore Guillevic, Franc cois Morain, and Emmanuel Thomé. 2016. Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. Cryptology ePrint Archive, Report 2016/507. (2016). http://eprint.iacr.org/2016/507.

[33]

Gottfried Herold, Julia Hesse, Dennis Hofheinz, Carla Ràfols, and Andy Rupp. 2014. Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations CRYPTO 2014, Part I (LNCS), Juan A. Garay and Rosario Gennaro (Eds.), Vol. Vol. 8616. Springer, Heidelberg, 261--279. https://doi.org/10.1007/978--3--662--44371--2_15

[34]

Susan Hohenberger and Brent Waters 2013. Attribute-Based Encryption with Fast Decryption. PKC 2013 (LNCS), Kaoru Kurosawa and Goichiro Hanaoka (Eds.), Vol. Vol. 7778. Springer, Heidelberg, 162--179. https://doi.org/10.1007/978-3-642-36362-7_11

[35]

Antoine Joux. 2014. SAC 2013. Chapter A New Index Calculus Algorithm with Complexity L(1/4 o(1)) in Small Characteristic, 355--379.

[36]

Jonathan Katz, Amit Sahai, and Brent Waters. 2008. Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products EUROCRYPT 2008 (LNCS), Nigel P. Smart (Ed.), Vol. Vol. 4965. Springer, Heidelberg, 146--162.

[37]

Taechan Kim and Razvan Barbulescu 2016. Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case CRYPTO 2016, Part I (LNCS), Matthew Robshaw and Jonathan Katz (Eds.), Vol. Vol. 9814. Springer, Heidelberg, 543--571. https://doi.org/10.1007/978-3-662-53018-4_20

Digital Library

[38]

Lucas Kowalczyk and Allison Bishop Lewko 2015. Bilinear Entropy Expansion from the Decisional Linear Assumption CRYPTO 2015, Part II (LNCS), Rosario Gennaro and Matthew J. B. Robshaw (Eds.), Vol. Vol. 9216. Springer, Heidelberg, 524--541. https://doi.org/10.1007/978-3-662-48000-7_26

Digital Library

[39]

Allison B. Lewko. 2012. Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting EUROCRYPT 2012 (LNCS), David Pointcheval and Thomas Johansson (Eds.), Vol. Vol. 7237. Springer, Heidelberg, 318--335.

[40]

Allison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, and Brent Waters. 2010. Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption. In EUROCRYPT 2010 (LNCS), Henri Gilbert (Ed.), Vol. Vol. 6110. Springer, Heidelberg, 62--91.

[41]

Allison B. Lewko, Amit Sahai, and Brent Waters. 2010. Revocation Systems with Very Small Private Keys. 2010 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 273--285.

Digital Library

[42]

Allison B. Lewko and Brent Waters 2011. Unbounded HIBE and Attribute-Based Encryption. EUROCRYPT 2011 (LNCS), Kenneth G. Paterson (Ed.), Vol. Vol. 6632. Springer, Heidelberg, 547--567.

[43]

Benoît Libert, Thomas Peters, Marc Joye, and Moti Yung. 2015. Compactly Hiding Linear Spans - Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications. In ASIACRYPT 2015, Part I (LNCS), Tetsu Iwata and Jung Hee Cheon (Eds.), Vol. Vol. 9452. Springer, Heidelberg, 681--707. https://doi.org/10.1007/978-3-662-48797-6_28

Digital Library

[44]

Tatsuaki Okamoto and Katsuyuki Takashima 2010. Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption CRYPTO 2010 (LNCS), Tal Rabin (Ed.), Vol. Vol. 6223. Springer, Heidelberg, 191--208.

[45]

Tatsuaki Okamoto and Katsuyuki Takashima 2012. Fully Secure Unbounded Inner-Product and Attribute-Based Encryption ASIACRYPT 2012 (LNCS), Xiaoyun Wang and Kazue Sako (Eds.), Vol. Vol. 7658. Springer, Heidelberg, 349--366. https://doi.org/10.1007/978-3-642-34961-4_22

Digital Library

[46]

Rafail Ostrovsky, Amit Sahai, and Brent Waters. 2007. Attribute-based encryption with non-monotonic access structures ACM CCS 07, bibfieldeditorPeng Ning, Sabrina De Capitani di Vimercati, and Paul F. Syverson (Eds.). ACM Press, 195--203.

[47]

Bryan Parno, Mariana Raykova, and Vinod Vaikuntanathan. 2012. How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption TCC 2012 (LNCS), Ronald Cramer (Ed.), Vol. Vol. 7194. Springer, Heidelberg, 422--439.

[48]

Yannis Rouselakis and Brent Waters 2013. Practical constructions and new proof methods for large universe attribute-based encryption ACM CCS 13, Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung (Eds.). ACM Press, 463--474.

[49]

Yannis Rouselakis and Brent Waters 2015. Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption FC 2015 (LNCS), bibfieldeditorRainer Böhme and Tatsuaki Okamoto (Eds.), Vol. Vol. 8975. Springer, Heidelberg, 315--332. https://doi.org/10.1007/978-3-662-47854-7_19

[50]

Amit Sahai and Brent R. Waters 2005. Fuzzy Identity-Based Encryption. In EUROCRYPT 2005 (LNCS), Ronald Cramer (Ed.), Vol. Vol. 3494. Springer, Heidelberg, 457--473.

Digital Library

[51]

Nuno Santos, Rodrigo Rodrigues, Krishna P. Gummadi, and Stefan Saroiu 2012. Policy-Sealed Data: A New Abstraction for Building Trusted Cloud Services USENIX Security Symposium 2012. 175--188.

[52]

Hovav Shacham. 2007. A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants. Cryptology ePrint Archive, Report 2007/074. (2007). http://eprint.iacr.org/2007/074.

[53]

Patrick Traynor, Kevin R. B. Butler, William Enck, and Patrick McDaniel 2008. Realizing Massive-Scale Conditional Access Systems Through Attribute-Based Cryptosystems NDSS 2008. The Internet Society.

[54]

Brent Waters. 2009. Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions CRYPTO 2009 (LNCS), Shai Halevi (Ed.), Vol. Vol. 5677. Springer, Heidelberg, 619--636.

[55]

Brent Waters. 2011. Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization. In PKC 2011 (LNCS), Dario Catalano, Nelly Fazio, Rosario Gennaro, and Antonio Nicolosi (Eds.), Vol. Vol. 6571. Springer, Heidelberg, 53--70.

[56]

Hoeteck Wee. 2014. Dual System Encryption via Predicate Encodings. In TCC 2014 (LNCS), Yehuda Lindell (Ed.), Vol. Vol. 8349. Springer, Heidelberg, 616--637. https://doi.org/10.1007/978-3-642-54242-8_26

[57]

Bo Yang, Kang Yang, Yu Qin, Zhenfeng Zhang, and Dengguo Feng 2015. DAA-TZ: An Efficient DAA Scheme for Mobile Devices Using ARM TrustZone. Springer International Publishing, Cham, 209--227. https://doi.org/10.1007/978-3-319-22846-4_13

Cited By

Chen MXie GPan BFang JXu ZZhao Z(2025)Building Traceable Redactable Blockchain with Time-Verifiable Chameleon HashElectronics10.3390/electronics1405084614:5(846)Online publication date: 21-Feb-2025
https://doi.org/10.3390/electronics14050846
Zheng KZhou ZLiu JYu B(2025)Secure Fine-Grained Multi-Keyword Ciphertext Search Supporting Cloud-Edge-End Collaboration in IoTChinese Journal of Electronics10.23919/cje.2023.00.24434:1(266-281)Online publication date: Jan-2025
https://doi.org/10.23919/cje.2023.00.244
Xu WMa HZhang RLi J(2025)GPABE: GPU-Based Parallelization Framework for Attribute-Based Encryption SchemesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2025.352977636:3(520-536)Online publication date: Mar-2025
https://doi.org/10.1109/TPDS.2025.3529776
Show More Cited By

Index Terms

FAME: Fast Attribute-based Message Encryption
1. Security and privacy
  1. Cryptography
    1. Public key (asymmetric) techniques
      1. Public key encryption

Recommendations

Fully Secure ABE with Outsourced Decryption against Chosen Ciphertext Attack
Information Security and Cryptology
Abstract
Attribute-based encryption (ABE) provides fine-grained access control on encrypted data, but it is not suitable for limited-resource devices due to the inefficiency of decryption. To solve this problem, Green et al. proposed a new paradigm named ...
Fully secure bandwidth-efficient anonymous ciphertext-policy attribute-based encryption

The functionality of ciphertext-policy attribute-based encryption CP-ABE enables the encryptor to encrypt the data for a group of users of his choice by incorporating an access policy over target receivers' attributes into encryption algorithm itself. ...
Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES

Verifiably encrypted signatures (VES) are encrypted signatures under a public key of a trusted third party. We can verify their validity without decryption. VES has useful applications such as online contract signing and optimistic fair exchange. We ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

October 2017

2682 pages

ISBN:9781450349468

DOI:10.1145/3133956

General Chair:
Bhavani Thuraisingham
The University of Texas at Dallas, USA
,
Program Chairs:
David Evans
University of Virginia
,
Tal Malkin
Columbia University
,
Dongyan Xu
Purdue University

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 October 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CCS '17

Sponsor:

SIGSAC

CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security

October 30 - November 3, 2017

Texas, Dallas, USA

Acceptance Rates

CCS '17 Paper Acceptance Rate 151 of 836 submissions, 18%;

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

161
Total Citations
View Citations
1,260
Total Downloads

Downloads (Last 12 months)166
Downloads (Last 6 weeks)16

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen MXie GPan BFang JXu ZZhao Z(2025)Building Traceable Redactable Blockchain with Time-Verifiable Chameleon HashElectronics10.3390/electronics1405084614:5(846)Online publication date: 21-Feb-2025
https://doi.org/10.3390/electronics14050846
Zheng KZhou ZLiu JYu B(2025)Secure Fine-Grained Multi-Keyword Ciphertext Search Supporting Cloud-Edge-End Collaboration in IoTChinese Journal of Electronics10.23919/cje.2023.00.24434:1(266-281)Online publication date: Jan-2025
https://doi.org/10.23919/cje.2023.00.244
Xu WMa HZhang RLi J(2025)GPABE: GPU-Based Parallelization Framework for Attribute-Based Encryption SchemesIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2025.352977636:3(520-536)Online publication date: Mar-2025
https://doi.org/10.1109/TPDS.2025.3529776
Wang WPeng HDuan JWang LHu XZhao Z(2025)Resilient and Redactable Blockchain With Two-Level Rewriting and Version DetectionIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.352083020(1163-1175)Online publication date: 2025
https://doi.org/10.1109/TIFS.2024.3520830
Yu AKang JJiang WLin D(2025)Highly Efficient and Scalable Access Control Mechanism for IoT Devices in Pervasive EnvironmentsIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.339226222:1(234-245)Online publication date: Jan-2025
https://doi.org/10.1109/TDSC.2024.3392262
Li JZhang EHan JZhang YShen J(2025)PH-MG-ABE: A Flexible Policy-Hidden Multigroup Attribute-Based Encryption Scheme for Secure Cloud StorageIEEE Internet of Things Journal10.1109/JIOT.2024.346801812:2(2146-2157)Online publication date: 15-Jan-2025
https://doi.org/10.1109/JIOT.2024.3468018
Le HLe PTrinh SSusilo WTrinh V(2025)Levelled attribute-based encryption for hierarchical access controlComputer Standards & Interfaces10.1016/j.csi.2024.10395793(103957)Online publication date: Apr-2025
https://doi.org/10.1016/j.csi.2024.103957
Lu JHu CXiang TLi WYu J(2025)VOABE: An Efficient Verifiable Outsourced Attribute-Based Encryption for Healthcare SystemsComputing and Combinatorics10.1007/978-981-96-1093-8_1(3-14)Online publication date: 20-Feb-2025
https://doi.org/10.1007/978-981-96-1093-8_1
Hsu CLin LLin WHsu T(2024)Secure Digital Rights Management in Gamified Personal Health Promotion Applications Using Attribute-Based EncryptionElectronics10.3390/electronics1324490913:24(4909)Online publication date: 12-Dec-2024
https://doi.org/10.3390/electronics13244909
Li YXiong MYuan JZhang QZhu H(2024)A Secure Data-Sharing Model Resisting Keyword Guessing Attacks in Edge–Cloud Collaboration ScenariosElectronics10.3390/electronics1316323613:16(3236)Online publication date: 15-Aug-2024
https://doi.org/10.3390/electronics13163236
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten