Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
From MaRDI portal
Recommendations
- Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
- Optimal structure-preserving signatures. (Abstract)
- Improved structure preserving signatures under standard bilinear assumptions
- Information Security and Privacy
- Information Security and Cryptology
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures and commitments to group elements
- Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures
- Lower bounds on structure-preserving signatures for bilateral messages
Cited in
(59)- On the impossibility of structure-preserving deterministic primitives
- How low can you go? short structure-preserving signatures for Diffie-Hellman vectors
- Lower bounds on structure-preserving signatures for bilateral messages
- Transferable e-cash: a cleaner model and the first practical instantiation
- Partially structure-preserving signatures: lower bounds, constructions and more
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Further lower bounds for structure-preserving signatures in asymmetric bilinear groups
- Efficient fully structure-preserving signatures and shrinking commitments
- Short tightly secure signatures for signing a vector of group elements: a new approach
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Practical dynamic group signatures without knowledge extractors
- On the impossibility of purely algebraic signatures
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- Scalable Divisible E-cash
- Cryptanalysis of the structure-preserving signature scheme on equivalence classes from Asiacrypt 2014
- Short structure-preserving signatures
- Efficient fully structure-preserving signatures for large messages
- Type 2 structure-preserving signature schemes revisited
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Linicrypt: a model for practical cryptography
- Structure-preserving signatures from type II pairings
- Structure-preserving signatures and commitments to group elements
- A new hash-and-sign approach and structure-preserving signatures from DLIN
- Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
- Generalizing efficient multiparty computation
- Fully structure-preserving signatures and shrinking commitments
- Structure-preserving smooth projective hashing
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Tightly secure signatures and public-key encryption
- Optimal structure-preserving signatures. (Abstract)
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Breaking and fixing anonymous credentials for the cloud
- Practical Round-Optimal Blind Signatures in the Standard Model
- Structure-preserving signatures from standard assumptions, revisited
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Structure-preserving signatures and commitments to group elements
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Tagged one-time signatures: tight security and optimal tag size
- Simplified small exponent test for batch verification
- UC Updatable Databases and Applications
- Access Control Encryption for Equality, Comparison, and More
- Improved structure preserving signatures under standard bilinear assumptions
- Cut down the tree to achieve constant complexity in divisible e-cash
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Compact structure-preserving signatures with almost tight security
- Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs
- Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency
- Threshold structure-preserving signatures
- Practical round-optimal blind signatures in the ROM from standard assumptions
- On proving equivalence class signatures secure from non-interactive assumptions
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Breaking parallel ROS: implication for isogeny and lattice-based blind signatures
- On structure-preserving cryptography and lattices
- Interactive threshold mercurial signatures and applications
- On security proofs of existing equivalence class signature schemes
- Anonymous reputation systems with revocation, revisited
- The uber-knowledge assumption: a bridge to the AGM
- Anonymous reputation systems with revocation, revisited
- Linearly homomorphic structure-preserving signatures and their applications
This page was built for publication: Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199218)
