The following pages link to (Q4414288):
Displaying 50 items.
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- Unconditionally anonymous ring and mesh signatures (Q321307) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Efficient oblivious transfers with access control (Q453798) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Improved algebraic MACs and practical keyed-verification anonymous credentials (Q1698653) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Subversion-resilient signatures: definitions, constructions and applications (Q1989360) (← links)
- Efficient redactable signature and application to anonymous credentials (Q2055711) (← links)
- Black-box accumulation based on lattices (Q2149798) (← links)
- Issuer-hiding attribute-based credentials (Q2149822) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- Enforcing input correctness via certification in garbled circuit evaluation (Q2167732) (← links)
- Anonymous single-sign-on for \(n\) designated services with traceability (Q2167743) (← links)
- Improved signature schemes for secure multi-party computation with certified inputs (Q2167761) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- How (not) to design strong-RSA signatures (Q2430687) (← links)
- Tight security for signature schemes without random oracles (Q2516531) (← links)
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system (Q2691596) (← links)
- Recovering Lost Device-Bound Credentials (Q2794506) (← links)
- Formal Treatment of Privacy-Enhancing Credential Systems (Q2807189) (← links)
- Towards Lightweight Anonymous Entity Authentication for IoT Applications (Q2817466) (← links)
- Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources (Q2889864) (← links)
- Signatures and Efficient Proofs on Committed Graphs and NP-Statements (Q2948189) (← links)
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes (Q3104713) (← links)
- Towards a Trusted and Privacy Preserving Membership Service in Distributed Ledger Using Intel Software Guard Extensions (Q3297512) (← links)
- Breaking and Fixing Anonymous Credentials for the Cloud (Q3297625) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials (Q3460098) (← links)
- Programmable Hash Functions and Their Applications (Q3600211) (← links)
- Unlinkable Randomizable Signature and Its Application in Group Signature (Q3600344) (← links)
- Efficient Protocols for Set Membership and Range Proofs (Q3600378) (← links)
- Pairings in Trusted Computing (Q3600490) (← links)
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems (Q3623053) (← links)
- Realizing Hash-and-Sign Signatures under Standard Assumptions (Q3627443) (← links)
- Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions (Q5041222) (← links)
- Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes (Q5087265) (← links)
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model (Q5323057) (← links)
- Group Encryption (Q5387099) (← links)
- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures (Q5445450) (← links)
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles (Q5502754) (← links)
- On Proofs of Security for DAA Schemes (Q5505466) (← links)
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy (Q6041283) (← links)
- Anonymous tokens with public metadata and applications to private contact tracing (Q6045198) (← links)
- Privacy-preserving blueprints (Q6061376) (← links)
- Revisiting BBS signatures (Q6083685) (← links)