Structure-preserving signatures and commitments to group elements
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1643939 (Why is no real title available?)
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1088232 (Why is no real title available?)
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1842502 (Why is no real title available?)
- scientific article; zbMATH DE number 1440890 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A framework for universally composable non-committing blind signatures
- About the Security of MTI/C0 and MQV
- Achieving optimal anonymity in transferable e-cash with a judge
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Anonymous Proxy Signatures
- Commuting signatures and verifiable encryption
- Compact Group Signatures Without Random Oracles
- Computing on authenticated data: new privacy definitions and constructions
- Concurrent Blind Signatures Without Random Oracles
- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Digital Signatures
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient completely context-hiding quotable and linearly homomorphic signatures
- Efficient signatures of knowledge and DAA in the standard model
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Equivocal Blind Signatures and Adaptive UC-Security
- Fair blind signatures without random oracles
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Fully Anonymous Group Signatures Without Random Oracles
- Group Signatures
- Group Signatures with Efficient Concurrent Join
- Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
- Group encryption: non-interactive realization in the standard model
- Group signatures with almost-for-free revocation
- Group to group commitments do not shrink
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Malleable proof systems and applications
- Oblivious transfer with hidden access control from attribute-based encryption
- One-time signatures and chameleon hash functions
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- P-signatures and Noninteractive Anonymous Credentials
- Pairings for cryptographers
- Perfect NIZK with Adaptive Soundness
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Real traceable signatures
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Scalable group signatures with revocation
- Security arguments for digital signatures and blind signatures
- Security in Communication Networks
- Security of Blind Signatures under Aborts
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Structure preserving CCA secure encryption and applications
- Structure-preserving signatures and commitments to group elements
- Survey: leakage resilience and the bounded retrieval model
- Tagged one-time signatures: tight security and optimal tag size
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Theory of Cryptography
- Theory of Cryptography
- Tightly Secure Signatures and Public-Key Encryption
- Topics in Cryptology – CT-RSA 2005
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Verifiable homomorphic oblivious transfer and private equality test
Cited in
(31)- Synchronized aggregate signature under standard assumption in the random oracle model
- Private polynomial commitments and applications to MPC
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- On the impossibility of structure-preserving deterministic primitives
- Tools over bilinear groups for modular design of cryptographic tasks. (Abstract)
- Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
- Foundations of fully dynamic group signatures
- Compact structure-preserving signatures with almost tight security
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- On the impossibility of structure-preserving deterministic primitives
- A blind coupon mechanism enabling veto voting over unreliable networks
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Round-optimal privacy-preserving protocols with smooth projective hash functions
- Pairing-free blind signatures from standard assumptions in the ROM
- Identity-Committable Signatures and Their Extension to Group-Oriented Ring Signatures
- Set (non-)membership NIZKs from determinantal accumulators
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs
- Efficient fully structure-preserving signatures and shrinking commitments
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Access Control Encryption for Equality, Comparison, and More
- Fully structure-preserving signatures and shrinking commitments
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Group to group commitments do not shrink
- Proofs for inner pairing products and applications
- Structure-preserving signatures and commitments to group elements
- Predicate aggregate signatures and applications
- Structure-preserving public-key encryption with leakage-resilient CCA security
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
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 Q290392)
