Kvantturvaline mündiviske protokoll kasutades kollaps-siduvaid kinnistusskeeme
Files
Date
2018
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Kinnitusskeem on laualt kasutatav krüptograafiline primitiiv, mida kasutatakse ulatuslikult erinevates rakendustes, alates teabetust tõestustest turvalise arvutamiseni. Klassikalises krüptograafias on kasutusel kanoonilised definitsioonid, mis on tõestatult arvutuslikult turvalised. Seevastu kvantkrüptograafias ei leidu kanooniliselt kasutatavaid kinnitusskeemide turvadefinitsioone, mis oleksid tõestatavalt turvalised ning lihtsalt kasutatavad. [Dominique Unruh, Computationally Binding Quantum Commitments, EUROCRYPT 2016] esitles definitsiooni, mida kutsutakse „kollaps-siduvaks“, mida saaks kasutada turvadefinitsioonina kvantkinnistusskeemides. Selles töös tutvustatakse nii klassikalise krüptograafia kinnistusskeemides kasutatavaid turvadefinitsioone kui ka kvantkrüptograafia alternatiive. Kollaps-siduvate protokollide eelised eelnevate definitsioonide ees tuuakse välja, illustreerides kollaps-siduvate protokollide kasutusvõimalust kvantturvalises mündiviske protokollis.
Commitment schemes are a widely used cryptographic primitive that is used in a number of important applications, from zero-knowledge proofs to secure computation. In a classical setting, there are canonical security definitions that are proven to provide security against computationally bounded adversaries. Yet, there are no canonical security definitions that are provably secure and easy to use in the quantum case. One such definition for the quan-tum setting was proposed in [Dominique Unruh, Computationally Binding Quantum Commitments, EUROCRYPT 2016]. This paper presents the classical security definitions of commitment schemes, as well as the alternatives in the quantum setting. The advantages of the proposed security definition, called “collapse-binding” are presented, with an exam-ple use case in a quantum-secure coin toss protocol.
Commitment schemes are a widely used cryptographic primitive that is used in a number of important applications, from zero-knowledge proofs to secure computation. In a classical setting, there are canonical security definitions that are proven to provide security against computationally bounded adversaries. Yet, there are no canonical security definitions that are provably secure and easy to use in the quantum case. One such definition for the quan-tum setting was proposed in [Dominique Unruh, Computationally Binding Quantum Commitments, EUROCRYPT 2016]. This paper presents the classical security definitions of commitment schemes, as well as the alternatives in the quantum setting. The advantages of the proposed security definition, called “collapse-binding” are presented, with an exam-ple use case in a quantum-secure coin toss protocol.