Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: vSQL / rank
 
Normal rank
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-662-64322-8_19 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3208203740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive zero-knowledge proofs for composite statements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching techniques for accumulators with applications to IOPs and stateless blockchains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally composable two-party and multi-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing the Strong RSA Assumption from Arguments over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine-Tuning Groth-Sahai Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Close to Uniform Prime Number Generation with Fewer Random Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Hash-and-Sign Signatures Without the Random Oracle / 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: On the Size of Pairing-Based Non-interactive Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Non-interactive Proof Systems for Bilinear Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Accumulators with Efficient Nonmembership Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Cryptology – CT-RSA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Authenticated Data Structures / rank
 
Normal rank

Latest revision as of 09:37, 29 July 2024

scientific article
Language Label Description Also known as
English
Zero-knowledge proofs for set membership: efficient, succinct, modular
scientific article

    Statements

    Zero-knowledge proofs for set membership: efficient, succinct, modular (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 June 2022
    0 references
    0 references
    commit-and-prove zero-knowledge systems for set membership
    0 references
    software library
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references