Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
From MaRDI portal
Publication:2416940
DOI10.1007/s10623-018-0535-9zbMath1445.94018OpenAlexW2886557907WikidataQ122733297 ScholiaQ122733297MaRDI QIDQ2416940
Publication date: 24 May 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0535-9
ring signatures(universal) designated verifier signatureskey-homomorphic signaturesmulti-user signaturesmultisignaturessimulation-sound extractable non-interactive zero-knowledge
Related Items
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes, On the multi-user security of short Schnorr signatures with preprocessing, Obtaining simulation extractable NIZKs in the updatable CRS model generically, Updatable NIZKs from non-interactive zaps, Updatable signatures and message authentication codes, Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security of BLS and BGLS signatures in a multi-user setting
- Security of signature schemes in a multi-user setting
- Comparing two pairing-based aggregate signature schemes
- Ring signatures: Stronger definitions, and constructions without random oracles
- Efficient signature generation by smart cards
- Efficient ring signatures in the standard model
- Short signatures from the Weil pairing
- Signer-anonymous designated-verifier redactable signatures for cloud-based data sharing
- Public key signatures in the multi-user setting.
- Anonymous single-round server-aided verification
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Strengthening zero-knowledge protocols using signatures
- Cryptographic Assumptions: A Position Paper
- Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys
- Short Randomizable Signatures
- Short Structure-Preserving Signatures
- On the Security of the Schnorr Signature Scheme and DSA Against Related-Key Attacks
- Tightly CCA-Secure Encryption Without Pairings
- Foundations of Fully Dynamic Group Signatures
- Optimal Security Proofs for Signatures from Identification Schemes
- Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines
- Key Homomorphic PRFs and Their Applications
- Efficient Signatures of Knowledge and DAA in the Standard Model
- New and Improved Key-Homomorphic Pseudorandom Functions
- Structure-Preserving Signatures from Type II Pairings
- Designated Verifier Proofs and Their Applications
- Computing on Authenticated Data
- Bounded-Collusion IBE from Key Homomorphism
- Homomorphic Signatures and Message Authentication Codes
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Leveled Fully Homomorphic Signatures from Standard Lattices
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Homomorphic Encryption: From Private-Key to Public-Key
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Cryptography Secure against Related-Key Attacks and Tampering
- Practical Round-Optimal Blind Signatures in the Standard Model
- Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
- Trapdoors for hard lattices and new cryptographic constructions
- Structure-Preserving Signatures and Commitments to Group Elements
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Digital Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size
- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
- Fully homomorphic encryption using ideal lattices
- Key-Homomorphic Constrained Pseudorandom Functions
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Bounded-Collusion Identity-Based Encryption from Semantically-Secure Public-Key Encryption: Generic Constructions with Short Ciphertexts
- Fine-Tuning Groth-Sahai Proofs
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Advances in Cryptology - CRYPTO 2003
- Ring Signatures of Sub-linear Size Without Random Oracles
- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions
- On the Impossibility of Tight Cryptographic Reductions
- On Signatures of Knowledge
- Advances in Cryptology - ASIACRYPT 2003
