Providing variable levels of security in quantum cryptography

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Quantum cryptography provides perfect secrecy if the key exchanged is used for one-time-pad encryption. However, this requires very long keys which are not practical in most scenarios. Further, the key exchange bit-rate for quantum key distribution is very low. Consequently, often quantum key distribution algorithms only exchange (128, 192 or 256 bit) AES keys and then AES is used for data encryption. While Grover's algorithm will force us to only use AES-256 and does not pose a catastrophic failure to AES, AES does not provide provable security. In this paper, we discuss methods that provide provable security but at the same time the key lengths may be controlled to practical levels. Difficulty of breaking the cipher is directly proportional to the key length and depends on the specific algorithm employed. The key idea is that key lengths can be tweaked such that an acceptable and provable level of security is achieved and therefore the cipher is not reliant on any assumptions for security. The paper will discuss different ways of achieving the above goal.

Original languageEnglish (US)
Title of host publicationQuantum Communications and Quantum Imaging XVI
EditorsRonald E. Meyers, Yanhua Shih, Keith S. Deacon
PublisherSPIE
ISBN (Electronic)9781510621138
DOIs
StatePublished - Jan 1 2018
EventQuantum Communications and Quantum Imaging XVI 2018 - San Diego, United States
Duration: Aug 19 2018Aug 20 2018

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume10771
ISSN (Print)0277-786X
ISSN (Electronic)1996-756X

Other

OtherQuantum Communications and Quantum Imaging XVI 2018
CountryUnited States
CitySan Diego
Period8/19/188/20/18

Fingerprint

Quantum Cryptography
Quantum cryptography
quantum cryptography
Cryptography
Provable Security
Quantum Key Distribution
Encryption
Key Exchange
Directly proportional
Scenarios

Keywords

  • error correction codes
  • polynomial interpolation
  • quantum cryptography
  • quantum key distribution
  • variable security

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Parakh, A. (2018). Providing variable levels of security in quantum cryptography. In R. E. Meyers, Y. Shih, & K. S. Deacon (Eds.), Quantum Communications and Quantum Imaging XVI [107710R] (Proceedings of SPIE - The International Society for Optical Engineering; Vol. 10771). SPIE. https://doi.org/10.1117/12.2323204

Providing variable levels of security in quantum cryptography. / Parakh, Abhishek.

Quantum Communications and Quantum Imaging XVI. ed. / Ronald E. Meyers; Yanhua Shih; Keith S. Deacon. SPIE, 2018. 107710R (Proceedings of SPIE - The International Society for Optical Engineering; Vol. 10771).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Parakh, A 2018, Providing variable levels of security in quantum cryptography. in RE Meyers, Y Shih & KS Deacon (eds), Quantum Communications and Quantum Imaging XVI., 107710R, Proceedings of SPIE - The International Society for Optical Engineering, vol. 10771, SPIE, Quantum Communications and Quantum Imaging XVI 2018, San Diego, United States, 8/19/18. https://doi.org/10.1117/12.2323204
Parakh A. Providing variable levels of security in quantum cryptography. In Meyers RE, Shih Y, Deacon KS, editors, Quantum Communications and Quantum Imaging XVI. SPIE. 2018. 107710R. (Proceedings of SPIE - The International Society for Optical Engineering). https://doi.org/10.1117/12.2323204
Parakh, Abhishek. / Providing variable levels of security in quantum cryptography. Quantum Communications and Quantum Imaging XVI. editor / Ronald E. Meyers ; Yanhua Shih ; Keith S. Deacon. SPIE, 2018. (Proceedings of SPIE - The International Society for Optical Engineering).
@inproceedings{3e79f5eab7ed4dd08a19bb06ce672998,
title = "Providing variable levels of security in quantum cryptography",
abstract = "Quantum cryptography provides perfect secrecy if the key exchanged is used for one-time-pad encryption. However, this requires very long keys which are not practical in most scenarios. Further, the key exchange bit-rate for quantum key distribution is very low. Consequently, often quantum key distribution algorithms only exchange (128, 192 or 256 bit) AES keys and then AES is used for data encryption. While Grover's algorithm will force us to only use AES-256 and does not pose a catastrophic failure to AES, AES does not provide provable security. In this paper, we discuss methods that provide provable security but at the same time the key lengths may be controlled to practical levels. Difficulty of breaking the cipher is directly proportional to the key length and depends on the specific algorithm employed. The key idea is that key lengths can be tweaked such that an acceptable and provable level of security is achieved and therefore the cipher is not reliant on any assumptions for security. The paper will discuss different ways of achieving the above goal.",
keywords = "error correction codes, polynomial interpolation, quantum cryptography, quantum key distribution, variable security",
author = "Abhishek Parakh",
year = "2018",
month = "1",
day = "1",
doi = "10.1117/12.2323204",
language = "English (US)",
series = "Proceedings of SPIE - The International Society for Optical Engineering",
publisher = "SPIE",
editor = "Meyers, {Ronald E.} and Yanhua Shih and Deacon, {Keith S.}",
booktitle = "Quantum Communications and Quantum Imaging XVI",

}

TY - GEN

T1 - Providing variable levels of security in quantum cryptography

AU - Parakh, Abhishek

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Quantum cryptography provides perfect secrecy if the key exchanged is used for one-time-pad encryption. However, this requires very long keys which are not practical in most scenarios. Further, the key exchange bit-rate for quantum key distribution is very low. Consequently, often quantum key distribution algorithms only exchange (128, 192 or 256 bit) AES keys and then AES is used for data encryption. While Grover's algorithm will force us to only use AES-256 and does not pose a catastrophic failure to AES, AES does not provide provable security. In this paper, we discuss methods that provide provable security but at the same time the key lengths may be controlled to practical levels. Difficulty of breaking the cipher is directly proportional to the key length and depends on the specific algorithm employed. The key idea is that key lengths can be tweaked such that an acceptable and provable level of security is achieved and therefore the cipher is not reliant on any assumptions for security. The paper will discuss different ways of achieving the above goal.

AB - Quantum cryptography provides perfect secrecy if the key exchanged is used for one-time-pad encryption. However, this requires very long keys which are not practical in most scenarios. Further, the key exchange bit-rate for quantum key distribution is very low. Consequently, often quantum key distribution algorithms only exchange (128, 192 or 256 bit) AES keys and then AES is used for data encryption. While Grover's algorithm will force us to only use AES-256 and does not pose a catastrophic failure to AES, AES does not provide provable security. In this paper, we discuss methods that provide provable security but at the same time the key lengths may be controlled to practical levels. Difficulty of breaking the cipher is directly proportional to the key length and depends on the specific algorithm employed. The key idea is that key lengths can be tweaked such that an acceptable and provable level of security is achieved and therefore the cipher is not reliant on any assumptions for security. The paper will discuss different ways of achieving the above goal.

KW - error correction codes

KW - polynomial interpolation

KW - quantum cryptography

KW - quantum key distribution

KW - variable security

UR - http://www.scopus.com/inward/record.url?scp=85058275273&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85058275273&partnerID=8YFLogxK

U2 - 10.1117/12.2323204

DO - 10.1117/12.2323204

M3 - Conference contribution

AN - SCOPUS:85058275273

T3 - Proceedings of SPIE - The International Society for Optical Engineering

BT - Quantum Communications and Quantum Imaging XVI

A2 - Meyers, Ronald E.

A2 - Shih, Yanhua

A2 - Deacon, Keith S.

PB - SPIE

ER -