Linearly-homomorphic signatures and scalable mix-nets
From MaRDI portal
Publication:2055710
DOI10.1007/978-3-030-45388-6_21zbMath1481.94143OpenAlexW3022001663MaRDI QIDQ2055710
Duong Hieu Phan, Chloé Hébant, David Pointcheval
Publication date: 1 December 2021
Full work available at URL: https://hal.inria.fr/hal-02947353/file/2019-547.pdf
Related Items (3)
Traceable constant-size multi-authority credentials ⋮ Traceable constant-size multi-authority credentials ⋮ Linearly-homomorphic signatures and scalable mix-nets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient pairing-based shuffle argument
- Compact multi-signatures for smaller blockchains
- Linearly-homomorphic signatures and scalable mix-nets
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Computing on Authenticated Data
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Malleable Proof Systems and Applications
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Homomorphic Signatures for Polynomial Functions
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Signatures on Randomizable Ciphertexts
- Batch Groth–Sahai
- Structure-Preserving Signatures and Commitments to Group Elements
- The Uber-Assumption Family
- Signing a Linear Subspace: Signature Schemes for Network Coding
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- A Non-interactive Shuffle with Pairing Based Verifiability
- Batch Verification of Short Signatures
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- Efficient Non-interactive Proof Systems for Bilinear Groups
This page was built for publication: Linearly-homomorphic signatures and scalable mix-nets
