54 search results - page 3 / 11 » Efficient Protocols for Set Membership and Range Proofs |
ACISP
2008
Springer
14 years 20 days ago
2008
Springer
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...
CSFW
2005
IEEE
14 years 4 months ago
2005
IEEE
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
SEFM
2007
IEEE
14 years 5 months ago
2007
IEEE
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...
TSMC
2002
13 years 10 months ago
2002
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set...
FC
2005
Springer
14 years 4 months ago
2005
Springer
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...