Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications (Q5087262): 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-030-97121-2_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4214722479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: More efficient commitments from structured lattice assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short lattice-based one-out-of-many proofs and applications to ring signatures / 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: One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Signatures without Trapdoors / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Shot Verifiable Encryption from Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Auto-recoverable auto-certifiable cryptosystems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:48, 29 July 2024

scientific article; zbMATH DE number 7554916
Language Label Description Also known as
English
Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
scientific article; zbMATH DE number 7554916

    Statements

    Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications (English)
    0 references
    0 references
    0 references
    0 references
    8 July 2022
    0 references
    0 references
    lattice
    0 references
    zero-knowledge
    0 references
    verifiable partially-decryptable commitment
    0 references
    auditable ringct
    0 references
    accountable ring signature
    0 references
    0 references