Granted Patent
B1
US 12,284,227 · App. 17/721,011 · Granted Apr 22, 2025
Scalable auditability of monitoring
Inventors:
Gaurav Panwar (Las Cruces, NM); Roopa Vishwanathan (Las Cruces, NM); Satyajayant Misra (Las Cruces, NM)
Assignee:
Arrowhead Center, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Abstract
Secure auditability of monitoring processing using public ledgers that are particularly useful for monitoring surveillance orders, whereby an overseeing enforcer (“E”) checks if law enforcement agencies and companies are respectively over-requesting or over-sharing user data beyond what is permitted by the surveillance order, in a privacy-preserving way, such that E does not know the real identities of the users being surveilled, nor does E get to read the users' unencrypted data. Embodiments of the present invention also have inbuilt checks and balances to require unsealing of surveillance orders at the appropriate times, thus enabling accounting of the surveillance operation to verify that lawful procedures were followed, protecting users from government overreach, and helping law enforcement agencies and companies demonstrate that they followed the rule of law.
Claims (29)
1. A method for ensuring compliance and accountability between parties of a transaction implemented by a hardware processor and memory comprising:
entering encrypted indicia into a ledger wherein entering is based on an authorization from an individual and the indicia comprises a scope of the authorization for data held by a data holder;
receiving, from a requesting party, a request for the data;
the data holder providing encrypted data in response to the request for the data, wherein hashes of individual pieces of the encrypted data are stored at each leaf of one or more Merkle tree, and wherein each root of the one or more Merkle tree is signed by a single data owner with a transient signing key; and
a part of the authorization for data accessible to the enforcer includes a verification key that is used by the enforcer to determine whether the provided data is within a scope of the authorization without decrypting the encrypted data and forwarding the encrypted data to the requesting party if the encrypted data does not exceed the scope of the authorization.
2. The method of claim 1 wherein the request for data comprises a surveillance order.
3. The method of claim 1 wherein entering encrypted indicia into a ledger comprises entering encrypted indicia onto a blockchain.
4. The method of claim 1 wherein the enforcer enters information into the ledger when the requesting party requests data beyond the scope of the authorization.
5. The method of claim 1 wherein the enforcer enters information into the ledger when the data holder provides data beyond the scope of the authorization.
6. The method of claim 1 further comprising the data holder providing the requesting party with a key for decrypting the encrypted data.
7. The method of claim 1 wherein the authorization comprises a search order in accordance with a national security letter.
8. The method of claim 7 wherein the search order is posted to the public ledger by the requesting party.
9. The method of claim 1 wherein the authorization comprises a request for confidential information.
10. The method of claim 1 wherein receiving, from a requesting party, a request for the data comprises receiving, from a requesting party, a request for IP addresses.
11. The method of claim 1 wherein receiving, from a requesting party, a request for the data comprises receiving, from a requesting party, a request for searchable encrypted data.
12. The method of claim 1 wherein receiving, from a requesting party, a request for the data comprises receiving, from a requesting party, a request for emails.
13. The method of claim 12 wherein the emails are grouped and encrypted into batches of emails.
14. The method of claim 13 further comprising signing with the signing key to preserve privacy of the data owner and wherein a corresponding verification key is tied to a real identity known only to the data owner and the requesting party.
15. A method for ensuring compliance and accountability between parties of a transaction implemented by a hardware processor and memory comprising:
entering encrypted indicia into a ledger wherein entering is based on an authorization from an individual or an agency and the indicia comprises a scope of requested data held by a data holder;
receiving, from a requesting party, a request for the data;
the data holder providing encrypted data in response to the request for the data;
storing hashes of individual pieces of the encrypted data at each leaf of one or more Merkle Tree, wherein each root of the one or more Merkle tree is signed by a single data owner with a transient signing key; and
a part of the authorization for data accessible to the enforcer includes a verification key that is used by the enforcer to determine whether the provided data is within a scope of the authorization without decrypting the encrypted data and forwarding the encrypted data to the requesting party if the encrypted data does not exceed the scope of the authorization.
16. The method of claim 15 wherein the scope of requested data comprises a data request as described in a national security letter.
17. The method of claim 15 wherein the scope of the authorization comprises a scope as approved by the United States Congress.
18. The method of claim 17 wherein the scope of the authorization comprises a scope as described in Section 505 of United States of America Patriot Act.
19. The method of claim 15 wherein the agency comprises the Federal Bureau of Investigation.
20. The method of claim 15 wherein the individual comprises an employee of the Federal Bureau of Investigation.
Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST
Recorded Apr 21, 2022
From: PANWAR, GAURAV; VISHWANATHAN, ROOPA; MISRA, SATYAJAYANT
To: ARROWHEAD CENTER, INC.
Reel/Frame 059665/0711 →
Continuity (2)
Continuation
17016139
· Sep 9, 2020
Provisional Application
62933387
· Nov 9, 2019
References Cited (223)
US 6963972B1
· Chang et al.
· 2005
[cited by applicant]
US 7508935B2
· Oommen et al.
· 2009
[cited by applicant]
US 7596692B2
· Fox et al.
· 2009
[cited by applicant]
US 7822204B2
· Yoshida et al.
· 2010
[cited by applicant]
US 8023695B2
· Rhoads
· 2011
[cited by applicant]
US 8204224B2
· Xiao et al.
· 2012
[cited by applicant]
US 8855301B2
· McGrew
· 2014
[cited by applicant]
US 9432342B1
· Kothari et al.
· 2016
[cited by applicant]
US 9774578B1
· Ateniese et al.
· 2017
[cited by applicant]
US 20010012365A1
· Gaedke et al.
· 2001
[cited by applicant]
US 20020130796A1
· Tsuchido et al.
· 2002
[cited by applicant]
US 20040137921A1
· Valloppillil et al.
· 2004
[cited by applicant]
US 20050102513A1
· Alve
· 2005
[cited by applicant]
US 20060059265A1
· Keronen
· 2006
[cited by applicant]
US 20150067055A1
· Khera et al.
· 2015
[cited by applicant]
US 20180219810A1
· Santos Ramirez
· 2018
[cited by examiner]
US 20180285479A1
· Mackay et al.
· 2018
[cited by applicant]
US 20190147431A1
· Galebach
· 2019
[cited by examiner]
US 20190188706A1
· McCurtis
· 2019
[cited by examiner]
US 20200026289A1
· Alvarez et al.
· 2020
[cited by applicant]
US 20200342427A1
· Kulinna
· 2020
[cited by examiner]
CN 107851284A
· 2018
[cited by examiner]
CN 108985100A
· 2018
[cited by examiner]
CN 110602086A
· 2019
[cited by applicant]
CN 111079191A
· 2020
[cited by applicant]
CN 112565223A
· 2021
[cited by applicant]
CN 112801664A
· 2021
[cited by examiner]
CN 113193953A
· 2021
[cited by applicant]
CN 113726520A
· 2021
[cited by applicant]
CN 114679273A
· 2022
[cited by applicant]
CN 112671535B
· 2022
[cited by applicant]
CN 116366320A
· 2023
[cited by applicant]
CN 116432192A
· 2023
[cited by applicant]
CN 116996870A
· 2023
[cited by applicant]
EP 2040453
· 2009
[cited by applicant]
JP 2007208931
· 2007
[cited by applicant]
JP 2008028806
· 2008
[cited by applicant]
JP 4912772
· 2012
[cited by applicant]
WO 2001029775
· 2001
[cited by applicant]
WO WO2016131575A1
· 2016
[cited by examiner]
WO 2018020375A1
· 2018
[cited by applicant]
WO WO2018213880A1
· 2018
[cited by examiner]
WO 2019009913A1
· 2019
[cited by applicant]
WO 2019063256A1
· 2019
[cited by applicant]
WO 2019067798A1
· 2019
[cited by applicant]
WO 2019086821A1
· 2019
[cited by applicant]
WO 2019173519A1
· 2019
[cited by applicant]
WO 2020032937A1
· 2020
[cited by applicant]
WO WO2020197990A1
· 2020
[cited by examiner]
Shi et al., “A Mechanism to Resolve the Unauthorized Access Vulnerability Caused by Permission Delegation in Blockchain-Based Access Control,” in IEEE Access, vol. 8, pp. 156027-156042, 2020, doi: 10.1109/ACCESS.2020.30…
[cited by examiner]
Rouhani et al., “Physical Access Control Management System Based on Permissioned Blockchain,” Halifax, NS, Canada, 2018, pp. 1078-1083, doi: 10.1109/Cybermatics_2018.2018.00198. (Year: 2018).
[cited by examiner]
Abebe et al., “Verifiable Observation of Permissioned Ledgers,” 2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), Sydney, Australia, 2021, pp. 1-9, doi: 10.1109/ICBC51069.2021.9461152. (Year: 2…
[cited by examiner]
Lei et al., “A Cloud Data Access Authorization Update Scheme Based on Blockchain,” 2020 3rd International Conference on Smart BlockChain (SmartBlock), Zhengzhou, China, 2020, pp. 33-38, doi: 10.1109/SmartBlock52591.2020…
[cited by examiner]
Kresman et al., “An Improved Anonymous Identifier,” 2022 10th International Symposium on Digital Forensics and Security (ISDFS), Istanbul, Turkey, 2022, pp. 1-5, doi: 10.1109/ISDFS55398.2022.9800823. (Year: 2022).
[cited by examiner]
Stokkink et al., “A Truly Self-Sovereign Identity System,” 2021 IEEE 46th Conference on Local Computer Networks (LCN), Edmonton, AB, Canada, 2021, pp. 1-8, doi: 10.1109/LCN52139.2021.9525011. (Year: 2021).
[cited by examiner]
Mizrahi et al., “Optimizing Merkle Proof Size for Blockchain Transactions,” 2021 International Conference on COMmunication Systems & NETworkS (COMSNETS), Bangalore, India, 2021, pp. 299-307, doi: 10.1109/COMSNETS51098.2…
[cited by examiner]
Liu et al., “Merkle Tree: A Fundamental Component of Blockchains,” 2021 International Conference on Electronic Information Engineering and Computer Science (EIECS), Changchun, China, 2021, pp. 556-561, doi: 10.1109/EIEC…
[cited by examiner]
Huang et al., “Comparison and Analysis of Data and Transaction Structure of Bitcoin and Ethereum,” 2021 2nd International Conference on Computer Communication and Network Security (CCNS), Xining, China, 2021, pp. 108-11…
[cited by examiner]
Wang et al., “A Trustworthy Data Verification Technique for Cross-Chain Data Sharing Based on Merkle Trees,” 2023 International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE), Ball…
[cited by examiner]
Adhikari et al., “Complete Merkle Hash Trees for Large Dynamic Spatial Data,” 2019 International Conference on Computational Science and Computational Intelligence (CSCI), Las Vegas, NV, USA, 2019, pp. 1318-1323, doi: 1…
[cited by examiner]
Huang et al., “Comparison and Analysis of Data and Transaction Structure of Bitcoin and Ethereum,” IEEE, DOI: 10.1109/CCNS53852.2021.00029, WenZhou, China, 2021. (Year: 2021).
[cited by examiner]
Wang et al., “A Trustworthy Data Verification Technique for Cross-Chain Data Sharing Based on Merkle Trees,” IEEE, 979-8-3503-4745-6/23, Jiangsu, China, 2023. (Year: 2023).
[cited by examiner]
Ahmad, Ashar , et al., “BlockTrail: A Scalable Multichain Solution for Blockchain-based Audit Trails”, 2019 IEEE International Conference on Communications (ICC), 2019.
[cited by applicant]
Bates, Adam , et al., “Accountable wiretapping—or—I know they can hear you now”, Journal of Computer Security 23 (2015) DOI 10.3233/JCS-140515 IOS Press, 2015, 167-195.
[cited by applicant]
Black, Paul , et al., “AFES: An Advanced Forensic Evidence System”, IEEE doi: 10.1109/EDOCW52865.2021.00034, 2021, 67-74.
[cited by applicant]
Chang, Yanling , et al., “Blockchain in Global Supply Chains and Cross Border Trade: A Critical Synthesis of the State-of-the-Art, Challenges and Opportunities”, International Journal of Production Research2020, vol. 58…
[cited by applicant]
Fraga-Lamas, Paula , et al., “A Review on Blockchain Technologies for an Advanced and Cyber-Resilient Automotive Industry”, IEEE Access Special Section on Advanced Software and Data Engineering for Secure Societies, Dig…
[cited by applicant]
Frankle, Jonathan , et al., “Practical Accountability of Secret Processes”, 27th USENIX Security Symposium, 2018.
[cited by applicant]
Froomkin, A. Michael , “The Metaphor is the Key: Cryptography, the Clipper Chip, and the Constitution”, 143 U. Penn L. Rev. 709 (1995), 1995, 709-775.
[cited by applicant]
Goldwasser, Shafi , et al., “Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal”, Proceedings of the 2017 on Workshop on Privacy in the Electronic Society, 2017.
[cited by applicant]
Hingorani, Ishwarlal , et al., “Police Complaint Management System using Blockchain Technology”, IEEE, doi: 10.1109/ ICISS49785.2020.9315884, 2020, 1214-1219.
[cited by applicant]
Kamara, Seny , “Restructuring the NSA Metadata Program”, International Conference on Financial Cryptography and Data Security, 2014.
[cited by applicant]
Narula, Neha , et al., “zkLedger: Privacy-Preserving Auditing for Distributed Ledgers”, 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI '18). Apr. 9-11, 2018 ⋅ Renton, WA, USA, 2018.
[cited by applicant]
Radhakrisnnan, Sarav , “Detect threads in encrypted traffic without decryption, using network based security analytics”, Cisco Live!, 2018, 1-87.
[cited by applicant]
Ramkumar, Mahalingam , “Executing large-scale processes in a blockchain”, Journal of Capital Markets Studies, vol. 2 No. 2,, 2018, 106-120.
[cited by applicant]
Segal, Aaron , et al., “Catching Bandits and Only Bandits: Privacy-Preserving Intersection Warrants for Lawful Surveillance”, 4th USENIX Workshop on Free and Open Communications on the Internet, 2014.
[cited by applicant]
Segal, Aaron , et al., “Privacy-Preserving Lawful Contact Chaining: [Preliminary Report]”, WPES '16: Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, 2016, 185-188.
[cited by applicant]
Singh, Saurabh Narayan, “A blockchain-based decentralized application for user-driven contribution to Open Government Data”, Technische Universitat Munchen Department of Informatics Master's Thesis in Informatics, 2018.
[cited by applicant]
Van Lennep, Christiaan R.E., “A New Layer Of Trust”, MA Thesis Philosophy, Politics and Economics, Leiden University, 2018, 1-44.
[cited by applicant]
Zhang, Yiwei , et al., “Research on Government Information Sharing Model Using Blockchain Technology”, IEEE, doi: 10.1109/ITM E .2019.00166, 2019, 726-729.
[cited by applicant]
Zhou, Di , et al., “Application Research of VCR Model Based on AH P in the Design of Government Service Big Data Scenario”, IEEE, doi: 10.1109/ICAI BD.2019.8836997, 2019, 66-73.
[cited by applicant]
Zhu, Shuoyi , et al., “Research on the Path of Optimizing China's Digital Government Construction under the Background of Intelligent Society”, IEEE, doi: 10.1109/PMIS52742.2021.00072, 2021, 296-299.
[cited by applicant]
Waters, Brent , “Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization”, Public Key Cryptography—PKC, Proceedings, 2011, 53-70.
[cited by applicant]
Wu, C.-P. , et al., “Design of integrated multimedia compression and encryption systems”, IEEE Transactions on Multimedia, vol. 7, No. 5, 2005, 828-839.
[cited by applicant]
Xie, D. , et al., “Enhanced multiple huffman table (mht) encryption scheme using key hopping”, Proceedings of the 2004 International Symposium on Circuits and Systems (ISCAS), vol. 5, IEEE, 2004, 568-571.
[cited by applicant]
Yang, Kan , et al., “Attributed-based Access Control for Multi-Authority Systems in Cloud Storage”, 2012 32nd IEEE International Conference on Distributed Computing Systems, 2012, 536-545.
[cited by applicant]
Yao, Xuanxia , et al., “A lightweight attribute-based encryption scheme for the Internet of Things”, Future Generation Computer Systems, vol. 49, 2015, 104-112.
[cited by applicant]
Yu, Shucheng, et al., “Attribute based data sharing with attribute revocation”, Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security ASIACCS, 2010, 261-270.
[cited by applicant]
Zhang, Kai , et al., “A Traceable and Revocable Multiauthority Attribute-Based Encryption Scheme with Fast Access”, Security and Communication Networks, vol. 2020, Article ID 6661243, 2020, 1-14.
[cited by applicant]
Zhang, Yinghui , et al., “Attribute-based Encryption for Cloud Computing Access Control: A Survey”, ACM Computing Surveys, vol. 53, No. 4, Article 83, 2020, 1-41.
[cited by applicant]
Zhou, J. , et al., “Security analysis of multimedia encryption schemes based on multiple huffman table”, Signal Processing Letter, vol. 14, No. 3, IEEE, 2007, 201-204.
[cited by applicant]
Goyal, Vipul , et al., “Attribute-based encryption for fine-grained access control of encrypted data”, Proceedings of the 13th ACM CCS, 89-98, 2006.
[cited by applicant]
Hong, Jianan , et al., “Comments on “DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems” /Security Analysis of Attribute Revocation in Multiauthority Data Access Control for Cloud Storage S…
[cited by applicant]
Huang, Ke , et al., “Achieving Intelligent Trust-Layer for Internet-of-Things via Self-Redactable Blockchain”, IEEE Transactions on Industrial Informatics, vol. 16, No. 4, Apr. 2020, 2677-2686.
[cited by applicant]
Huang, Xiaofang , et al., “Multi-Authority Attribute Based Encryption Scheme with Revocation”, 2015 24th International Conference on Computer Communication and Networks (ICCCN), Las Vegas, NV, USA, 2015, 1-5.
[cited by applicant]
Huang, Yaodong , et al., “Profit Sharing for Data Producer and Intermediate Parties in Data Trading over Pervasive Edge Computing Environments”, IEEE Transactions on Mobile Computing, vol. 22, No. 1, 2023, 429-442.
[cited by applicant]
Huffman, D. , et al., “A method for the construction of minimum redundancy codes”, proc. IRE, vol. 40, No. 9, 1952, 1098-1101.
[cited by applicant]
Jacobson, V. , et al., “Networking named content”, Proceedings of the 5th international conference on Emerging networking experiments and technologies, ACM, 2009, 1-12.
[cited by applicant]
Jhuisi , “Charm: A tool for rapid cryptographic prototyping”, http://charm-crypto-io, Downloaded Mar. 29, 2022, 2012.
[cited by applicant]
Jiang, Yinhao , et al., “Ciphertext-policy attribute-based encryption against key-delegation abuse in fog computing”, Future Generation Computer Systems, vol. 78, 2018, 720-729.
[cited by applicant]
Karchmer, M. , et al., “On Span Programs”, Proceedings of the Eighth Annual Structure in Complexity Theory Conference, IEEE Computer Society, 1993, 102-111.
[cited by applicant]
Kim, Sam , “Multi-Authority Attribute-Based Encryption from LWE in the OT Model”, IACR Cryptol. ePrint Arch., p. 280, 2019, 1-57.
[cited by applicant]
Koponen, T. , et al., “A data-oriented (and beyond) network architecture”, ACM SIGCOMM Computer Communication Review, vol. 37, ACM, 2007, 181-192.
[cited by applicant]
Kowalczyk, Lucas , et al., “Bilinear Entropy Expansion from the Decisional Linear Assumption”, International Association for Cryptologic Research 2015, R. Gennaro and M. Robshaw (Eds.): CRYPTO 2015, Part II, LNCS 9216, …
[cited by applicant]
Krawczyk, Hugo , et al., “Chameleon Signatures”, Proceedings of the Network and Distributed System Security Symposium, NDSS, 2000.
[cited by applicant]
Kurihara, Jun , “A Consumer-Driven Access Control Approach to Censorship Circumvention in Content-Centric Networking”, Proceedings of the 2016 Conference on 3rd ACM Conference on Information-Centric Networking, Sep. 26,…
[cited by applicant]
Lewko, Allison , et al., “Decentralizing Attribute-Based Encryption”, Advances in Cryptology—Eurocrypt 2011—30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, s…
[cited by applicant]
Lewko, Allison B., et al., “Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption”, Advances in Cryptology—Eurocrypt, Proceedings, 2010, 62-91.
[cited by applicant]
Li, Ming , et al., “Scalable and Secure Sharing of Personal Health Records in Cloud Computing Using Attribute-Based Encryption”, IEEE Transactions on Parallel and Distributed Systems, vol. 24, No. 1, 2013, 131-143.
[cited by applicant]
Libert, Benoit , et al., “Scalable Group Signatures with Revocation”, Advances in Cryptology—Eurocrypt, Proceedings, 2012, 609-627.
[cited by applicant]
Lin, Huang , et al., “Secure Threshold Multi Authority Attribute Based Encryption without a Central Authority”, D.R. Chowdhury, V. Rijmen, and A. Das (Eds.): Indocrypt 2008, LNCS 5365, 2008, 426-436.
[cited by applicant]
Liu, Dongxiao , et al., “Achieving Multi-Authority Access Control with Efficient Attribute Revocation in Smart Grid”, IEEE ICC 2014—Communication and Information Systems Security Symposium, 2014, 634-639.
[cited by applicant]
Ma, Hui , et al., “Comments on “Control Cloud Data Access Privilege and Anonymity With Fully Anonymous Attribute-Based Encryption””, IEEE Transactions on Information Forensics and Security, vol. 11, No. 4, 2016, 866-867.
[cited by applicant]
Maji, Hemanta K., et al., “Attribute-Based Signatures”, Topics in Cryptology—CT-RSA 2011—The Cryptographers' Track at the RSA Conference 2011, Proceedings, ser. Lecture Notes in Computer Science, A. Kiayias, Ed., vol. 6…
[cited by applicant]
Maram, Sai Krishna Deepak , et al., “CHURP: Dynamic-Committee Proactive Secret Sharing”, Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, 2019, 2369-2386.
[cited by applicant]
Massey, J. L., “Guessing and entropy”, Proceedings to IEEE International Symposium on Information Theory, IEEE, 1994, 204.
[cited by applicant]
Medium , “Hundreds of Millions of Dollars Locked at Ethereum 0x0 Address and Smart Contracts' Addresses”, https://medium.com/@maltabba/hundreds-of-millions-of-dollars-locked-at-ethereum-0x0-address-and-smart-contracts-a…
[cited by applicant]
Muscariell, Luca , et al., “Cicn”, https://wiki.fd.io/view/Cicn, Downloaded Sep. 24, 2019, 2017.
[cited by applicant]
Okamoto, Tatsuaki , et al., “Decentralized Attribute-Based Encryption and Signatures”, IEICE Trans. Fundamentals, vol. E103-A, No. 1, 2020, 41-73.
[cited by applicant]
Panwar, Gaurav , et al., “ReTRACe: Revocable and Traceable Blockchain Rewrites using Attribute-based Cryptosystems”, Proceedings of the 26th ACM Symposium on Access Control Models and Technologies, 2021, 103-114.
[cited by applicant]
Patra, Nilkesh , et al., “Data Reduction by Huffman Coding and Encryption by Insertion of Shuffled Cyclic Redundancy Code”, Dissertation, Department of Electronics & Communication Engineering; National Institute of Tech…
[cited by applicant]
Pirretti, Matthew , et al., “Secure attribute-based systems”, Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS, 2006, 99-112.
[cited by applicant]
Reuters , “Banks complete 25 million euros securities transaction on blockchain platform”, https://uk.reuters.com/article/uk-blockchain-securities/banks-complete-25-million-euros-securities-\transaction-on-blockchain-pl…
[cited by applicant]
Rouselakis, Yannis , et al., “Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption”, International Financial Cryptography Association 2015, R. Bohme and T. Okamoto (Eds.): FC 2015, LNCS …
[cited by applicant]
Ruan, Xiaoyu , et al., “Using an Innovative Coding Algorithm for Data Encryption”, IEEE Transactions, NA, 2006, 1-28.
[cited by applicant]
Rueda, Luis , et al., “A fast and efficient nearly-optimal adaptive Fano coding scheme”, Information Sciences, vol. 176, No. 12, 2006, 1656-1683.
[cited by applicant]
Rueda, Luis , et al., “An Efficient Compression Scheme for Data Communication Which Uses a New Family of Self-Organizing Binary Search Trees”, International Journal of Communication Systems, vol. 21, No. 10, 2008, 1091-…
[cited by applicant]
Sahai, Amit , et al., “Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption”, Advances in Cryptology—Crypto, Proceedings, 2012, 188-217.
[cited by applicant]
Satyanarayanan, Mahadev , “The Emergence of Edge Computing”, Computer, vol. 50, No. 1, 2017, 30-39.
[cited by applicant]
Shannon, C. , “Prediction and entropy of printed english”, Bell System technical journal, vol. 30, No. 1, 1951, 50-64.
[cited by applicant]
Smith, G. , “On the foundations of quantitative information flow”, Foundation of Software Science and Computational Structures, Springer, 2009, 288-302.
[cited by applicant]
Tan, Syh-Yuan , et al., “Enhancement of a Lightweight Attribute-Based Encryption Scheme for the Internet of Things”, IEEE Internet of Things Journal, vol. 6, No. 4, 2019, 6384-6395.
[cited by applicant]
Tateson, Jane , et al., “PSIRP Project, Delverable D4.6: Final Evaluation Report on Deployment Incentives and Business Models”, http:/www.psirp.org/publications/, Downloaded Sep. 28, 2017, 2010.
[cited by applicant]
Thyagarajan, Sri Aravinda Krishnan, et al., “Reparo: Publicly Verifiable Layer to Repair Blockchains”, CoRR abs/2001.00486, http://arxiv.org/abs/2001.00486, Downloaded Mar. 29, 2022, 2020.
[cited by applicant]
Tomida, Junichi , et al., “Fast, compact, and expressive attribute-based encryption”, IACR International Conference on Public-Key Cryptopgraphy, Springer, 2020, 3-33.
[cited by applicant]
Tourani, Reza , et al., “Democratizing the Edge: A Pervasive Edge Computing Framework”, arXiv:2007.00641v1, 2020, 1-7.
[cited by applicant]
Vassantlal, Robin , et al., “COBRA: Dynamic Proactive Secret Sharing for Confidential BFT Services”, 2022 IEEE Symposium on Security and Privacy (SP), 2022, 1335-1353.
[cited by applicant]
Vitter, Jeffrey Scott, “Design and Analysis of Dynamic Huffman Codes”, Journal of the Association for Computing Machinery; vol. 34. No. 4, Oct. 1987, 825-845.
[cited by applicant]
Wachs, Matthias , et al., “On the Feasibility of a Censorship Resistant Decentralized Name System”, Foundations and Practice of Security; Cham, 2014, 19-30.
[cited by applicant]
Wang, Zhedong , et al., “FE for Inner Products and Its Application to Decentralized ABE”, International Association for Cryptologic Research 2019, D. Lin and K. Sako (Eds.): PKC 2019, LNCS 11443, 2019, 97-127.
[cited by applicant]
Wang, Minqian , et al., “Security analysis of a privacy-preserving decentralized ciphertext-policy attribute-based encryption scheme”, Concurrency Computat.: Pract. Exper., vol. 28, 2016, 1237-1245.
[cited by applicant]
“Pursuit Project”, http://www.fp7-pursuit.eu, Downloaded Sep. 24, 2019, 2017.
[cited by applicant]
“Tor Project”, http://www.torproject.org/, Downloaded Sep. 24, 2019, 2017.
[cited by applicant]
Abe, Masayuki , et al., “Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming”, International Association for Cryptologic Research 2016, M. Robshaw and J. Katz (Eds.): …
[cited by applicant]
Acs, G. , et al., “Cache privacy in named-data networking”, International Conference on Distributed Computer Systems (ICDCS), IEEE, 2013, 41-51.
[cited by applicant]
Agrawal, Shashank , et al., “FAME: Fast Attribute-Based Message Encryption”, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS, 2017, 665-682.
[cited by applicant]
Akinyele, Joseph A., et al., “Charm: a framework for rapidly prototyping cryptosystems”, J Cryptogr Eng, vol. 3, 2013, 111-128.
[cited by applicant]
Arianfar, S. , et al., “On preserving privacy in content-oriented networks”, Proceedings of the ACM SIGCOMM workshop on Information-centric networking, ACM, 2011, 19-24.
[cited by applicant]
Ateniese, Giuseppe , et al., “Redactable blockchain-or-rewriting history in bitcoin and friends”, 2017 IEEE European Symposium on Security and Privacty (EuroS&P), IEEE, 2017, 111-126.
[cited by applicant]
Attrapadung, Nuttapong , et al., “Attribute=Based Encryption Supporting Direct/Indirect Revocation Modes”, 12th IMA International Conference, Cryptography and Coding, Proceedings, 2009, 278-300.
[cited by applicant]
Bahl, Paramvir (Victor) , et al., “Pervasive Computing at the Edge”, IEEE Pervasive Comput., vol. 19, No. 4, 2020, 8-9.
[cited by applicant]
Bellare, Mihir , et al., “Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions”, Advances in Cryptology—Eurocrypt Proceedings, 2003, 614-629.
[cited by applicant]
Bellare, Mihir , et al., “Foundations of Group Signatures: The Case of Dynamic Groups”, Topics in Cryptology—CT-RSA, Proceedings, 2005, 136-153.
[cited by applicant]
Bentov, Iddo , et al., “Tesseract: Real-Time Cryptocurrency Exchange Using Trusted Hardware”, Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS, 2019, 1521-1538.
[cited by applicant]
Bethencourt, John , et al., “Ciphertext-Policy Attribute-Based Encryption”, 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007, 321-334.
[cited by applicant]
Bethencourt, John , et al., “New Constructions and Practical Applications for Private Stream Searching (Extended Abstract)”, Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P'06), 2006, 132-139.
[cited by applicant]
Boldyreva, Alexandra , et al., “Identity-based encryption with efficient revocation”, Proceedings of the 2008 ACM CCS, 2008, 417-426.
[cited by applicant]
Boneh, Dan , et al., “Short Group Signatures”, M. Franklin (Ed.): Crypto 2004, LNCS 3152, International Association for Cryptologic Research 2004, 2004, 41-55.
[cited by applicant]
Bootle, Jonathan , et al., “Foundations of Fully Dynamic Group Signatures”, IACR Cryptol. ePrint Arch, http://eprint.iacr.org/2016/368, Downloaded Mar. 29, 2022, 2016, 368.
[cited by applicant]
Bowe, Sean , et al., “A Multi-party Protocol for Constructing the Public Parameters of the Pinocchio zk-SNARK”, International Financial Cryptography Association 2019, A. Zohar et al. (Eds.): FC 2018 Workshops, LNCS 1095…
[cited by applicant]
Business Insider , “The growing list of applications and use cases of blockchain technology in business and life”, https://www.businessinsider.com/blockchain-technology-applications-use-cases, Downloaded Mar. 29, 2022, …
[cited by applicant]
Business Wire , “Accenture Editable Blockchain”, https://www.businesswire. com/news/home/20160920005551/en/Accenture-Debuts-Prototype-of-%E2%80%98Editable%E2%80%99-Blockchain-for-Enterprise-and-Permissioned-Systems, Dow…
[cited by applicant]
California Gov , “California Consumer Privacy Act”, https://oag.ca.gov/privacy/ccpa, Downloaded Mar. 29, 2022, 2018.
[cited by applicant]
Camenisch, Jan , et al., “Chameleon-Hashes with Ephemeral Trapdoors—And Applications to Invisible Sanitizable Signatures”, Public-Key Cryptography—PKC, Proceedings, Part II, 2017, 152-182.
[cited by applicant]
Chaabane, A. , et al., “Privacy in content-oriented networking: Threats and countermeasures”, ACM SIGCOMM Computer Communication Review, vol. 43, No. 3, 2013, 25-33.
[cited by applicant]
Chase, Melissa , et al., “Improving Privacy and Security in Multi-Authority Attribute-Based Encryption”, Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009, 2009, 121-130.
[cited by applicant]
Chase, Melissa , “Multi-authority Attribute Based Encryption”, Theory of Cryptography, 4th Theory of Cryptography Conference, TCC, Proceedings, Salil P. Vadhan (Ed.), 2007, 515-534.
[cited by applicant]
Chen, Jianwei , et al., “Efficient Decentralized Attribute-based Access Control for Cloud Storage with User Revocation”, IEEE ICC 2014—Selected Areas in Communications Symposium, 2014, 3782-3787.
[cited by applicant]
Chen, Jie , et al., “Improved Dual System ABE in Prime-Order Groups via Predicate Encodings”, International Association for Cryptologic Research 2015, E. Oswald and M. Fischlin (Eds.): Eurocrypt 2015, Part II, LNCS 9057…
[cited by applicant]
Chow, Sherman S.M., “A framework of Multi-Authority Attribute-Based Encryption with Outsourcing and Revocation”, Proceedings of the 21st ACM on Symposium on Access Control Models and Technologies, SACMAT, 2016, 215-226.
[cited by applicant]
Clarisse, Remi , et al., “Curves with Fast Computations in the First Pairing Group”, Springer Nature Switzerland AG 2020, S. Krenn et al. (Eds.): CANS 2020, LNCS 12579, 2020, 280-298.
[cited by applicant]
Connolly, Christopher , et al., “TRIST: Circumventing Censorship with Transcoding-Resistant Image Steganography”, FOCI, 2014, 1-8.
[cited by applicant]
Cui, Hui , et al., “Server-Aided Revocable Attribute-Based Encryption”, Computer Security—ESORICS, Proccedings, Part II, 2016, 570-587.
[cited by applicant]
Dannewitz, C. , et al., “NetInf: An information-centric design for the future Internet”, GI/ITG KuVS Workshop on The Future Internet, 2009.
[cited by applicant]
Datta, Pratish , et al., “Decentralized Multi-authority ABE for DNFs from LWE”, Advances in Cryptology—Eurocrypt 2021—40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proc…
[cited by applicant]
Datta, Pratish , et al., “Fully Secure Unbounded Revocable Attribute-Based Encryption in Prime Order Bilinear Groups via Subset Difference Method”, IACR Cryptology ePrint Archive, http://eprint.iacr.org/2015/293, Downlo…
[cited by applicant]
Department of Homeland Security , “Blockchain and Suitability for Goverment Applications”, https://www.dhs.gov/sites/default/files/publications/2018_AEP_Blockchain_and_Suitablity_for_Government_Applciations.pdf, Downloa…
[cited by applicant]
Derler, David , et al., “Fine-Grained and Controlled Rewriting in Blockchains: Chameleon-Hashing Gone Attribute-Based”, 26th Annual Network and Distributed System Security Symposium, NDSS, 2019.
[cited by applicant]
Deuber, Dominic , et al., “Redactable Bockchain in the Permissionless Setting”, IEEE Symposium on Security and Privacy, SP 2019, San Francisco, CA., May 19-23, 2019, 124-138, 2019.
[cited by applicant]
Dibenedetto, S. , et al., “Andana: Anonymous named data networking application”, Arxiv preprint arXiv:1112.2205, 2011.
[cited by applicant]
Dorrie, H. , 100 Great problems of elementary mathematics, Dover Publications, 1965, 23-25.
[cited by applicant]
Dougherty, Sean , et al., “Apecs: A Distributed Access Control Framework for Pervasive Edge Computing Services”, ACM SIGSAC Conference on Computer and Communications Security, 2021, 1405-1420.
[cited by applicant]
Escala, Alex , et al., “An Algebraic Framework for Diffie-Hellman Assumptions”, J Cryptol, vol. 30, 2017, 242-288.
[cited by applicant]
Fan, Yundong , et al., “Multi-authority attribute-based encryption access control scheme with hidden policy and constant length ciphertext for cloud storage”, In Second IEEE International Conference on Data Science in C…
[cited by applicant]
Feng, Chaosheng , et al., “Attribute-Based Encryption With Parallel Outsourced Decryption for Edge Intelligent IoV”, IEEE Transactions on Vehicular Technology, vol. 69, No. 11, 2020, 13784-13795.
[cited by applicant]
Fraenkel, A. S., et al., “Complexity aspects of guessing prefix codes”, Algorithmica, vol. 12, Nos. 4-5, 1994, 409-419 (only 409-410 available).
[cited by applicant]
Fujisaki, Eiichiro , et al., “Secure Integration of Asymmetric and Symmetric Encryption Schemes”, Advances in Cryptology—Crypto, Proceedings, 1999, 537-554.
[cited by applicant]
Galbraith, Steven D., et al., “Pairings for cryptographers”, Discrete Applied Mathematics, vol. 156, 2008, 3113-3121.
[cited by applicant]
Ge, Chunpeng , et al., “Revocable Attribute-Based Encryption With Data Integrity in Clouds”, IEEE Transactions on Dependable and Secure Computing, vol. 19, No. 5, 2022, 2864-2872.
[cited by applicant]
Ge, Aijun , et al., “Security Analysis of a Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption Scheme”, IEEE Transactions on Parallel and Distributed Systems, vol. 24, No. 11, 2013, 2319-2321.
[cited by applicant]
Gillman, D. , et al., “On breaking a huffman code”, IEEE Transactions on Information Theory, vol. 2, No. 3, 1996, 972-976.
[cited by applicant]