US11748504B2 - Method for setting up a secure hierarchical referencing system - Google Patents

Method for setting up a secure hierarchical referencing system Download PDF

Info

Publication number
US11748504B2
US11748504B2 US17/257,684 US201817257684A US11748504B2 US 11748504 B2 US11748504 B2 US 11748504B2 US 201817257684 A US201817257684 A US 201817257684A US 11748504 B2 US11748504 B2 US 11748504B2
Authority
US
United States
Prior art keywords
data node
node key
data
index
current
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US17/257,684
Other languages
English (en)
Other versions
US20220129574A1 (en
Inventor
Kai REHNELT
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SECLOUS GmbH
Original Assignee
SECLOUS GmbH
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by SECLOUS GmbH filed Critical SECLOUS GmbH
Assigned to SECLOUS GMBH reassignment SECLOUS GMBH ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: REHNELT, Kai
Publication of US20220129574A1 publication Critical patent/US20220129574A1/en
Application granted granted Critical
Publication of US11748504B2 publication Critical patent/US11748504B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0891—Revocation or update of secret information, e.g. encryption key update or rekeying
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3242—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • H04L9/3249—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures using RSA or related signature schemes, e.g. Rabin scheme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2107—File encryption
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2141—Access rights, e.g. capability lists, access control lists, access tables, access matrices

Definitions

  • the aim of the present invention is to provide a performance-optimized secure hierarchical referencing system, for example to implement a cryptographic file system (CFS) in which files or other data are stored in a cryptographic tree structure on a untrusted environment.
  • CFS cryptographic file system
  • AAC adaptive cryptographic access control
  • All said keys should not be stored but calculated, and a dedicated symmetric key used for each element in the referencing system (e.g. files, records, comments) to ensure that read/write permissions can be distributed to selected third parties at element level and actively revoked where required (sharing/revocation).
  • This referencing system thereby replaces conventional access control and authentication methods and due to the symmetric keys on an individual element basis enables not only efficient, error-tolerant access, but in particular also the possibility of the active removal of individual elements.
  • a lazy revocation approach is used for encryption, i.e. a new key is not generated immediately after a user is revoked but only when the data is stored.
  • KDA key derivation algorithm method
  • Lazy revocation is a key requirement for current cloud storage systems, particularly where a user group shares very large quantities of data.
  • the lazy revocation method In contradistinction to the active revocation method, where following revocation of data within a client-based encryption method all data must first be downloaded to the client, encrypted with new keys, and the re-encrypted data uploaded back onto the server, in the lazy revocation method data must only be re-encrypted if it has changed, in which case it would in any event require re-encryption.
  • Lazy revocation therefore represents a compromise in which persons who previously had access to the encrypted data continue to have access to that data provided that the data has not changed.
  • Security is guaranteed under lazy revocation since data continues to be protected by the current encryption unless changed, and new or changed data is encrypted with new keys, and said keys are distributed to the users who continue to have permission to access said data even after access is revoked for others.
  • the lazy revocation method is counter to KDA since it would interrupt the concatenation of keys starting with the entry key (in KDA each subordinate key is calculated using its predecessor, whilst under lazy revocation an element may have several keys distributed to it, whereby the key calculation is no longer unique). Under the lazy revocation approach, therefore, all keys used must be stored and distributed (resulting in an independent key model), which is counter to the aim of not storing any keys.
  • a compromise under the state of the art is the key management method of Atallah, Frikken and Blanton (and variants thereof) where under the independent key model the need to distribute keys to all parties is replaced by the introduction of public auxiliary values for each element, whereby said values are calculated from the hash of the parent key minus the value of the node key.
  • a node key is calculated in a similar way by subtracting the hash of the auxiliary key from the hash of the parent key.
  • the public auxiliary keys must be stored for each element and the loss of an auxiliary key thus entails the loss of all subordinate node keys. This is counter to the aim of achieving a secure and error-tolerant referencing system.
  • a further major disadvantage of lazy revocation is that key management (key generation and distribution) requires considerable processor power over long periods and has high overheads due to the need to store the keys.
  • key management key generation and distribution
  • each individual key would have to be stored under the lazy revocation method.
  • this key would even have to be encrypted (for example with the third party's public RSA key). It would thus be necessary, for example, when sharing data with 3 parties to store 4 encrypted keys (encrypted once with the client's own key and then with each of the third parties' public keys).
  • data node keys are derived from the data node key of the parent data node and others.
  • lazy revocation may cause child nodes to have an older key than the parent node, it is necessary to note exactly which version of the parent key is current.
  • a major aspect of this invention is the maintenance of a temporary (volatile) data node key list for each data node, in which the key indices distributed to the respective keys are noted. Within this list, the keys assigned to the data node are stored in a numbered list whereby the last entry in the list corresponds to the current key.
  • the data node keys include (at least) one of the previously used parent data node's data node keys for generation, it is necessary to trace the path of the tree from the root to the data node used for storage to identify the point at which the parent data node has a more current data node key than the parent data node key used as the basis for generating the current data node key, and to update the keys and indices as required, as well as to encrypt the data with the new keys. This ensures that all keys and indices of all parent data nodes along the path have been updated before data assigned to a data node is stored, and thus that the data is encrypted with the valid current key (which revoked users do not possess).
  • FIG. 1 illustrates an example of the key and reference lists used for lazy revocation at the state of the art.
  • FIG. 2 illustrates the core components according to claim 1 defined in the preamble.
  • FIG. 3 illustrates an embodiment for adding volatile data node key lists to the key management according to claim 1 .
  • FIG. 4 illustrates an embodiment for adding non-volatile data node key parameter lists for referencing and recalculating indices and keys according to claim 1 .
  • FIG. 5 illustrates an embodiment for implementing the generation step defined in claim 1 .
  • FIG. 6 describes the method for compressed storage of the data node parameter lists according to claim 4 .
  • FIG. 7 shows the legend for FIG. 6 .
  • FIG. 8 describes an embodiment according to claim 4 .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Power Engineering (AREA)
  • Storage Device Security (AREA)
  • Communication Control (AREA)
US17/257,684 2018-07-12 2018-07-12 Method for setting up a secure hierarchical referencing system Active 2039-05-26 US11748504B2 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2018/068919 WO2020011358A1 (de) 2018-07-12 2018-07-12 Verfahren zum aufbau eines sicheren hierarchischen referenzierungssystems

Publications (2)

Publication Number Publication Date
US20220129574A1 US20220129574A1 (en) 2022-04-28
US11748504B2 true US11748504B2 (en) 2023-09-05

Family

ID=62976036

Family Applications (1)

Application Number Title Priority Date Filing Date
US17/257,684 Active 2039-05-26 US11748504B2 (en) 2018-07-12 2018-07-12 Method for setting up a secure hierarchical referencing system

Country Status (6)

Country Link
US (1) US11748504B2 (de)
EP (1) EP3821558B1 (de)
JP (1) JP7105921B2 (de)
CN (1) CN112106323B (de)
IL (1) IL277816B2 (de)
WO (1) WO2020011358A1 (de)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020194209A1 (en) * 2001-03-21 2002-12-19 Bolosky William J. On-disk file format for a serverless distributed file system
US7203317B2 (en) 2001-10-31 2007-04-10 Hewlett-Packard Development Company, L.P. System for enabling lazy-revocation through recursive key generation
US8005227B1 (en) * 2007-12-27 2011-08-23 Emc Corporation Key information consistency checking in encrypting data storage system

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10016337B4 (de) * 2000-03-31 2004-05-27 Dis Informationssysteme Gmbh Verfahren und Vorrichtung zur Erzeugung und Verarbeitung von Daten durch einen aktiven Strukturbaum
JP4023083B2 (ja) * 2000-04-06 2007-12-19 ソニー株式会社 情報処理システム、情報処理方法、および情報記録媒体、並びにプログラム提供媒体
EP1488596B1 (de) * 2002-03-27 2018-02-28 British Telecommunications public limited company Schlüsselverwaltungsprotokoll
KR20070029104A (ko) * 2003-09-22 2007-03-13 코닌클리케 필립스 일렉트로닉스 엔.브이. 디스플레이되는 계층적 데이터 구조를 통한 네비게이팅
JP4599194B2 (ja) 2005-03-08 2010-12-15 株式会社東芝 復号装置、復号方法、及びプログラム
JP2009038416A (ja) * 2007-07-31 2009-02-19 Toshiba Corp マルチキャスト通信システム、並びにグループ鍵管理サーバ
CN101557587B (zh) * 2009-04-08 2011-01-26 哈尔滨工程大学 一种无线传感器网络中层次树密钥管理方法
CN102014133B (zh) * 2010-11-26 2013-08-21 清华大学 在云存储环境下一种安全存储系统的实现方法
US8620962B1 (en) * 2012-02-21 2013-12-31 Netapp, Inc. Systems and methods for hierarchical reference counting via sibling trees
CN103067170B (zh) * 2012-12-14 2015-04-15 深圳国微技术有限公司 一种基于ext2文件系统的加密方法
GB2520489A (en) * 2013-11-20 2015-05-27 Ibm Deletion of content in digital storage systems
US9432192B1 (en) * 2014-03-28 2016-08-30 Emc Corporation Content aware hierarchical encryption for secure storage systems
CN104901949A (zh) * 2015-04-21 2015-09-09 成都汇智远景科技有限公司 一种数据加密方法
CN104811448A (zh) * 2015-04-21 2015-07-29 成都汇智远景科技有限公司 一种数据安全存储方法
US10554385B2 (en) * 2015-09-04 2020-02-04 Nec Corporation Method for providing encrypted data in a database and method for searching on encrypted data
CN106599719A (zh) * 2016-12-12 2017-04-26 西安电子科技大学 支持高效密钥管理的密文检索方法
CN106850216B (zh) * 2017-03-31 2020-03-17 西安电子科技大学 一种云数据库中密钥管理树的密钥撤销方法
CN107094075B (zh) * 2017-07-05 2021-05-28 电子科技大学 一种基于收敛加密的数据块动态操作方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020194209A1 (en) * 2001-03-21 2002-12-19 Bolosky William J. On-disk file format for a serverless distributed file system
US7203317B2 (en) 2001-10-31 2007-04-10 Hewlett-Packard Development Company, L.P. System for enabling lazy-revocation through recursive key generation
US8005227B1 (en) * 2007-12-27 2011-08-23 Emc Corporation Key information consistency checking in encrypting data storage system

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Atallah, et al., "Dynamic and Efficient Key Management for Access Hierarchies", Department of Computer Science, Purdue University, Nov. 2005, 12 pages.
Geron, et al., "CRUST: Cryptographic Remote Untrusted Storage without Public Keys", International Association for Cryptologic Research, Jul. 10, 2007, pp. 1-32.
International Application No. PCT/EP2018/068919, "International Search Report and Written Opinion", dated Mar. 6, 2019, 11 pages.
Kallahalla, et al., "Proceedings of FAST '03: 2nd USENIX Conference on File and Storage Technologies", USENIX Association, Mar. 31-Apr. 2, 2003, pp. 29-42.

Also Published As

Publication number Publication date
WO2020011358A1 (de) 2020-01-16
JP2022500884A (ja) 2022-01-04
IL277816A (en) 2020-11-30
IL277816B1 (en) 2023-07-01
CN112106323A (zh) 2020-12-18
EP3821558A1 (de) 2021-05-19
CN112106323B (zh) 2024-03-22
JP7105921B2 (ja) 2022-07-25
EP3821558B1 (de) 2022-06-08
US20220129574A1 (en) 2022-04-28
IL277816B2 (en) 2023-11-01

Similar Documents

Publication Publication Date Title
US11425108B2 (en) Blockchain-based service data encryption methods and apparatuses
US8423764B2 (en) Method and apparatus for key revocation in an attribute-based encryption scheme
US7770213B2 (en) Method and apparatus for securely forgetting secrets
US7596222B2 (en) Encrypting data for access by multiple users
US20100005318A1 (en) Process for securing data in a storage unit
US20140143542A1 (en) Method and Apparatus for Managing Encrypted Folders in Network System
US8995655B2 (en) Method for creating asymmetrical cryptographic key pairs
US10630474B2 (en) Method and system for encrypted data synchronization for secure data management
GB2520489A (en) Deletion of content in digital storage systems
CN111130770A (zh) 基于区块链的信息存证方法、系统、用户终端、电子设备及存储介质
US20220200791A1 (en) Method for encrypting and storing computer files and associated encryption and storage device
US11880476B1 (en) Filekey access to data
CN111342966B (zh) 一种数据的存储方法、数据的恢复方法、装置及设备
CN114826696A (zh) 文件内容分级共享方法、装置、设备及介质
US20170351871A1 (en) Data Owner Controlled Data Storage Privacy Protection Technique
CN113194089A (zh) 一种支持属性撤销的密文策略基于属性加密方法
US11233642B2 (en) Regulating document access
CN114168703A (zh) 一种群组加密数据检索方法
US11748504B2 (en) Method for setting up a secure hierarchical referencing system
US11520921B2 (en) Method for generating metadata-free trees
CN112235324B (zh) 一种基于KeyStore密钥树的密钥管理系统、更新方法、读取方法
KR102289478B1 (ko) 보안키 관리 방법 및 보안키 관리 서버
CN107769915B (zh) 具备细粒度用户控制的数据加解密系统和方法
CN116743488A (zh) 数据安全交换方法、装置、设备、存储介质及程序产品
JP2020129808A (ja) 管理装置、および管理方法

Legal Events

Date Code Title Description
AS Assignment

Owner name: SECLOUS GMBH, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:REHNELT, KAI;REEL/FRAME:054799/0866

Effective date: 20201022

FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO SMALL (ORIGINAL EVENT CODE: SMAL); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

STPP Information on status: patent application and granting procedure in general

Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS

STCF Information on status: patent grant

Free format text: PATENTED CASE