Quantum Commitments from Complexity Assumptions (Q3012793): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2259830583 / 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: 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: Fidelity for Mixed Quantum States / 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: Quantum Arthur-Merlin games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / 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: Q3522363 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:50, 4 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
    6 July 2011
    0 references

    Identifiers