Computational indistinguishability between quantum states and its cryptographic application (Q434349): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 81P94 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 81P50 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6054132 / rank
 
Normal rank
Property / zbMATH Keywords
 
quantum cryptography
Property / zbMATH Keywords: quantum cryptography / rank
 
Normal rank
Property / zbMATH Keywords
 
computational indistinguishably
Property / zbMATH Keywords: computational indistinguishably / rank
 
Normal rank
Property / zbMATH Keywords
 
trapdoor
Property / zbMATH Keywords: trapdoor / rank
 
Normal rank
Property / zbMATH Keywords
 
worst-case/average-case equivalence
Property / zbMATH Keywords: worst-case/average-case equivalence / rank
 
Normal rank
Property / zbMATH Keywords
 
graph automorphism problem
Property / zbMATH Keywords: graph automorphism problem / rank
 
Normal rank
Property / zbMATH Keywords
 
quantum public-key cryptosystem
Property / zbMATH Keywords: quantum public-key cryptosystem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57310999 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055262827 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0403069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adiabatic Quantum State Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Isomorphism is in SPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Worst‐Case to Average‐Case Reductions for NP Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum algorithms for noncommutative hidden subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum mechanical algorithms for the nonabelian hidden subgroup problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of quantum coset states for graph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hidden Subgroup Problem and Quantum Computation Using Group Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3534623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient cryptographic schemes provably as secure as subset sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Indistinguishability Between Quantum States and Its Cryptographic Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Quantum Encryption Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional security in quantum cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Symmetric Group Defies Strong Fourier Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of single-qubit rotations in quantum public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lattice-based cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation and Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SECURITY OF QUANTUM KEY DISTRIBUTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism is in the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:28, 5 July 2024

scientific article
Language Label Description Also known as
English
Computational indistinguishability between quantum states and its cryptographic application
scientific article

    Statements

    Computational indistinguishability between quantum states and its cryptographic application (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum cryptography
    0 references
    computational indistinguishably
    0 references
    trapdoor
    0 references
    worst-case/average-case equivalence
    0 references
    graph automorphism problem
    0 references
    quantum public-key cryptosystem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references