Structure-preserving signatures and commitments to group elements

DOI10.1007/978-3-642-14623-7_12MaRDI QIDQ3582756zbMATH OpenOpenAlexFDO

Authors Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo

Publication date 24 August 2010

Published in Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14623-7_12

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Structure-preserving signatures and commitments to group elements
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Fully structure-preserving signatures and shrinking commitments
• Efficient fully structure-preserving signatures and shrinking commitments
• Constant-size structure-preserving signatures: generic constructions and simple assumptions

Cited in

(only showing first 100 items - show all)

• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Private set-intersection with common set-up
• Linearly-homomorphic signatures and scalable mix-nets
• Transferable e-cash: a cleaner model and the first practical instantiation
• Partially structure-preserving signatures: lower bounds, constructions and more
• Selectively linkable group signatures -- stronger security and preserved verifiability
• Subversion-resilient enhanced privacy ID
• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
• Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
• Efficient fully structure-preserving signatures and shrinking commitments
• Structure-preserving public-key encryption with leakage-resilient CCA security
• Short tightly secure signatures for signing a vector of group elements: a new approach
• An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users
• Security of blind signatures revisited
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• A generic construction of tightly secure signatures in the multi-user setting
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Efficient chameleon hash functions in the enhanced collision resistant model
• Privacy-enhanced remote data integrity checking with updatable timestamp
• MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
• Fully-succinct publicly verifiable delegation from constant-size assumptions
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
• Algebraic partitioning: fully compact and (almost) tightly secure cryptography
• Towards lightweight anonymous entity authentication for IoT applications
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• Plaintext-checkable encryption
• Round-optimal privacy-preserving protocols with smooth projective hash functions
• Group to group commitments do not shrink
• Structure-preserving signatures and commitments to group elements
• Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
• Generalizing efficient multiparty computation
• Signatures and efficient proofs on committed graphs and NP-statements
• Fully structure-preserving signatures and shrinking commitments
• Structure-preserving smooth projective hashing
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• The kernel matrix Diffie-Hellman assumption
• Tightly secure signatures and public-key encryption
• A signature scheme with efficient proof of validity
• Achieving optimal anonymity in transferable e-cash with a judge
• Revocable attribute-based signatures with adaptive security in the standard model
• Policy-based signature scheme from lattices
• Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
• Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
• Generic transformation to strongly existentially unforgeable signature schemes with continuous leakage resiliency
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Breaking and fixing anonymous credentials for the cloud
• Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
• 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
• Identity-Committable Signatures and Their Extension to Group-Oriented Ring Signatures
• Tagged one-time signatures: tight security and optimal tag size
• Efficient completely context-hiding quotable and linearly homomorphic signatures
• Simplified small exponent test for batch verification
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Tools over bilinear groups for modular design of cryptographic tasks. (Abstract)
• Access Control Encryption for Equality, Comparison, and More
• Improved structure preserving signatures under standard bilinear assumptions
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• On the impossibility of structure-preserving deterministic primitives
• Real Hidden Identity-Based Signatures
• Efficient round-optimal blind signatures in the standard model
• Multi-theorem preprocessing NIZKs from lattices
• Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
• End-to-end secure messaging with traceability only for illegal content
• Revisiting BBS signatures
• On the security of functional encryption in the generic group model
• Structure-preserving linearly homomorphic signature with designated combiner for subspace
• Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
• DualDory: logarithmic-verifier linkable ring signatures through preprocessing
• Pointcheval-Sanders signature-based synchronized aggregate signature
• Trapdoor sanitizable and redactable signatures with unlinkability, invisibility and strong context-hiding
• Traceable receipt-free encryption
• Hierarchical Attribute-Based Signatures
• Algebraic reductions of knowledge
• An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations
• Homomorphic signatures for subset and superset mixed predicates and its applications
• Threshold structure-preserving signatures
• On proving equivalence class signatures secure from non-interactive assumptions
• Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
• Succinct verification of compressed sigma protocols in the updatable SRS setting
• On structure-preserving cryptography and lattices
• Concurrently secure blind Schnorr signatures
• How to prove statements obliviously?
• Efficient universally-verifiable electronic voting with everlasting privacy
• Practical traceable receipt-free encryption
• Permutation argument via bases transformation
• Interactive threshold mercurial signatures and applications
• On security proofs of existing equivalence class signature schemes
• Laconic PSI on authenticated inputs and applications
• Everlasting anonymous rate-limited tokens
• Tight security for BBS signatures
• Threshold blind signatures from CDH
• Structure-preserving compressing primitives: vector commitments and accumulators and applications
• Revisiting linkable ring signatures with logarithmic verification complexity

This page was built for publication: Structure-preserving signatures and commitments to group elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582756)