How to Use Pseudorandom Generators in Unconditional Security Settings

Author(s):  
Koji Nuida
2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Byoung S. Ham

AbstractSo far, unconditional security in key distribution processes has been confined to quantum key distribution (QKD) protocols based on the no-cloning theorem of nonorthogonal bases. Recently, a completely different approach, the unconditionally secured classical key distribution (USCKD), has been proposed for unconditional security in the purely classical regime. Unlike QKD, both classical channels and orthogonal bases are key ingredients in USCKD, where unconditional security is provided by deterministic randomness via path superposition-based reversible unitary transformations in a coupled Mach–Zehnder interferometer. Here, the first experimental demonstration of the USCKD protocol is presented.


2012 ◽  
Vol 10 (04) ◽  
pp. 1250041 ◽  
Author(s):  
XUN-RU YIN ◽  
WEN-PING MA ◽  
WEI-YAN LIU

A quantum proxy group signature scheme is proposed with χ-type entangled states. Our scheme combines the properties of group signature and proxy signature. Moreover, the particles in the χ-type state sequence are used to distribute proxy warrants and quantum keys in the initial phase, and then used for quantum signature. Therefore it increases the utilization rate of quantum resources compared with the general quantum signature scheme. Finally, the unconditional security of our scheme is also analyzed.


2014 ◽  
Vol 554 ◽  
pp. 50-63 ◽  
Author(s):  
Joshua Baron ◽  
Yuval Ishai ◽  
Rafail Ostrovsky

2013 ◽  
Vol 42 (3) ◽  
pp. 1051-1076 ◽  
Author(s):  
Parikshit Gopalan ◽  
Raghu Meka ◽  
Omer Reingold ◽  
David Zuckerman

2015 ◽  
Vol 26 (02) ◽  
pp. 169-194 ◽  
Author(s):  
Koji Nuida ◽  
Takuro Abe ◽  
Shizuo Kaji ◽  
Toshiaki Maeno ◽  
Yasuhide Numata

In this paper, we specify a class of mathematical problems, which we refer to as “Function Density Problems” (FDPs, in short), and point out novel connections of FDPs to the following two cryptographic topics; theoretical security evaluations of keyless hash functions (such as SHA-1), and constructions of provably secure pseudorandom generators (PRGs) with some enhanced security property introduced by Dubrov and Ishai (STOC 2006). Our argument aims at proposing new theoretical frameworks for these topics (especially for the former) based on FDPs, rather than providing some concrete and practical results on the topics. We also give some examples of mathematical discussions on FDPs, which would be of independent interest from mathematical viewpoints. Finally, we discuss possible directions of future research on other crypto-graphic applications of FDPs and on mathematical studies on FDPs themselves.


Sign in / Sign up

Export Citation Format

Share Document