To obtain access to full text of journal and articles you must register!
- Article name
- Blind signature protocol based on two computationally hard problems
- Authors
- Moldovyan D. N., , mdn.spectr@mail.ru, St. Petersburg Electrotechnical Univeristy "LETI", St. Petersburg, Russia
Galanov A. I., , nmold@mail.ru, St.-Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, St.-Petersburg, Russia
Zaharov D. V., , zakharov.dmitriy@gmail.com, St.-Petersburg State University for Waterway Communications, St.-Petersburg, Russia
Sinev V. E., , nmold@mail.ru, St.-Petersburg State Electrotechnical University "LETI, St.-Petersburg, Russia
- Keywords
- digital signature / blind signature / hard problem / cryptographic protocol / anony- mity / public key / discrete logarithm problem / factorization problem
- Year
- 2009 Issue 4 Pages 2 - 7
- Code EDN
- Code DOI
- Abstract
- There are proposed the blind signature protocols characterized in that their breaking require solving simultaneously two different computationally hard problems. There are propose two different approaches to construct such blind signature protocols. In the first approach there are exploited two discrete logarithm problems related to two different finite groups. In the second approach there are combined the discrete logarithm problem in the ground finite field and the factorization problem.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
