Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

Voted

IFIP
2010
Springer

favoriteEmaildiscussreport

136views Programming Languages» more IFIP 2010»

Analysis of a Receipt-Free Auction Protocol in the Applied Pi Calculus

13 years 6 months ago

Analysis of a Receipt-Free Auction Protocol in the Applied Pi Calculus

Download satoss.uni.lu

Abstract. We formally study two privacy-type properties in online auction protocols, bidding-price-secrecy and receipt-freeness. These properties are formalised as observational equivalences in the applied calculus. We analyse the receipt-free auction protocol by Abe and Suzuki. Bidding-price-secrecy of the protocol is verified using ProVerif, whereas receipt-freeness of the protocol is proved manually.

Naipeng Dong, Hugo L. Jonker, Jun Pang

Real-time Traffic

Auction Protocol | IFIP 2010 | Online Auction Protocols | Programming Languages | Receipt-free Auction Protocol |

claim paper

Related Content

» Analysis of an Electronic Voting Protocol in the Applied Pi Calculus

» Automatic Verification of Security Properties in Remote Internet Voting Protocol with Appl...

» Mobile values new names and secure communication

» Discovering Concrete Attacks on Website Authorization by Formal Analysis

» Automated verification of selected equivalences for security protocols

» Computationally Sound Abstraction and Verification of Secure MultiParty Computations

Post Info
More Details (n/a)

Added	18 May 2011
Updated	18 May 2011
Type	Journal
Year	2010
Where	IFIP
Authors	Naipeng Dong, Hugo L. Jonker, Jun Pang

Comments (0)