scientific article; zbMATH DE number 1942413
From MaRDI portal
Publication:4409110
zbMath1026.94545MaRDI QIDQ4409110
Anna Lysyanskaya, Jan Camenisch
Publication date: 30 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420061.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
anonymitygroup signaturesdynamic accumulatorscertificate revocationcredential systemsidentity escrow
Related Items (74)
Cryptanalysis of a dynamic universal accumulator over bilinear groups ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ Short Transitive Signatures for Directed Trees ⋮ UC Updatable Databases and Applications ⋮ Off-Line Group Signatures with Smart Cards ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials ⋮ \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme ⋮ Security analysis of DGM and GM group signature schemes instantiated with XMSS-T ⋮ Dynamic universal accumulator with batch update over bilinear groups ⋮ CPA-to-CCA transformation for KDM security ⋮ Merkle trees optimized for stateless clients in bitcoin ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Lattice-based accumulator with constant time list update and constant time verification ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use ⋮ Traceable Identity-Based Group Signature ⋮ Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Black-box anonymous commit-and-prove ⋮ Lower bounds for the number of decryption updates in registration-based encryption ⋮ Additive-homomorphic functional commitments and applications to homomorphic signatures ⋮ Efficient code-based fully dynamic group signature scheme ⋮ KVaC: key-value commitments for blockchains and beyond ⋮ Circular security is complete for KDM security ⋮ Incrementally aggregatable vector commitments and applications to verifiable decentralized storage ⋮ Non-malleable vector commitments via local equivocability ⋮ Foundations of fully dynamic group signatures ⋮ Efficient oblivious transfers with access control ⋮ Self-organized Anonymous Authentication in Mobile Ad Hoc Networks ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Vector Commitments and Their Applications ⋮ Efficient authenticated data structures for graph connectivity and geometric search problems ⋮ List signature schemes ⋮ A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract) ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Compact Group Signatures Without Random Oracles ⋮ Unclonable Group Identification ⋮ Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease ⋮ Multi-Identity Single-Key Decryption without Random Oracles ⋮ Efficient Protocols for Set Membership and Range Proofs ⋮ An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations ⋮ Non-malleable vector commitments via local equivocability ⋮ Scored anonymous credentials ⋮ Short concurrent covert authenticated key exchange (short cAKE) ⋮ Limits on revocable proof systems, with implications for stateless blockchains ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Mutative Identity-Based Signatures or Dynamic Credentials Without Random Oracles ⋮ Session resumption protocols and efficient forward security for TLS 1.3 0-RTT ⋮ A General, Flexible and Efficient Proof of Inclusion and Exclusion ⋮ Super-Efficient Verification of Dynamic Outsourced Databases ⋮ Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces ⋮ Zero-knowledge functional elementary databases ⋮ Towards zero knowledge argument for double discrete logarithm with constant cost ⋮ Statistically Hiding Sets ⋮ Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems ⋮ Fully dynamic attribute-based signatures for circuits from codes ⋮ Oblivious accumulators ⋮ Universal vector commitments ⋮ Foundations of Fully Dynamic Group Signatures ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ Efficient Asynchronous Accumulators for Distributed PKI ⋮ UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ A symmetric cryptographic scheme for data integrity verification in cloud databases ⋮ On the security of Miyaji et al. group signature scheme ⋮ New constructions of hinting PRGs, OWFs with encryption, and more ⋮ New code-based cryptographic accumulator and fully dynamic group signature
This page was built for publication:
