Sciweavers

4 search results - page 1 / 1
» Practical Fair Anonymous Undeniable Signatures
Sort
View
IJIT
2004
13 years 6 months ago
Practical Fair Anonymous Undeniable Signatures
We present a new model for undeniable signatures: fair-anonymous undeniable signatures. This protocol can not only preserve the privacy of the signer (i.e. anonymity) but also trac...
Song Han, Elizabeth Chang, Xiaotie Deng, Winson K....
AFRICACRYPT
2010
Springer
13 years 11 months ago
Fair Blind Signatures without Random Oracles
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
Georg Fuchsbauer, Damien Vergnaud
IEEEARES
2007
IEEE
13 years 11 months ago
A Practical Verifiable e-Voting Protocol for Large Scale Elections over a Network
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, indiv...
Orhan Cetinkaya, Ali Doganaksoy
ACISP
2001
Springer
13 years 9 months ago
A Practical English Auction with One-Time Registration
An English auction is the most familiar type of auctions. Generally, an electronic auction has mainly two entities, the registration manager(RM) who treats the registration of bidd...
Kazumasa Omote, Atsuko Miyaji