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

Lecture notes in computer science

On the Security of Pseudorandomized Information-Theoretically Secure Schemes

Koji Nuida, Goichiro Hanaoka

Published Jan 1, 2010• 4 citations
Publisher
DOI
10.1007/978-3-642-14496-7_6

Related papers

Correlated Pseudorandomness in Secure Computation

Geoffroy Couteau

•Mar 20, 2024•0 citations

On the Security of Pseudorandomized Information-Theoretically Secure Schemes

Koji Nuida, Goichiro Hanaoka

In this paper, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computationally secure pseudorandom generator (PRG). We propose novel ideas and techniques for evaluating the indistinguishability between the random and pseudorandom cases, even against an adversary with computationally unbounded attack algorithm. Hence, the PRG-based randomness reduction can be effective even for information-theoretically secure cryptographic schemes, especially when the amount of information received by the adversary is small. In comparison to a preceding result of Dubrov and Ishai (STOC 2006), our result removes the requirement of generalized notion of “nb-PRGs” and is effective for more general kinds of protocols. We give some numerical examples to show the effectiveness of our result in practical situations, and we also propose a further idea for improving the effect of the PRG-based randomness reduction.

IEEE Transactions on Information Theory•Sep 1, 2012•6 citations

On the Security of Pseudorandomized Information-Theoretically Secure Schemes.

Koji Nuida, Goichiro Hanaoka

In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computationally secure pseudorandom generator (PRG). We propose novel ideas and techniques for evaluating the indistinguishability between the random and pseudorandom cases, even against an adversary with computationally unbounded attack algorithm. Hence the PRG-based randomness reduction can be effective even for informationtheoretically secure cryptographic schemes, especially when the amount of information received by the adversary is small. In comparison to a preceding result of Dubrov and Ishai (STOC 2006), our result removes the requirement of generalized notion of “nb-PRGs ” and is effective for more general kinds of protocols. We give some numerical examples to show the effectiveness of our result in practical situations, and we also propose a further idea for improving the effect of the PRG-based randomness reduction.

•Jan 1, 2010•0 citations

On the Impossibility of Cryptography with Tamperable Randomness

Per Austrin, Kai-Min Chung, Mohammad Mahmoody +2 more

Lecture notes in computer science•Jan 1, 2014•27 citations

On the Impossibility of Cryptography with Tamperable Randomness

Per Austrin, Kai-Min Chung, Mohammad Mahmoody +2 more

Algorithmica•Oct 5, 2016•6 citations

Receiver Originated Physical-Layer Robust Secure Transmissions in Wireless Systems

Caihong Kai, Xinyue Hu, Shengli Zhang +1 more

This letter proposes a receiver-originated physical-layer secure transmissions scheme (ROST) which consists of two-phase communications. In phase 1, the receiver sends a pseudorandom signal (only known by itself) to the transmitter and in phase 2, the transmitter directly sends out the mixture of its confidential message and the received pseudorandom signal. The receiver could estimate the channel with the help of the pseudorandom signal before cancelling it from the received mixed signal, and finally detect the confidential information. By contrast, the eavesdropper can hardly obtain any confidential information because it cannot estimate the channel without any pilot signal in both phases transmissions and is interfered by the pseudorandom signal. Furthermore, we discuss the secrecy capacity of ROST and show that ROST can always keep the security of the confidential message, achieve much higher secrecy capacity than the traditional scheme, even without any channel information at the transmitter.

IEEE Wireless Communications Letters•Sep 22, 2017•1 citation
In this paper, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computationally secure pseudorandom generator (PRG). We propose novel ideas and techniques for evaluating the indistinguishability between the random and pseudorandom cases, even against an adversary with computationally unbounded attack algorithm. Hence, the PRG-based randomness reduction can be effective even for information-theoretically secure cryptographic schemes, especially when the amount of information received by the adversary is small. In comparison to a preceding result of Dubrov and Ishai (STOC 2006), our result removes the requirement of generalized notion of “nb-PRGs” and is effective for more general kinds of protocols. We give some numerical examples to show the effectiveness of our result in practical situations, and we also propose a further idea for improving the effect of the PRG-based randomness reduction.
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computationally secure pseudorandom generator (PRG). We propose novel ideas and techniques for evaluating the indistinguishability between the random and pseudorandom cases, even against an adversary with computationally unbounded attack algorithm. Hence the PRG-based randomness reduction can be effective even for informationtheoretically secure cryptographic schemes, especially when the amount of information received by the adversary is small. In comparison to a preceding result of Dubrov and Ishai (STOC 2006), our result removes the requirement of generalized notion of “nb-PRGs ” and is effective for more general kinds of protocols. We give some numerical examples to show the effectiveness of our result in practical situations, and we also propose a further idea for improving the effect of the PRG-based randomness reduction.
This letter proposes a receiver-originated physical-layer secure transmissions scheme (ROST) which consists of two-phase communications. In phase 1, the receiver sends a pseudorandom signal (only known by itself) to the transmitter and in phase 2, the transmitter directly sends out the mixture of its confidential message and the received pseudorandom signal. The receiver could estimate the channel with the help of the pseudorandom signal before cancelling it from the received mixed signal, and finally detect the confidential information. By contrast, the eavesdropper can hardly obtain any confidential information because it cannot estimate the channel without any pilot signal in both phases transmissions and is interfered by the pseudorandom signal. Furthermore, we discuss the secrecy capacity of ROST and show that ROST can always keep the security of the confidential message, achieve much higher secrecy capacity than the traditional scheme, even without any channel information at the transmitter.