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

Practical implementation and analysis of hyper-encryption

Jason K Juang

Published Jan 1, 2009• 4 citations
OpenAlex

Abstract

The security of modern cryptographic schemes relies on limits on computational power and assumptions about the difficulty of certain mathematical problems, such as integer factorization. This thesis describes hyper-encryption in the limited access model, a system that provides perfect secrecy and authentication against an adversary who possesses unbounded computational power, but who is limited in the ability to eavesdrop on more than a fraction of computers in a large network, such as the Internet.

Related papers

Theoretical advances in practical quantum cryptography

Jérémy Ribeiro

Most of themainstream cryptographic protocols that are used today rely on the assumption that the adversary has limited computational power, and that a given set of mathematical problems is hard to solve (on average), i.e. that there is no polynomial time algorithm that solves these problems. While these assumptions are reasonable for now they might not be as relevant for long termsecurity. Indeed, all the communication that happens today can be recorded by an adversary who can later – when the technology allows it – break security. There are good reasons to think that technological progress may lead to break the assumptions made today. For example the rapidly increasing computational power of our computer already allows one to break anything that has been encrypted using DES in the 70s and 80s in few days using regular desktop type devices. There is also the constant improvement of the efficiency of the known algorithms that solve a class of problems. Note that, even though the discovery of a polynomial algorithm for a problem we believe to be hard is still possible, much weaker improvements on current algorithms that solve these hard problems, can already be a threat for security.

•Feb 27, 2020•0 citations

Provable everlasting security in the bounded storage model

Michael O. Rabin, Yan Zong Ding

Traditional modern cryptography relies on unproven complexity assumptions that certain problems, such as integer factorization, are computationally hard, and the adversary is bounded in computing power. However, advances in algorithms and computing technology may render current cryptosystems insecure, and lead to the decryption of past secret messages. On the other hand, Shannon's pessimistic negative result essentially implies that if the adversary is all-powerful and has complete access to the communication line, then efficient practical solutions for information-theoretic security do not exist. This thesis is a study of cryptography in the bounded storage model, where provable everlasting security can be achieved efficiently without any complexity assumption. It first presents an efficient scheme for encryption and authentication that is provably secure against strong adaptive attacks, by an adversary who is computationally unbounded and only storage-bounded. A major new result is that the shared secret key employed by the sender and the receiver can be re-used to send an exponential number of messages. Our encryption scheme further enjoys the surprising property that even if the secret key is captured by the adversary after the transmission of the ciphertext, the secrecy of the message is assured. The above is joint work with Michael Rabin. Oblivious transfer is a cryptographic protocol that can serve as a basic primitive for all of cryptography. This thesis presents an implementation of oblivious transfer in the bounded storage model, which is again provably secure without complexity assumption.

•Jan 1, 2001•7 citations

Securing IoT Devices against Quantum Threats:Developing a Framework for Future-Proof Encryption

Noor Thamer Mahmood

Quantum Computers are designed to be sufficiently large to be able to efficiently solve specific problems that would take an impractical amount of time to solve using classical computers. The most widely discussed application of quantum computing technology is more powerful algorithms, which efficiently solves all instances of integer factorization—a number theoretic problem that is the foundation of the most of the existing public-key encryption schemes. This means that all public-key cryptographic systems commonly used on the Internet for security will become as insecure as an open communication channel, easy to eavesdrop on or to tamper with. Moreover, traffic passes through numerous fixed, mobile and personal sensors connected to the Internet. This extremely large amount of data becomes the “air” of IoT and only a small part of it will be automatically analysed for a specific purpose. Nevertheless, an important part of the immense amount of data exchanged across the network is sensitive. Presently, these data communication and storage are protected by encryption, but that means of protection will be lost to a future quantum adversary. Because of these urgent necessities, products implementing quantum-resistant security solutions can be built and put into operation in a “post-quantum world”. This must be done now because cryptography research is currently inventing and standardizing new cryptographic algorithms. Once the new algorithms are widely and publicly agreed upon, systems with old encryption will remain vulnerable. This topic is motivated by the above.

CyberSystem journal.•Dec 31, 2025•0 citations

Degrees of freedom of the field in unconditionally secure wireless communications

Marco Donald Migliore, C. D'Elia, Daniele Pinchera

