Constant-size structure-preserving signatures: generic constructions and simple assumptions
From MaRDI portal
Publication:321316
DOI10.1007/s00145-015-9211-7zbMath1365.94395OpenAlexW869862489MaRDI QIDQ321316
Bernardo David, Markulf Kohlweiss, Masayuki Abe, Melissa Chase, Miyako Ohkubo, Ryo Nishimaki
Publication date: 13 October 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://link.springer.com/article/10.1007%2Fs00145-015-9211-7
structure-preserving signaturesextended random message attackspartially one-time signaturestagged one-time signatures
Related Items (11)
A positive and bounded convergent scheme for general space-fractional diffusion-reaction systems with inertial times ⋮ PAPR: publicly auditable privacy revocation for anonymous credentials ⋮ DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Compact structure-preserving signatures with almost tight security ⋮ Implementing, and keeping in check, a DSL used in E-learning ⋮ Aggregatable distributed key generation ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions
Cites Work
- Shorter identity-based encryption via asymmetric pairings
- A simpler construction of CCA2-secure public-key encryption under general assumptions
- Pairings for cryptographers
- An efficient existentially unforgeable signature scheme and its applications
- A framework for universally composable non-committing blind signatures
- On-line/off-line digital signatures
- Malleable Proof Systems and Applications
- Scalable Group Signatures with Revocation
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
- Tightly Secure Signatures and Public-Key Encryption
- Practical Adaptive Oblivious Transfer from Simple Assumptions
- Commuting Signatures and Verifiable Encryption
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Randomizable Proofs and Delegatable Anonymous Credentials
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Anonymous Proxy Signatures
- Fair Blind Signatures without Random Oracles
- Structure-Preserving Signatures and Commitments to Group Elements
- Universally Composable Adaptive Oblivious Transfer
- Group Encryption: Non-interactive Realization in the Standard Model
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Nonmalleable Cryptography
- Efficient Noninteractive Proof Systems for Bilinear Groups
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Advances in Cryptology – CRYPTO 2004
- Group Signatures with Efficient Concurrent Join
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Topics in Cryptology – CT-RSA 2005
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constant-size structure-preserving signatures: generic constructions and simple assumptions
