Lower bounds for non-black-box zero knowledge (Q2490264): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2005.06.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2100862778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pseudorandomness and resource-bounded measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict polynomial-time in simulation and extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for non-black-box zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on negligible functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform generation of NP-witnesses using an NP-oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials Over Large Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resettable zero-knowledge (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4880146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zaps and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform-complexity treatment of encryption and zero-knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to construct constant-round zero-knowledge proof systems for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Composition of Zero-Knowledge Proof Systems / 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: Definitions and properties of zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interactive proofs with a laconic prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3495643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249347 / 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: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds / 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: Q4071737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871218 / 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: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness is linear in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Proofs for Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete problem for statistical zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient signature generation by smart cards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with Very Weak Random Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximation Algorithms for # P / rank
 
Normal rank

Latest revision as of 12:38, 24 June 2024

scientific article
Language Label Description Also known as
English
Lower bounds for non-black-box zero knowledge
scientific article

    Statements

    Lower bounds for non-black-box zero knowledge (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Zero knowledge
    0 references
    Interactive proof systems
    0 references
    Argument systems
    0 references
    Non-black-box simulation
    0 references
    Pseudorandom generators
    0 references
    Randomness extractors
    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

    Identifiers