The fast growing of personal wireless communications, and the spreading of new services like Internet banking on mobile phones, has made the preventing unauthorized extraction of information a key problem for wireless systems. However, all the ciphering algorithms developed since now can be broken under an attack with unlimited computational resource. Consequently, the final goal of the cryptography is the developing of an unconditionally secure cryptographic system able to resist to any cryptanalytic attack, no matter how much computation power is available.

Digest - IEEE Antennas and Propagation Society. International Symposium•Jul 1, 2010•0 citations

An Analysis of a Cryptographic Communication Protocol

Maria Strand

We have considered a cryptographic communication protocol and given a proof for its security.

66•Jan 1, 2010•0 citations

On the Theory and Practice of Quantum-Immune Cryptography

Martin Döring

Public-key cryptography is a key technology for making the Internet and other IT infrastructures secure. The security of the established public-key cryptosystems relies on the difficulty of factoring large composite integers or computing discrete logarithms. However, it is unclear whether these computational problems remain intractable in the future. For example, Shor showed in 1994 that quantum computers can be used to factor integers and to compute discrete logarithms in polynomial time. It is therefore necessary to develop alternative public-key cryptosystems which do not rely on the difficulty of factoring or computing discrete logarithms and which are secure even against quantum computer attacks. We call such cryptosystems quantum-immune. To prove the security of these quantum-immune cryptosystems, appropriate security models have to be used. Since quantum computers are able to solve problems in polynomial time which are supposed to be intractable for classical computers, the existing security models are inadequate in the presence of quantum adversaries. Therefore, new security models have to be developed to capture quantum adversaries. Properties of these new security models have to be investigated. On a more practical level, the quantum-immune cryptosystems have to be implemented in a way that they can seamlessly replace established cryptosystems. The implementations have to be efficient and suitable for resource-constrained devices. They must easily integrate into existing public-key infrastructures. This thesis contributes to both the theory and practice of quantum-immune cryptography, addressing the above-mentioned challenges. In the theoretical part, we concentrate on the quantum zero-knowledge property of interactive proof systems. We show for the first time that the quantum statistical, perfect, and computational zero-knowledge properties are preserved under sequential composition of interactive proof systems. In the practical part, we provide implementations of the most important quantum-immune cryptosystems. We present efficiency improvements of some of the alternative cryptosystems. The implementations are very efficient and easily integrate into existing public-key infrastructures. We present comprehensive timings that show that the alternative cryptosystems are competitive or even superior compared to established cryptosystems. Finally, we present a new cryptographic API that is particularly well-suited for resource-constrained devices like mobile phones and PDAs. With this API, the alternative cryptosystems can also be used with these devices.

