Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311558
DOI10.1007/b99099zbMath1104.94045OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311558
Jan Camenisch, Anna Lysyanskaya
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99099
Related Items
EPID with malicious revocation, Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources, Structure-preserving signatures and commitments to group elements, A property-based attestation protocol for TCM, Predicate encryption supporting disjunctions, polynomial equations, and inner products, Generic Framework for Attribute-Based Group Signature, Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms, Unconditionally anonymous ring and mesh signatures, A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials, Black-box accumulation based on lattices, \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme, Issuer-hiding attribute-based credentials, Security analysis of DGM and GM group signature schemes instantiated with XMSS-T, Skipping the \(q\) in group signatures, A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption, Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring, More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds, Enforcing input correctness via certification in garbled circuit evaluation, Improved signature schemes for secure multi-party computation with certified inputs, A fast and simple partially oblivious PRF, with applications, Short pairing-free blind signatures with exponential security, Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes, Short signatures from Diffie-Hellman: realizing almost compact public key, Rerandomizable signatures under standard assumption, Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability, Batch verification of short signatures, Anonymous tokens with public metadata and applications to private contact tracing, Privacy-preserving blueprints, Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, Towards Tightly Secure Lattice Short Signature and Id-Based Encryption, PAPR: publicly auditable privacy revocation for anonymous credentials, Revisiting BBS signatures, Structure-preserving signatures on equivalence classes and constant-size anonymous credentials, Traceable constant-size multi-authority credentials, Traceable constant-size multi-authority credentials, Pointcheval-Sanders signature-based synchronized aggregate signature, Credential transparency system, YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model, Lattice signature with efficient protocols, application to anonymous credentials, Attribute-based anonymous credential: optimization for single-use and multi-use, Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric, Improved algebraic MACs and practical keyed-verification anonymous credentials, MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system, Practical dynamic group signatures without knowledge extractors, Conditional e-payments with transferability, Programmable hash functions and their applications, Foundations of fully dynamic group signatures, Efficient oblivious transfers with access control, On the impossibility of structure-preserving deterministic primitives, A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort, Fully Anonymous Group Signatures Without Random Oracles, Group Encryption, A provably secure short signature scheme based on discrete logarithms, Breaking and Fixing Anonymous Credentials for the Cloud, A code-based group signature scheme, Subversion-resilient signatures: definitions, constructions and applications, The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem, Decentralized Attribute-Based Signatures, Improved Structure Preserving Signatures Under Standard Bilinear Assumptions, Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash, A New Dynamic Code-Based Group Signature Scheme, A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract), Compact Group Signatures Without Random Oracles, Unclonable Group Identification, Generic security-amplifying methods of ordinary digital signatures, Unlinkable Randomizable Signature and Its Application in Group Signature, Universally Composable Adaptive Oblivious Transfer, Pairings in Trusted Computing, Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures, Recovering Lost Device-Bound Credentials, Tight security for signature schemes without random oracles, Formal Treatment of Privacy-Enhancing Credential Systems, Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems, Realizing Hash-and-Sign Signatures under Standard Assumptions, Secret Handshakes with Dynamic Expressive Matching Policy, Efficient redactable signature and application to anonymous credentials, Foundations of Fully Dynamic Group Signatures, Ring signatures: Stronger definitions, and constructions without random oracles, Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials, A note on the Chen-Morrissey-Smart DAA scheme, Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes, Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups, On Proofs of Security for DAA Schemes, An Efficient Self-blindable Attribute-Based Credential Scheme, A classification of computational assumptions in the algebraic group model, Computing on authenticated data, Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages, A strong designated verifier signature scheme tightly related to the LRSW assumption, A Practical Group Signature Scheme Based on Rank Metric, Partially structure-preserving signatures: lower bounds, constructions and more
