5476 search results - page 262 / 1096 » Resettably Secure Computation |
156
click to vote
SACRYPT
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
200
click to vote
PERCOM
2003
ACM
16 years 6 months ago
2003
ACM
In pervasive computing environments, powerful handheld devices with wireless connections create opportunities for many new nomadic applications. We propose a new service discovery...
174
click to vote
AINA
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we present a tool allowing the design of orchestration at a high level of abstraction. This tool also allows specifying security properties, also in an way, as anno...
144
click to vote
ICCSA
2005
Springer
16 years 6 days ago
2005
Springer
Wireless Sensor Networks are extremely vulnerable against any kind of internal or external attacks, due to several factors such as resource-constrained nodes and lack of tamper-res...
177
click to vote
ICCSA
2005
Springer
16 years 6 days ago
2005
Springer
In resent years, Popescu proposed several group signature schemes based on the Okamoto-Shiraishi assumption in [8–11], and claimed his schemes are secure. However, this paper dem...