Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments (Q2891482)

From MaRDI portal
Revision as of 01:06, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
scientific article

    Statements

    Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments (English)
    0 references
    0 references
    15 June 2012
    0 references
    0 references
    additive combinatorics
    0 references
    bilinear pairings
    0 references
    circuit satisfiability
    0 references
    non-interactive zero-knowledge
    0 references
    progression-free sets
    0 references
    0 references