•Jan 1, 2008•1 citation
The security of modern cryptographic schemes relies on limits on computational power and assumptions about the difficulty of certain mathematical problems, such as integer factorization. This thesis describes hyper-encryption in the limited access model, a system that provides perfect secrecy and authentication against an adversary who possesses unbounded computational power, but who is limited in the ability to eavesdrop on more than a fraction of computers in a large network, such as the Internet.
Most of themainstream cryptographic protocols that are used today rely on the assumption that the adversary has limited computational power, and that a given set of mathematical problems is hard to solve (on average), i.e. that there is no polynomial time algorithm that solves these problems. While these assumptions are reasonable for now they might not be as relevant for long termsecurity. Indeed, all the communication that happens today can be recorded by an adversary who can later – when the technology allows it – break security. There are good reasons to think that technological progress may lead to break the assumptions made today. For example the rapidly increasing computational power of our computer already allows one to break anything that has been encrypted using DES in the 70s and 80s in few days using regular desktop type devices. There is also the constant improvement of the efficiency of the known algorithms that solve a class of problems. Note that, even though the discovery of a polynomial algorithm for a problem we believe to be hard is still possible, much weaker improvements on current algorithms that solve these hard problems, can already be a threat for security.
Traditional modern cryptography relies on unproven complexity assumptions that certain problems, such as integer factorization, are computationally hard, and the adversary is bounded in computing power. However, advances in algorithms and computing technology may render current cryptosystems insecure, and lead to the decryption of past secret messages. On the other hand, Shannon's pessimistic negative result essentially implies that if the adversary is all-powerful and has complete access to the communication line, then efficient practical solutions for information-theoretic security do not exist. This thesis is a study of cryptography in the bounded storage model, where provable everlasting security can be achieved efficiently without any complexity assumption. It first presents an efficient scheme for encryption and authentication that is provably secure against strong adaptive attacks, by an adversary who is computationally unbounded and only storage-bounded. A major new result is that the shared secret key employed by the sender and the receiver can be re-used to send an exponential number of messages. Our encryption scheme further enjoys the surprising property that even if the secret key is captured by the adversary after the transmission of the ciphertext, the secrecy of the message is assured. The above is joint work with Michael Rabin. Oblivious transfer is a cryptographic protocol that can serve as a basic primitive for all of cryptography. This thesis presents an implementation of oblivious transfer in the bounded storage model, which is again provably secure without complexity assumption.
Quantum Computers are designed to be sufficiently large to be able to efficiently solve specific problems that would take an impractical amount of time to solve using classical computers. The most widely discussed application of quantum computing technology is more powerful algorithms, which efficiently solves all instances of integer factorization—a number theoretic problem that is the foundation of the most of the existing public-key encryption schemes. This means that all public-key cryptographic systems commonly used on the Internet for security will become as insecure as an open communication channel, easy to eavesdrop on or to tamper with. Moreover, traffic passes through numerous fixed, mobile and personal sensors connected to the Internet. This extremely large amount of data becomes the “air” of IoT and only a small part of it will be automatically analysed for a specific purpose. Nevertheless, an important part of the immense amount of data exchanged across the network is sensitive. Presently, these data communication and storage are protected by encryption, but that means of protection will be lost to a future quantum adversary. Because of these urgent necessities, products implementing quantum-resistant security solutions can be built and put into operation in a “post-quantum world”. This must be done now because cryptography research is currently inventing and standardizing new cryptographic algorithms. Once the new algorithms are widely and publicly agreed upon, systems with old encryption will remain vulnerable. This topic is motivated by the above.
The fast growing of personal wireless communications, and the spreading of new services like Internet banking on mobile phones, has made the preventing unauthorized extraction of information a key problem for wireless systems. However, all the ciphering algorithms developed since now can be broken under an attack with unlimited computational resource. Consequently, the final goal of the cryptography is the developing of an unconditionally secure cryptographic system able to resist to any cryptanalytic attack, no matter how much computation power is available.
Public-key cryptography is a key technology for making the Internet and other IT infrastructures secure. The security of the established public-key cryptosystems relies on the difficulty of factoring large composite integers or computing discrete logarithms. However, it is unclear whether these computational problems remain intractable in the future. For example, Shor showed in 1994 that quantum computers can be used to factor integers and to compute discrete logarithms in polynomial time. It is therefore necessary to develop alternative public-key cryptosystems which do not rely on the difficulty of factoring or computing discrete logarithms and which are secure even against quantum computer attacks. We call such cryptosystems quantum-immune. To prove the security of these quantum-immune cryptosystems, appropriate security models have to be used. Since quantum computers are able to solve problems in polynomial time which are supposed to be intractable for classical computers, the existing security models are inadequate in the presence of quantum adversaries. Therefore, new security models have to be developed to capture quantum adversaries. Properties of these new security models have to be investigated. On a more practical level, the quantum-immune cryptosystems have to be implemented in a way that they can seamlessly replace established cryptosystems. The implementations have to be efficient and suitable for resource-constrained devices. They must easily integrate into existing public-key infrastructures. This thesis contributes to both the theory and practice of quantum-immune cryptography, addressing the above-mentioned challenges. In the theoretical part, we concentrate on the quantum zero-knowledge property of interactive proof systems. We show for the first time that the quantum statistical, perfect, and computational zero-knowledge properties are preserved under sequential composition of interactive proof systems. In the practical part, we provide implementations of the most important quantum-immune cryptosystems. We present efficiency improvements of some of the alternative cryptosystems. The implementations are very efficient and easily integrate into existing public-key infrastructures. We present comprehensive timings that show that the alternative cryptosystems are competitive or even superior compared to established cryptosystems. Finally, we present a new cryptographic API that is particularly well-suited for resource-constrained devices like mobile phones and PDAs. With this API, the alternative cryptosystems can also be used with these devices.