Analysis of a receipt-free auction protocol in the applied pi calculus

Authors:
Naipeng Dong;Hugo Jonker;Jun Pang
Affiliations:
Faculty of Sciences, Technology and Communication, University of Luxembourg, Luxembourg;Faculty of Sciences, Technology and Communication, University of Luxembourg, Luxembourg;Faculty of Sciences, Technology and Communication, University of Luxembourg, Luxembourg
Venue:
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Year:
2010

Citing 15
Cited 4

Efficient private bidding and auctions with an oblivious third party

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Privacy preserving auctions and mechanism design

Proceedings of the 1st ACM conference on Electronic commerce
Mobile values, new names, and secure communication

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Receipt-Free Sealed-Bid Auction

ISC '02 Proceedings of the 5th International Conference on Information Security
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Formal Analysis of Multi-Party Contract Signing

CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Electronic auctions with private bids

WOEC'98 Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus

CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
A formal framework for quantifying voter-controlled privacy

Journal of Algorithms
Verifying privacy-type properties of electronic voting protocols

Journal of Computer Security
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols

SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
Secure Vickrey auctions without threshold trust

FC'02 Proceedings of the 6th international conference on Financial cryptography
A Game-Based Definition of Coercion-Resistance and Its Applications

CSF '10 Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium
Analysis of an electronic voting protocol in the applied pi calculus

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

SeVe: automatic tool for verification of security protocols

Frontiers of Computer Science in China
Challenges in ehealth: from enabling to enforcing privacy

FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Formal verification of e-auction protocols

POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Defining verifiability in e-auction protocols

Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formally study two privacy-type properties for 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.