Quantum commitments from complexity assumptions (Q260394): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3166192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic distinguishability measures for quantum-mechanical states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: QIP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3605723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fidelity for Mixed Quantum States / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computations: algorithms and error correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4544834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Arthur-Merlin games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing Arthur-Merlin games using hitting sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787522 / 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
Property / cites work
 
Property / cites work: Completely Bounded Maps between C<sup>∗</sup> -Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unconditional Study of Computational Zero Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE has constant-round quantum interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge against quantum attacks / rank
 
Normal rank

Latest revision as of 16:17, 11 July 2024

scientific article
Language Label Description Also known as
English
Quantum commitments from complexity assumptions
scientific article

    Statements

    Quantum commitments from complexity assumptions (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers