Long-term secure distributed storage using quantum key distribution network with third-party verification

• URL: http://arxiv.org/abs/2112.12292v1
• Date: Thu, 23 Dec 2021 00:55:50 GMT
• Title: Long-term secure distributed storage using quantum key distribution network with third-party verification
• Authors: Mikio Fujiwara, Ryo Nojima, Toyohiro Tsurumaru, Shiho Moriai, Masahiro Takeoka, and Masahide Sasaki
• Abstract summary: Quantum key distribution network with Vernam's One Time Pad encryption and secret sharing are powerful security tools. In this paper, we propose an ITS integrity protection scheme employing a third-party verification with time-stamp.
• Score: 8.523357169329339
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The quantum key distribution network with Vernam's One Time Pad encryption and secret sharing are powerful security tools to realize an information theoretically secure distributed storage system. In our previous work, a single-password-authenticated secret sharing scheme based on the QKD network and Shamir's secret sharing was experimentally demonstrated; it confirmed ITS data transmission, storage, authentication, and integrity. To achieve data integrity, an ITS message authentication code tag is employed and a data owner of the secret sharing performs both the MAC tag generation and verification. However, for a scenario in which the data owner and end users are different entities, the above approach may not work since the data owner can cheat the end users. In this paper, we resolve this problem by proposing an ITS integrity protection scheme employing a third-party verification with time-stamp.

Related papers

• Encrypted Federated Search Using Homomorphic Encryption [0.0]
  This paper introduces a privacy-preserving federated search system that allows law enforcement agencies to conduct queries on encrypted criminal databases.<n>The key innovation here is the ability to execute encrypted queries across distributed databases, without the decryption of the data.
  arXiv  Detail & Related papers  (2025-05-05T07:03:30Z)
• Secret-Key Generation from Private Identifiers under Channel Uncertainty [21.178416840822027]
  This study investigates secret-key generation for device authentication using physical identifiers. The system includes two legitimate terminals (encoder and decoder) and an eavesdropper (Eve) Our contributions include deriving inner and outer bounds on the optimal trade-off among secret-key, storage, and privacy-leakage rates for general discrete sources.
  arXiv  Detail & Related papers  (2025-03-11T17:20:48Z)
