scientific article; zbMATH DE number 1952906

Publication date: 24 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2576/25760268.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Authentication, digital signatures and secret sharing (94A62)

Related Items

Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Unconditionally anonymous ring and mesh signatures ⋮ A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials ⋮ Black-box accumulation based on lattices ⋮ Issuer-hiding attribute-based credentials ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Enforcing input correctness via certification in garbled circuit evaluation ⋮ Anonymous single-sign-on for \(n\) designated services with traceability ⋮ Improved signature schemes for secure multi-party computation with certified inputs ⋮ Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Long-term security and universal composability ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Anonymous tokens with public metadata and applications to private contact tracing ⋮ Privacy-preserving blueprints ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Revisiting BBS signatures ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Traceable constant-size multi-authority credentials ⋮ Traceable constant-size multi-authority credentials ⋮ Credential transparency system ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ A framework for practical anonymous credentials from lattices ⋮ Anonymous tokens with stronger metadata bit hiding from algebraic MACs ⋮ Hierarchical Attribute-Based Signatures ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Improved algebraic MACs and practical keyed-verification anonymous credentials ⋮ How (not) to design strong-RSA signatures ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system ⋮ Programmable hash functions and their applications ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Efficient oblivious transfers with access control ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Group Encryption ⋮ Towards a Trusted and Privacy Preserving Membership Service in Distributed Ledger Using Intel Software Guard Extensions ⋮ Breaking and Fixing Anonymous Credentials for the Cloud ⋮ Secure Authenticated Comparisons ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Programmable Hash Functions and Their Applications ⋮ Unlinkable Randomizable Signature and Its Application in Group Signature ⋮ Efficient Protocols for Set Membership and Range Proofs ⋮ 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 ⋮ Towards Lightweight Anonymous Entity Authentication for IoT Applications ⋮ Efficient redactable signature and application to anonymous credentials ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes ⋮ An Efficient On-Line/Off-Line Signature Scheme without Random Oracles ⋮ On Proofs of Security for DAA Schemes ⋮ Authenticated hash tables based on cryptographic accumulators