Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Anneli Lax new mathematical library

Perfect Security-One-time Pads

Abraham Sinkov, Todd Feil

Published Jan 1, 2009• 0 citations
Publisher
DOI
10.5948/upo9780883859377.007

Related papers

Asynchronous Perfectly Secure Communication over One-Time Pads

Giovanni Di Crescenzo, Aggelos Kiayias

Lecture notes in computer science•Jan 1, 2005•9 citations

On the Security and Composability of the One Time Pad

Dominik Raub, Rainer Steinwandt, Jörn Müller‐Quade

Lecture notes in computer science•Jan 1, 2005•16 citations

Information-theoretic security beyond the one-time pad

Christopher Portmann

•Jan 1, 2011•0 citations

On the Security and Composability of the One Time Pad.

Dominik Raub, Rainer Steinwandt, Jörn Müller‐Quade

Abstract. Motivated by a potentially flawed deployment of the one time pad in a recent quantumcryptographic application securing a bank transfer [12], we show how to implement a statistically secure system for message passing, that is, a channel with negligible failure rate secure againstunbounded adversaries, using a one time pad based cryptosystem. We prove the security of our system in the framework put forward by Backes, Pfitzmann, and Waidner [11, 2, 3]. 1 Introduction It is well known that the one time pad (OTP) is perfectly concealing, i.e. that given an arbitrary ciphertext c 2 {0, 1}n, the probability of any message m 2 M ` {0, 1}n is P (m|c) = P (m) where M denotes themessage space. Therefore one time pad based encryption is the obvious choice when dealing with unbounded

•Jan 1, 2004•1 citation

One time pad generation using quantum superposition states

Gaurav K. Upadhyay, Manisha J. Nene

Modern cryptography offers three goals of Confidentiality, Integrity and Availability, known as CIA triad. Confidentiality of any message or communication is secrecy of its content. All the modern cryptosystems provide cryptographic secrecy and not perfect secrecy. Two ingredients of perfect secrecy are truly random source and secure communication channel. Both are available in quantum computing paradigm. However, Quantum Computers are not yet commercially available. Certain time-tested cryptographic techniques in classical computing can be combined with principles of quantum computing to to achieve the goal of perfect secrecy. Theoretically, One Time Pad (OTP) is proven to be unconditionally secure. The paper suggests an hybrid approach to cryptography by generating OTP using quantum superposition states. The results of OTP generation are corroborated with theoretical values. The OTP so generated by realization of the suggested approach on a classical system is found to pass the test for randomness.

IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology•May 1, 2016•28 citations

Approaching Shannon's One-Time Pad: Metrics, Architectures, and Enabling Technologies

Li Sun, Xianhui Lu, Peng Liu +3 more

The rapid development of advanced computing technologies such as quantum computing imposes new challenges to current wireless security mechanism which is based on cryptographic approaches. To deal with various attacks and realize long-lasting security, we are in urgent need of disruptive security solutions. In this article, novel security transmission paradigms are proposed to approach Shannon's one-time pad perfect secrecy. First, two metrics, termed as Degree-of-Approaching (DoA) and Degree-of-Synchronous-Approaching (DoSA), are developed to characterize the closeness between the achieved security strength and perfect secrecy. These two metrics also serve as a guideline for secure transmission protocol design. After that, we present two paths towards Shannon's one-time pad, i.e., an explicit-encryption based approach and an implicit-encryption based approach. For both of them, we discuss the architecture design, enabling technologies, as well as preliminary performance evaluation results. The techniques presented in this article provide promising security-enhancing solutions for future wireless networks.

arXiv:2303.06359•Mar 11, 2023•3 citations
Abstract. Motivated by a potentially flawed deployment of the one time pad in a recent quantumcryptographic application securing a bank transfer [12], we show how to implement a statistically secure system for message passing, that is, a channel with negligible failure rate secure againstunbounded adversaries, using a one time pad based cryptosystem. We prove the security of our system in the framework put forward by Backes, Pfitzmann, and Waidner [11, 2, 3]. 1 Introduction It is well known that the one time pad (OTP) is perfectly concealing, i.e. that given an arbitrary ciphertext c 2 {0, 1}n, the probability of any message m 2 M ` {0, 1}n is P (m|c) = P (m) where M denotes themessage space. Therefore one time pad based encryption is the obvious choice when dealing with unbounded
Modern cryptography offers three goals of Confidentiality, Integrity and Availability, known as CIA triad. Confidentiality of any message or communication is secrecy of its content. All the modern cryptosystems provide cryptographic secrecy and not perfect secrecy. Two ingredients of perfect secrecy are truly random source and secure communication channel. Both are available in quantum computing paradigm. However, Quantum Computers are not yet commercially available. Certain time-tested cryptographic techniques in classical computing can be combined with principles of quantum computing to to achieve the goal of perfect secrecy. Theoretically, One Time Pad (OTP) is proven to be unconditionally secure. The paper suggests an hybrid approach to cryptography by generating OTP using quantum superposition states. The results of OTP generation are corroborated with theoretical values. The OTP so generated by realization of the suggested approach on a classical system is found to pass the test for randomness.
The rapid development of advanced computing technologies such as quantum computing imposes new challenges to current wireless security mechanism which is based on cryptographic approaches. To deal with various attacks and realize long-lasting security, we are in urgent need of disruptive security solutions. In this article, novel security transmission paradigms are proposed to approach Shannon's one-time pad perfect secrecy. First, two metrics, termed as Degree-of-Approaching (DoA) and Degree-of-Synchronous-Approaching (DoSA), are developed to characterize the closeness between the achieved security strength and perfect secrecy. These two metrics also serve as a guideline for secure transmission protocol design. After that, we present two paths towards Shannon's one-time pad, i.e., an explicit-encryption based approach and an implicit-encryption based approach. For both of them, we discuss the architecture design, enabling technologies, as well as preliminary performance evaluation results. The techniques presented in this article provide promising security-enhancing solutions for future wireless networks.