• Balancing Confidentiality and Transparency for Blockchain-based Process-Aware Information Systems [46.404531555921906]
  We propose an architecture for blockchain-based PAISs aimed at preserving both confidentiality and transparency. Smart contracts enact, enforce and store public interactions, while attribute-based encryption techniques are adopted to specify access grants to confidential information.
  arXiv  Detail & Related papers  (2024-12-07T20:18:36Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party. We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• MARTSIA: A Tool for Confidential Data Exchange via Public Blockchain [6.26635837045368]
  Multi-Authority Approach to Transaction Systems for Interoperating Applications (MARTSIA) MARTSIA provides fine-grained read-access control at the message-part level by combining user-defined policies with certifier-declared attributes. This architecture effectively balances the transparency inherent in public blockchains with the privacy required for sensitive applications.
  arXiv  Detail & Related papers  (2024-07-15T12:59:54Z)
• Towards Credential-based Device Registration in DApps for DePINs with ZKPs [46.08150780379237]
  We propose a credential-based device registration (CDR) mechanism that verifies device credentials on the blockchain. We present a general system model, and technically evaluate CDR using zkSNARKs with Groth16 and Marlin.
  arXiv  Detail & Related papers  (2024-06-27T09:50:10Z)
• CAKE: Sharing Slices of Confidential Data on Blockchain [1.481195148653669]
  Control Access via Key Encryption (CAKE) designed to ensure data confidentiality in scenarios involving public blockchains. We showcase the application of CAKE in the context of a real-world cyber-security project within the logistics domain.
  arXiv  Detail & Related papers  (2024-05-07T09:44:04Z)
• Improving Privacy-Preserving Techniques for Smart Grid using Lattice-based Cryptography [1.4856472820492366]
  SPDBlock is a blockchain-based solution ensuring privacy, integrity, and resistance to attacks. It detects and prosecutes malicious entities while efficiently handling multi-dimensional data transmission. Performance tests reveal SPDBlock's superiority in communication and computational efficiency over traditional schemes.
  arXiv  Detail & Related papers  (2024-04-17T19:51:52Z)
• Enc2DB: A Hybrid and Adaptive Encrypted Query Processing Framework [47.11111145443189]
  We introduce Enc2DB, a novel secure database system following a hybrid strategy on and openGauss. We present a micro-benchmarking test and self-adaptive mode switch strategy that can choose the best execution path (cryptography or TEE) to answer a given query. We also design and implement a ciphertext index compatible with native cost model and querys to accelerate query processing.
  arXiv  Detail & Related papers  (2024-04-10T08:11:12Z)
• The Power of Bamboo: On the Post-Compromise Security for Searchable Symmetric Encryption [43.669192188610964]
  Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated databases to an honest-but-curious server. This paper studies a new and practical security risk to DSSE, namely, secret key compromise. We introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates.
  arXiv  Detail & Related papers  (2024-03-22T09:21:47Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• HasTEE+ : Confidential Cloud Computing and Analytics with Haskell [50.994023665559496]
  Confidential computing enables the protection of confidential code and data in a co-tenanted cloud deployment using specialized hardware isolation units called Trusted Execution Environments (TEEs) TEEs offer low-level C/C++-based toolchains that are susceptible to inherent memory safety vulnerabilities and lack language constructs to monitor explicit and implicit information-flow leaks. We address the above with HasTEE+, a domain-specific language (cla) embedded in Haskell that enables programming TEEs in a high-level language with strong type-safety.
  arXiv  Detail & Related papers  (2024-01-17T00:56:23Z)
• Send Message to the Future? Blockchain-based Time Machines for Decentralized Reveal of Locked Information [0.8192907805418581]
  This paper introduces a breakthrough in the understanding, design, and application of conditional information reveal systems. By designing a new practical timed-release cryptography system and a secret sharing scheme with reveal-verifiability, a novel data sharing system is devised. This paper provides a complete evaluation portfolio of this pioneering paradigm, including analytical results, a validation of its robustness in the Tamarin Prover and a performance evaluation of a real-world, open-source system prototype deployed across the globe.
  arXiv  Detail & Related papers  (2024-01-11T14:34:56Z)
• SOCI^+: An Enhanced Toolkit for Secure OutsourcedComputation on Integers [50.608828039206365]
  We propose SOCI+ which significantly improves the performance of SOCI. SOCI+ employs a novel (2, 2)-threshold Paillier cryptosystem with fast encryption and decryption as its cryptographic primitive. Compared with SOCI, our experimental evaluation shows that SOCI+ is up to 5.4 times more efficient in computation and 40% less in communication overhead.
  arXiv  Detail & Related papers  (2023-09-27T05:19:32Z)
• Blockchain-enabled Data Governance for Privacy-Preserved Sharing of Confidential Data [1.6006586061577806]
  We propose a blockchain-based data governance system that employs attribute-based encryption to prevent privacy leakage and credential misuse. First, our ABE encryption system can handle multi-authority use cases while protecting identity privacy and hiding access policy. Second, applying the Advanced Encryption Standard (AES) for data encryption makes the whole system efficient and responsive to real-world conditions.
  arXiv  Detail & Related papers  (2023-09-08T05:01:59Z)
• ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment [90.60126724503662]
  ByzSecAgg is an efficient secure aggregation scheme for federated learning. ByzSecAgg is protected against Byzantine attacks and privacy leakages.
  arXiv  Detail & Related papers  (2023-02-20T11:15:18Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• A Proposed Access Control-Based Privacy Preservation Model to Share Healthcare Data in Cloud [0.0]
  This paper presents the concept of an access control-based (AC) privacy preservation model for the mutual authentication of users and data owners. The proposed model offers a high-security guarantee and high efficiency. The proposed model outperforms other methods with a maximal genuine data rate of 0.91.
  arXiv  Detail & Related papers  (2020-07-27T20:32:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.