Fast contract signing with batch oblivious transfer

Authors:
L'ubica Staneková;Martin Stanek
Affiliations:
Department of Mathematics, Slovak University of Technology, Bratislava, Slovakia;Department of Computer Science, Comenius University, Bratislava, Slovakia
Venue:
CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
Year:
2005

Citing 7
Cited 0

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Privacy preserving auctions and mechanism design

Proceedings of the 1st ACM conference on Electronic commerce
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Abuse-Free Optimistic Contract Signing

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Batch RSA

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A two-server, sealed-bid auction protocol

FC'02 Proceedings of the 6th international conference on Financial cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Oblivious transfer protocol is a basic building block of various cryptographic constructions. We propose a novel protocol – batch oblivious transfer. It allows efficient computation of multiple instances of oblivious transfer protocols. We apply this protocol to improve the fast simultaneous contract signing protocol, recently proposed in [11], which gains its speed from computation of time-consuming operations in advance. Using batch oblivious transfer, a better efficiency can be achieved.