Results 271 to 280 of about 20,320 (295)
Some of the next articles are maybe not open access.
Strengthened security for blind signatures
1998Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. More recently, a new approach to achieve some kind of provable security was explored using the so-called “random oracle model”.
openaire +1 more source
Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model
Lecture Notes in Computer Science, 2020Yannick Seurin +2 more
exaly
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007
Chengyu Hu, Daxing Li
openaire +1 more source
Chengyu Hu, Daxing Li
openaire +1 more source
Cryptanalysis of the blind signatures based on the discrete logarithm problem
Electronics Letters, 1995L Harn
exaly
A Modular Treatment of Blind Signatures from Identification Schemes
Lecture Notes in Computer Science, 2019Eduard Hauck, Julian Loss, Eike Kiltz
exaly
Fair blind threshold signatures in wallet with observers
Journal of Systems and Software, 2004Wen-Shenq Juang, Horng-Twu Liaw
exaly
Provably Secure Partially Blind Signatures
Lecture Notes in Computer Science, 2000Masayuki Abe +2 more
exaly
Analysis of ID-based restrictive partially blind signatures and applications
Journal of Systems and Software, 2008Shangteng Huang
exaly

