Sciweavers

41 search results - page 8 / 9
» LITESET: A Light-Weight Secure Electronic Transaction Protoc...
Sort
View
JUCS
2008
166views more  JUCS 2008»
13 years 7 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
IPL
2007
72views more  IPL 2007»
13 years 7 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
ACMICEC
2006
ACM
117views ECommerce» more  ACMICEC 2006»
13 years 11 months ago
Practical secrecy-preserving, verifiably correct and trustworthy auctions
We present a practical protocol based on homomorphic cryptography for conducting provably fair sealed-bid auctions. The system preserves the secrecy of the bids, even after the an...
David C. Parkes, Michael O. Rabin, Stuart M. Shieb...
JUCS
2008
156views more  JUCS 2008»
13 years 7 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
FM
2005
Springer
98views Formal Methods» more  FM 2005»
14 years 1 months ago
Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern
The Mondex Electronic Purse system [18] is an outstanding example of formal refinement techniques applied to a genuine industrial scale application, and notably, was the first ve...
Richard Banach, Michael Poppleton, Czeslaw Jeske, ...