Sciweavers

2601 search results - page 178 / 521
» Secure Rewarding Schemes
Sort
View
139
Voted
CCS
2004
ACM
15 years 8 months ago
Cryptanalysis of a provably secure CRT-RSA algorithm
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
David Wagner
103
Voted
ACSW
2003
15 years 4 months ago
A Secure Mental Poker Protocol Over The Internet
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...
Weiliang Zhao, Vijay Varadharajan, Yi Mu
COMPSEC
2010
124views more  COMPSEC 2010»
15 years 2 months ago
A provably secure secret handshake with dynamic controlled matching
Abstract A Secret Handshake is a protocol that allows two users to mutually verify one another’s properties, and in case of simultaneous matching, to share a key used to secure s...
Alessandro Sorniotti, Refik Molva
PKC
2001
Springer
116views Cryptology» more  PKC 2001»
15 years 7 months ago
Cryptanalysis of a Digital Signature Scheme on ID-Based Key-Sharing Infrastructures
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...
Hongjun Wu, Feng Bao, Robert H. Deng
138
Voted
ICN
2005
Springer
15 years 9 months ago
A Practical and Secure Communication Protocol in the Bounded Storage Model
Proposed by Maurer the bounded storage model has received much academic attention in the recent years. Perhaps the main reason for this attention is that the model facilitates a un...
Erkay Savas, Berk Sunar