Cryptography IEEE 2015 Projects

Web : www.kasanpro.com     Email : sales@kasanpro.com

List Link : http://kasanpro.com/projects-list/cryptography-ieee-2015-projects

Title :Differential Phase-Shift Quantum Key Distribution SystemsLanguage : C#Project Link : http://kasanpro.com/p/c-sharp/differential-phase-shift-quantum-key-distribution-systemAbstract : Differential phase-shift (DPS) quantum key distribution (QKD) is a unique QKD protocol that is differentfrom traditional ones, featuring simplicity and practicality. This paper overviews DPS-QKD systems.

Title :Differential Phase-Shift Quantum Key Distribution SystemsLanguage : JavaProject Link : http://kasanpro.com/p/java/differential-phase-shift-quantum-key-distribution-systemsAbstract : Differential phase-shift (DPS) quantum key distribution (QKD) is a unique QKD protocol that is differentfrom traditional ones, featuring simplicity and practicality. This paper overviews DPS-QKD systems.

Title :Safeguarding Quantum Key Distribution Through Detection RandomizationLanguage : JavaProject Link : http://kasanpro.com/p/java/safeguarding-quantum-key-distribution-through-detection-randomizationAbstract : We propose and experimentally demonstrate a scheme to render the detection apparatus of a quantumkey distribution system immune to the main classes of hacking attacks in which the eavesdropper explores theback-door opened by the single-photon detectors. The countermeasure is based on the creation of modes that are notdeterministically accessible to the eavesdropper. We experimentally show that the use of beamsplitters and extrasingle-photon detectors at the receiver station passively creates randomized spatial modes that erase any knowledgethe eavesdropper might have gained when using bright-light faked states. Additionally, we experimentally show adetectorscrambling approach where the random selection of the detector used for each measurement--equivalent toan active spatial mode randomization--hashes out the side-channel open by the detection efficiency mismatch-basedattacks. The proposed combined countermeasure represents a practical and readily implementable solution againstthe main classes of quantum hacking attacks aimed on the single-photon detector so far, without intervening on theinner working of the devices.

Cryptography IEEE 2015 Projects

Title :Safeguarding Quantum Key Distribution Through Detection RandomizationLanguage : C#Project Link : http://kasanpro.com/p/c-sharp/quantum-key-distribution-safeguarding-through-detection-randomizationAbstract : We propose and experimentally demonstrate a scheme to render the detection apparatus of a quantumkey distribution system immune to the main classes of hacking attacks in which the eavesdropper explores theback-door opened by the single-photon detectors. The countermeasure is based on the creation of modes that are notdeterministically accessible to the eavesdropper. We experimentally show that the use of beamsplitters and extrasingle-photon detectors at the receiver station passively creates randomized spatial modes that erase any knowledgethe eavesdropper might have gained when using bright-light faked states. Additionally, we experimentally show adetectorscrambling approach where the random selection of the detector used for each measurement--equivalent toan active spatial mode randomization--hashes out the side-channel open by the detection efficiency mismatch-basedattacks. The proposed combined countermeasure represents a practical and readily implementable solution againstthe main classes of quantum hacking attacks aimed on the single-photon detector so far, without intervening on theinner working of the devices.

Title :Postprocessing of the Oblivious Key in Quantum Private QueryLanguage : C#Project Link : http://kasanpro.com/p/c-sharp/postprocessing-oblivious-key-quantum-private-queryAbstract : Private query is a kind of cryptographic protocols to protect both users' privacies in their communication.For instance, Alice wants to buy one item from Bob's database. The aim of private query is to ensure that Alice canget only one item from Bob, and simultaneously, Bob cannot know which one was taken by Alice. In pursuing highsecurity and efficiency, some quantum private query protocols were proposed. As a practical model, Quantum-Oblivious-Key-Transfer (QOKT)-based private query, which utilizes a QOKT protocol to distribute oblivious keybetween Alice and Bob and then applies the key to achieve the aim of private query, has drawn much attention. Here,we focus on postprocessing of the oblivious key, and the following two contributions are achieved. 1) We analyzethree recently proposed dilution methods and find two of them have serious security loophole. That is, Alice canillegally obtain much additional information about Bob's database by multiple queries. For example, Alice can obtain

the whole database, which contains 104 items, by only 53.4 queries averagely. 2) We present an effectiveerror-correction method for the oblivious key, which can address the realistic scenario with channel noises and makeQOKT-based private query more practical.

Title :Postprocessing of the Oblivious Key in Quantum Private QueryLanguage : JavaProject Link : http://kasanpro.com/p/java/oblivious-key-postprocessing-quantum-private-queryAbstract : Private query is a kind of cryptographic protocols to protect both users' privacies in their communication.For instance, Alice wants to buy one item from Bob's database. The aim of private query is to ensure that Alice canget only one item from Bob, and simultaneously, Bob cannot know which one was taken by Alice. In pursuing highsecurity and efficiency, some quantum private query protocols were proposed. As a practical model, Quantum-Oblivious-Key-Transfer (QOKT)-based private query, which utilizes a QOKT protocol to distribute oblivious keybetween Alice and Bob and then applies the key to achieve the aim of private query, has drawn much attention. Here,we focus on postprocessing of the oblivious key, and the following two contributions are achieved. 1) We analyzethree recently proposed dilution methods and find two of them have serious security loophole. That is, Alice canillegally obtain much additional information about Bob's database by multiple queries. For example, Alice can obtainthe whole database, which contains 104 items, by only 53.4 queries averagely. 2) We present an effectiveerror-correction method for the oblivious key, which can address the realistic scenario with channel noises and makeQOKT-based private query more practical.

Cryptography IEEE 2015 Projects