CoChat
Sign Up
Cited by 35

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing

Fujiwara, M., Waseda, A., Nojima, R., Moriai, S., Ogata, W., Sasaki, M.·2016·Scientific Reports
DOI 10.1038/srep28988PMC PMC4929494
Open this paper in CoChat — free account

Abstract

Distributed storage plays an essential role in realizing robust and secure data storage in a network over long periods of time. A distributed storage system consists of a data owner machine, multiple storage servers and channels to link them. In such a system, secret sharing scheme is widely adopted, in which secret data are split into multiple pieces and stored in each server. To reconstruct them, the data owner should gather plural pieces. Shamir’s (k, n)-threshold scheme, in which the data are split into n pieces (shares) for storage and at least k pieces of them must be gathered for reconstruction, furnishes information theoretic security, that is, even if attackers could collect shares of less than the threshold k, they cannot get any information about the data, even with unlimited computing power. Behind this scenario, however, assumed is that data transmission and authentication must be perfectly secure, which is not trivial in practice. Here we propose a totally information theoretically secure distributed storage system based on a user-friendly single-password-authenticated secret sharing scheme and secure transmission using quantum key distribution and demonstrate it in the Tokyo metropolitan area (≤90 km).

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/srep28988

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The maximum channel capacity reported so far is (1.665 ± 0.018), beating the limit of log2 3 ∼ 1.585 bits obtainable by only linear optics and entanglement.

    “So far, the maximum channel capacity (1.665 ± 0.018) has been reported in Ref. [327], beating the limit of log 2 3 ∼ 1.585 bits obtainable by means of only linear optics and entanglement, due to the impossibility of perfectly discriminating all four Bell states in this case.”

    From Photonic quantum information processing: a review (2019) · cites this paper as [327]

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

  • NTRU: A ring-based public key cryptosystem

    Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · cited 1×

    “ir low dark counts. The quantum efficiencies of SSPDs are 10% at 100 c/s of dark count rate. Specifications are listed in table 1. The information theoretically secure distributed storage system with (3,4) threshold for secret data is physically constructed with four nodes which are denoted as Node 1 to 4 of the QKD p…”

Flagged first, then by citations

Research works printed but not linked: 24

  1. Damgard, I., Pastro, V., Smart, N. & Zakarias, S. Multiparty computation from somewhat homomorphic encryption. CRYPTO 2012 7417, 643–662 (2012). · DOI · Paper page
  2. Boneh, D., Crescenzo, G. D., Ostrovsky, R. & Persiano, G. Public key encryption with keyword serch. EUROCRYPT 2004 3077, 506–522 (2004). · DOI
  3. Regev. O. On Lattices, Learning with Errors, Random Linear Codes and Cryptography. J. ACM 56, 34 (2009). · DOI · Paper page
  4. Goldreich, O., Goldwasser, S. & Halevi, S. Public-Key Cryptosystems from Lattice Reduction Problems. Proceeding of CRYPTO 1997 pp. 112–131 (Springer, Heidelberg, 1997). · DOI
  5. Ajtai, M. & Dwork, C. A Public-Key Cryptosystem with Worst/Average Case Equivalence. Proceeding of the 29th Symposium on the Theory of Computing (STOC 1997), pp. 284–293 (ACM Press, New York, 1997). · DOI
  6. Shor, P. W. Algorithms for quantum computation: Discrete logarithms and factoring. Proceeding of the 35th Annual Symposimu on Fundations of Computer Science, pp. 12–134 (IEEE Computer Society Press, Los Alamitos, 1994).
  7. IEEE Standard Specification for Public-Key Cryptographic Techniques Based on Hard Problems over Lattices (IEEE, New York, 2009).
  8. Chen, Y. & Nguyen, P. BKZ20: Better lattice security estimate. ASIACRYPT 2011, 7073, 1–20 (2011). · DOI
  9. Shamir, A. How to share a secret. Communications of the ACM, 22, 612–613 (1979). · DOI · Paper page
  10. Goldreich, O., Micali, S. & Wigderson, A. How to play any mental game. Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 218–229 (ACM, New York, 1987). · DOI · Paper page
  11. Gisin, N., Ribordy, G., Tittel, W. & Zbinden, H. Quantum cryptography. Rev. Mod. Phys. 74, 145–195 (2002). · DOI · Paper page
  12. Wegman, M. & Carter, L. New hash functions and their use in authentication and set equality. J. Comp. and Sys. science, 22, 265–279 (1981). · DOI · Paper page
  13. Bagherzandi, A., Jarecki, S., Saxena, N. & Lu, Y. Password-protected secret sharing. Proceeding of 18th ACM Computer and Communications security, pp. 433–444 (ACM, New York, 2011). · DOI
  14. Camenisch, J., Lysyanskaya, A. & Neven, G. Practical yet universally composable two-server password-authenticated secret sharing. Proceeding of 18th ACM Computer and Communications security, pp. 525–536 (ACM, New York, 2012). · DOI
  15. Sasaki, M. et al. Quantum Photonic Network: Concept, Basic Tools and Future Issues. J. Selected Topics in Quant. Elec. 21, 6400313 (2015).
  16. Yoshino, K., Ochi, T., Fujiwara, M., Sasaki, M. & Tajima, A. Maintenance-free operation of WDM quantum key distribution system through a field fiber over 30 days. Opt. Express 21, 31395–31401 (2013). · DOI
  17. Bennett, C. H. & Brassard, G. Quantum cryptography: Public-key distribution and coin tossing, Proceedings IEEE Int. Conf. on Computers, Systems and Signal Processing, Bangalore, India, pp. 175–179 (IEEE, New York, 1984).
  18. Lo, H.-K., Ma, X. & Chen, K. Decoy state quantum key distribution. Phys. Rev. Lett. 94, 230504 (2005). · DOI · Paper page
  19. Ma, X., Qi, B., Zhao, Y. & Lo, H.-K. Practical decoy state for quantum key distribution. Phys. Rev. A72, 012326 (2005). · DOI
  20. Dynes, J. F. et al. Stability of high bit rate quantum key distribution on installed fiber. Opt. Express 20, 16339–16347 (2012). · DOI
  21. Hirano, T., Yamanaka, H., Ashikaga, M., Konishi, T. & Namiki, R. Quantum cryptography using pulsed homodyne detection. Phys. Rev. A68, 042331 (2003). · DOI
  22. Shimizu, K. et al. Performance of long-distance quantum key distribution over 90-km optical links installed in a field environment of Tokyo metropolitan area. IEEE J. Lightwave tech. 32, 141–151 (2013). · DOI
  23. Miki, S., Yamashita, T., Fujiwara, M., Sasaki, M. & Wang, Z. Characterization of coupling efficiency and absorption coefficient for fiber-coupled SNSPD with an optical cavity. IEEE Trans, Appl. Supercond. 21, 332–335 (2011). · DOI
  24. Fujiwara, M., Domeki, T., Moriai, S. & Sasaki, M. Highly secure network switches with quantum key distribution systems. Int. J. Network security 17, 34–39 (2015).

Cited by

Sorted by citations

Metadata

Authors
Fujiwara, M., Waseda, A., Nojima, R., Moriai, S., Ogata, W., & Sasaki, M.
Venue
Scientific Reports
Publisher
Springer Science and Business Media LLC
Published
2016-07-01
Volume
6
Issue
1
ISSN
2045-2322
DOI
10.1038/srep28988
PMC
PMC4929494
Cited by
35
References
1
Language
en
Licence

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