Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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-030-90459-3_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3214310125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical ZAP arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-message witness indistinguishability and secure computation in the plain model from new assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Extractable One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak zero-knowledge beyond the black-box barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Weak to Strong Zero-Knowledge and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmalleable Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zaps and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Witness encryption and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating succinct non-interactive arguments from all falsifiable assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / 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: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Zaps and new oblivious transfer protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Techniques for Noninteractive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols / 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: Distinguisher-dependent simulation in two rounds and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical witness indistinguishability (and more) in two messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical ZAPR arguments from bilinear maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barriers in cryptography with weak, correlated and leaky sources / rank
 
Normal rank

Latest revision as of 19:59, 31 July 2024

scientific article
Language Label Description Also known as
English
Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
scientific article

    Statements

    Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (English)
    0 references
    0 references
    31 March 2023
    0 references
    delayed-input setting
    0 references
    delayed-input verifiers
    0 references
    0 references
    0 references
    0 references

    Identifiers