Non-interactive composition of sigma-protocols via Share-then-Hash
From MaRDI portal
Publication:2691604
DOI10.1007/978-3-030-64840-4_25OpenAlexW3112203384MaRDI QIDQ2691604
Alon Rosen, Masayuki Abe, Miyako Ohkubo, Miguel Ambrona, Andrej Bogdanov
Publication date: 29 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_25
Related Items (5)
A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Resumable zero-knowledge for circuits from symmetric key primitives ⋮ DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF ⋮ Acyclicity programming for sigma-protocols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Non-interactive zero-knowledge proofs for composite statements
- Traceable ring signatures with post-quantum security
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Signatures from sequential-OR proofs
- Logarithmic-size ring signatures with tight security from the DDH assumption
- New code-based privacy-preserving cryptographic constructions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- Ring signatures: logarithmic-size, no setup -- from standard assumptions
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
- Sub-linear Blind Ring Signatures without Random Oracles
- On the Non-malleability of the Fiat-Shamir Transform
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Signatures Resilient to Continual Leakage on Memory and Computation
- The random oracle methodology, revisited
- A new paradigm for public key identification
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- A CDH-Based Ring Signature Scheme with Short Signatures and Public Keys
- Perfect Non-interactive Zero Knowledge for NP
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Provably Secure Code-Based Threshold Ring Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- 1-out-of-n Signatures from a Variety of Keys
- Efficient Noninteractive Proof Systems for Bilinear Groups
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Short Accountable Ring Signatures Based on DDH
- Round Optimal Blind Signatures
- Fiat-Shamir: from practice to theory
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
- Advances in Cryptology - EUROCRYPT 2004
- Ring Signatures of Sub-linear Size Without Random Oracles
- Mesh Signatures
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Information Security and Cryptology - ICISC 2003
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Efficient Ring Signatures Without Random Oracles
This page was built for publication: Non-interactive composition of sigma-protocols via Share-then-Hash
