scientific article; zbMATH DE number 1942413
From MaRDI portal
Publication:4409110
Recommendations
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Topics in Cryptology – CT-RSA 2005
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- scientific article; zbMATH DE number 1941253
Cited in
(only showing first 100 items - show all)- Fiat-Shamir for highly sound protocols is instantiable
- A lattice-based group signature scheme with verifier-local revocation
- Group encryption: full dynamicity, message filtering and code-based instantiation
- New constructions of hinting PRGs, OWFs with encryption, and more
- New code-based cryptographic accumulator and fully dynamic group signature
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- \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
- Leader-based de-anonymization of an anonymous read/write memory
- Foundations of fully dynamic group signatures
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- List signature schemes
- On the security of Miyaji et al. group signature scheme
- Merkle trees optimized for stateless clients in bitcoin
- 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
- 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
- Short Transitive Signatures for Directed Trees
- Zero-Knowledge Accumulators and Set Algebra
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Traceable identity-based group signature
- A general, flexible and efficient proof of inclusion and exclusion
- Revocation for delegatable anonymous credentials
- ARBRA: Anonymous Reputation-Based Revocation with Efficient Authentication
- Off-line group signatures with smart cards
- A new approach to efficient revocable attribute-based anonymous credentials
- Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
- Self-organized anonymous authentication in mobile ad hoc networks
- Compact Group Signatures Without Random Oracles
- Unclonable Group Identification
- Multi-Identity Single-Key Decryption without Random Oracles
- Efficient Protocols for Set Membership and Range Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Statistically Hiding Sets
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- scientific article; zbMATH DE number 1941253 (Why is no real title available?)
- Efficient oblivious transfers with access control
- scientific article; zbMATH DE number 2085216 (Why is no real title available?)
- Vector commitments and their applications
- A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract)
- scientific article; zbMATH DE number 1424194 (Why is no real title available?)
- UC Updatable Databases and Applications
- A New Dynamic Accumulator for Batch Updates
- Mutative Identity-Based Signatures or Dynamic Credentials Without Random Oracles
- Super-Efficient Verification of Dynamic Outsourced Databases
- Efficient authenticated data structures for graph connectivity and geometric search problems
- Topics in Cryptology – CT-RSA 2005
- Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Non-malleable vector commitments via local equivocability
- Lattice-based accumulator with constant time list update and constant time verification
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Functional commitments for all functions, with transparent setup and from SIS
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- 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
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations
- Scored anonymous credentials
- Short concurrent covert authenticated key exchange (short cAKE)
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Limits on revocable proof systems, with implications for stateless blockchains
- 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
- Fully dynamic attribute-based signatures for circuits from codes
- Oblivious accumulators
- Universal vector commitments
- COMPASS: a compact PASS-lineage accumulator with succinct proofs
- Adaptive UC NIZK for practical applications
- Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
- Exponent-VRFs and their applications
- RSA multiple record parametric authentication scheme
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- Delegatable anonymous credentials from mercurial signatures with stronger privacy
- Proactive refresh for accountable threshold signatures
- Fully dynamic group signatures from subset difference methods under simple assumptions
- Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
- Lower bounding update frequency in short accumulators and vector commitments
- Lattice EPID with efficient revocation
- Beyond the circuit -- how to minimize foreign arithmetic in ZKP circuits
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
- General techniques for building SNARKs over the integers
- Lattice-based accumulator and application to anonymous credential revocation
- Succinctly verifiable computation over additively-homomorphically encrypted data: making privacy-preserving blueprints practical
- Tight lower bound on witness update frequency in additive positive accumulators
- A symmetric cryptographic scheme for data integrity verification in cloud databases
- Universally composable accumulators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409110)
