Sciweavers

743 search results - page 1 / 149
» Secure Signature Schemes based on Interactive Protocols
Sort
View
CRYPTO
1995
Springer
89views Cryptology» more  CRYPTO 1995»
13 years 8 months ago
Secure Signature Schemes based on Interactive Protocols
Ronald Cramer, Ivan Damgård
CCR
2000
101views more  CCR 2000»
13 years 4 months ago
Knowledge-proof based versatile smart card verification protocol
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
Dae Hun Nyang, Joo-Seok Song
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
13 years 8 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
PKC
2009
Springer
166views Cryptology» more  PKC 2009»
14 years 5 months ago
Security of Blind Signatures under Aborts
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
Dominique Schröder, Marc Fischlin