Sciweavers

133 search results - page 2 / 27
» Fair Blind Signatures
Sort
View
EUROCRYPT
2003
Springer
13 years 10 months ago
Fair Secure Two-Party Computation
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...
Benny Pinkas
CIS
2005
Springer
13 years 10 months ago
ID-Based Restrictive Partially Blind Signatures
Restrictive blind signatures allow a recipient to receive a blind signature on a message not known to the signer but the choice of message is restricted and must conform to certain...
Xiaofeng Chen, Fangguo Zhang, Shengli Liu
ASIACRYPT
2009
Springer
13 years 11 months ago
A Framework for Universally Composable Non-committing Blind Signatures
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
Masayuki Abe, Miyako Ohkubo
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 4 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
ACISP
2005
Springer
13 years 10 months ago
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients ...
Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming ...