2363 search results - page 104 / 473 » How Secure is RFID |
142
click to vote
CSFW
2002
IEEE
15 years 9 months ago
2002
IEEE
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of g...
131
click to vote
ASIACRYPT
2000
Springer
15 years 9 months ago
2000
Springer
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...
112
click to vote
CAISE
2006
Springer
15 years 8 months ago
2006
Springer
This paper explains how goal-oriented requirements engineering can be transposed into regulation modelling. It motivates also why this way of modelling regulations is worthwhile fo...
155
click to vote
EVOTING
2004
15 years 6 months ago
2004
: This paper gives an overview about the Estonian e-voting system. Paper discusses how the concept of e-voting system is designed to resist some of the main challenges of remote e-...
143
click to vote
INDOCRYPT
2005
Springer
15 years 10 months ago
2005
Springer
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...