3504 search results - page 85 / 701 » Secure protocol composition |
150
Voted
AFRICACRYPT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We present a simple zero-knowledge proof of knowledge protocol of which many protocols in the literature are instantiations. These include Schnorr’s protocol for provin...
91
Voted
COMPSAC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—While log data are being increasingly used as digital evidence in judicial disputes, the extent to which existing secure logging protocols used to collect log data ful...
96
Voted
ACSW
2003
15 years 3 months ago
2003
An efficient and secure mental poker scheme is proposed in this paper. It is based on multiple encryption and decryption of individual cards. The protocol satisfies all major sec...
137
click to vote
IJNSEC
2007
15 years 2 months ago
2007
Recently, based on RSA and discrete logarithm with composite modulus, Huang and Chang proposed two multisignature schemes with distinguished signing authority and claimed that the...
111
click to vote
CCS
2001
ACM
15 years 7 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.