Computational Indistinguishability Between Quantum States and Its Cryptographic Application
From MaRDI portal
Publication:5385734
DOI10.1007/11426639_16zbMath1137.94349OpenAlexW1948799478MaRDI QIDQ5385734
Tomoyuki Yamakami, Harumichi Nishimura, Akinori Kawachi, Takeshi Koshiba
Publication date: 6 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11426639_16
Related Items (12)
Unconditionally-Secure and Reusable Public-Key Authentication ⋮ Bit-oriented quantum public-key encryption based on quantum perfect encryption ⋮ Quantum public-key encryption schemes based on conjugate coding ⋮ Post-quantum plaintext-awareness ⋮ Computational indistinguishability between quantum states and its cryptographic application ⋮ Bit-oriented quantum public key probabilistic encryption schemes ⋮ On the Power of Quantum Encryption Keys ⋮ Public-key cryptography based on bounded quantum reference frames ⋮ Quantum public key cryptosystem based on Bell states ⋮ Bit-oriented quantum public-key cryptosystem based on Bell states ⋮ Quantum walk public-key cryptographic system ⋮ Cryptographic one-way function based on boson sampling
This page was built for publication: Computational Indistinguishability Between Quantum States and Its Cryptographic Application
