Pages that link to "Item:Q1402372"
From MaRDI portal
The following pages link to The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme (Q1402372):
Displaying 46 items.
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- A new universal designated verifier transitive signature scheme for big graph data (Q314806) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Multi-recastable e-bidding game with dual-blindness (Q462743) (← links)
- User efficient recoverable off-line e-cash scheme with fast anonymity revoking (Q462753) (← links)
- Privacy protection in on-line shopping for electronic documents (Q506124) (← links)
- A code-based group signature scheme (Q510499) (← links)
- Provably secure randomized blind signature scheme based on bilinear pairing (Q604080) (← links)
- Security proofs for identity-based identification and signature schemes (Q1027974) (← links)
- Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
- Private set-intersection with common set-up (Q1783703) (← links)
- Oblivious keyword search (Q1827575) (← links)
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups (Q1865128) (← links)
- On selective-opening security of deterministic primitives (Q2061952) (← links)
- Anonymous tokens with private metadata bit (Q2096490) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- Two-round trip Schnorr multi-signatures via delinearized witnesses (Q2120071) (← links)
- MuSig2: simple two-round Schnorr multi-signatures (Q2120074) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- On the multi-user security of short Schnorr signatures with preprocessing (Q2170064) (← links)
- A fast and simple partially oblivious PRF, with applications (Q2170066) (← links)
- Short pairing-free blind signatures with exponential security (Q2170071) (← links)
- Simple Schnorr multi-signatures with applications to bitcoin (Q2324793) (← links)
- Security of blind signatures revisited (Q2397446) (← links)
- On tight security proofs for Schnorr signatures (Q2423848) (← links)
- Oblivious pseudorandom functions from isogenies (Q2692394) (← links)
- Virtual Smart Cards: How to Sign with a Password and a Server (Q2827728) (← links)
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions (Q2827730) (← links)
- Optimal Security Proofs for Signatures from Identification Schemes (Q2829210) (← links)
- Practical Round-Optimal Blind Signatures in the Standard Model (Q3457068) (← links)
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort (Q3540059) (← links)
- Homomorphic Encryption and Signatures from Vector Decomposition (Q3600493) (← links)
- Another look at non-standard discrete log and Diffie-Hellman problems (Q3612242) (← links)
- Divisible On-Line/Off-Line Signatures (Q3623042) (← links)
- Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment (Q3631374) (← links)
- Toward RSA-OAEP Without Random Oracles (Q5041161) (← links)
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes (Q5041167) (← links)
- Secure Data Deduplication with Reliable Data Deletion in Cloud (Q5205010) (← links)
- Cryptographic Voting — A Gentle Introduction (Q5253589) (← links)
- A provable secure pairing-free certificateless identification scheme (Q5266147) (← links)
- When e-th Roots Become Easier Than Factoring (Q5387090) (← links)
- Equivocal Blind Signatures and Adaptive UC-Security (Q5445514) (← links)
- Transitive Signatures from Braid Groups (Q5458209) (← links)
- Separation Results on the “One-More” Computational Problems (Q5458933) (← links)
- Efficient Round-Optimal Blind Signatures in the Standard Model (Q5854440) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
