scientific article; zbMATH DE number 1952906
From MaRDI portal
Publication:4414288
Recommendations
Cited in
(92)- An efficient one-move nominative signature scheme
- New efficient and secure protocols for verifiable signature sharing and other applications
- Improved algebraic MACs and practical keyed-verification anonymous credentials
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- On the impossibility of structure-preserving deterministic primitives
- Subversion-resilient signatures: definitions, constructions and applications
- Efficient redactable signature and application to 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
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- How (not) to design strong-RSA signatures
- List signature schemes
- Tight security for signature schemes without random oracles
- Authenticated hash tables based on cryptographic accumulators
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Recovering lost device-bound credentials
- Formal treatment of privacy-enhancing credential systems
- Towards lightweight anonymous entity authentication for IoT applications
- Efficient schemes for anonymous yet authorized and bounded use of cloud resources
- Signatures and efficient proofs on committed graphs and NP-statements
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A signature scheme with efficient proof of validity
- Secure authenticated comparisons
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Unconditionally anonymous ring and mesh signatures
- Towards a trusted and privacy preserving membership service in distributed ledger using Intel Software Guard Extensions
- Breaking and fixing anonymous credentials for the cloud
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- A new approach to efficient revocable attribute-based anonymous credentials
- A new RSA-based signature scheme
- 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
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Programmable hash functions and their applications
- Efficient oblivious transfers with access control
- Efficient identification and signature schemes
- scientific article; zbMATH DE number 1424187 (Why is no real title available?)
- Compact privacy protocols from post-quantum and timed classical assumptions
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- Group Encryption
- Fast Signature Scheme for Network Coding
- Cryptography and Coding
- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- On Proofs of Security for DAA Schemes
- Secure and Efficient Scheme for Delegation of Signing Rights
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Anonymous tokens with public metadata and applications to private contact tracing
- Long-term security and universal composability
- Privacy-preserving blueprints
- Revisiting BBS signatures
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- Traceable constant-size multi-authority credentials
- Credential transparency system
- Traceable constant-size multi-authority credentials
- 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 -protocols in the global random-oracle model
- Auditable attribute-based credentials scheme and its application in contact tracing
- On proving equivalence class signatures secure from non-interactive assumptions
- Foundations of adaptor signatures
- Pairing-free blind signatures from standard assumptions in the ROM
- Blind RSA signatures from the t- generalized Lehmer sequences of some classes of groups
- Adaptive UC NIZK for practical applications
- Improved lattice blind signatures from recycled entropy
- Multi-Holder anonymous credentials from BBS signatures
- Server-aided anonymous credentials
- An information-sharing system that guarantees the authenticity and privacy of contributors
- Non-interactive blind signatures from RSA assumption and more
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- On security proofs of existing equivalence class signature schemes
- SoK: signatures with randomizable keys
- Foundations of anonymous signatures: formal definitions, simplified requirements, and a construction based on general assumptions
- On the concrete security of BBS/BBS+ signatures
- Everlasting anonymous rate-limited tokens
- Device-bound anonymous credentials with(out) trusted hardware
- Tight reductions for SIS-with-hints assumptions with applications to anonymous credentials
- Keyed-verification anonymous credentials with highly efficient partial disclosure
- Efficient construction of threshold BBS+ signatures and its extensions
- Group encryption with oblivious traceability
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 Q4414288)
