The following pages link to (Q4365762):
Displayed 18 items.
- A new blind signature based on the discrete logarithm problem for untraceability (Q556120) (← links)
- On the design of time-stamped signatures (Q596319) (← links)
- Batch RSA signature scheme (Q1028382) (← links)
- Improved low-computation partially blind signatures. (Q1412496) (← links)
- A practical anonymous payment scheme for electronic commerce (Q1876490) (← links)
- One-more unforgeability of blind ECDSA (Q2148761) (← links)
- Blind digital signature calculation algorithms based on the ukrainian national digital signature standard DSTU 4145-2002 and Russian digital signature standard GOST R 34.10-2001 (Q2263202) (← links)
- Converting normal DLP-based signatures into blind (Q2572049) (← links)
- Comment: A new blind signature based on the discrete logarithm problem for untraceability (Q2573565) (← links)
- Comment on traceability on RSA-based partially signature with low computation (Q2573597) (← links)
- Electronic voting in a large-scale distributed system (Q2747801) (← links)
- Comment fail-stop blind signature scheme design based on pairings (Q3443216) (← links)
- An Efficient Privacy-Preserving E-coupon System (Q3454569) (← links)
- A Pairing-Less Identity-Based Blind Signature with Message Recovery Scheme for Cloud-Assisted Services (Q5040413) (← links)
- Digital Signatures (Q5050199) (← links)
- Collective Signature Protocols for Signing Groups (Q5117280) (← links)
- On the (im)possibility of secure ElGamal blind signatures (Q6051896) (← links)
- The Abe-Okamoto partially blind signature scheme revisited (Q6175978) (← links)