Improved low-computation partially blind signatures.
From MaRDI portal
Publication:1412496
DOI10.1016/S0096-3003(03)00277-7zbMath1038.94009OpenAlexW1972424868MaRDI QIDQ1412496
Publication date: 25 November 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(03)00277-7
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
- A modification of the RSA public-key encryption procedure (Corresp.)
- A method for obtaining digital signatures and public-key cryptosystems
This page was built for publication: Improved low-computation partially blind signatures.