Abstract
We consider the following generic type of payment protocol: a server is willing to make a payment to one among several clients, to be selectively chosen; for instance, the one whose private input is maximum. Instances of this protocol arise in several financial transactions, such as auctions, lotteries and prize-winning competitions.
We define such a task by introducing the notion of private selective payment protocol for a given function, deciding which client is selected. We then present an efficient private selective payment protocol for the especially interesting case in which the function selects the client with maximum private input. Our protocol can be performed in constant rounds, does not require any interaction among the clients, and does not use general circuit evaluation techniques. Moreover, our protocol satisfies strong privacy properties: it is information-theoretically private with respect to all-but-one clients trying to learn the other client’s private input or which client is selected; and assuming the hardness of deciding quadratic residuosity modulo Blum integers, a honest-but-curious server does not learn any information about which client is selected, or about the private inputs of selected or non-selected clients. The techniques underlying this protocol involve the introduction and constructions for a novel variant of oblivious transfer, of independent interest, which we call symmetrically-private conditional oblivious transfer.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Bach and J. Shallit, Algorithmic Number Theory, MIT Press, 1996.
D. Beaver, How to Break a Secure Oblivious Transfer, in Proceedings of “Advances in Cryptology-EUROCRYPT 92”, Lecture Notes in Computer Science, Springer Verlag.
M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, in Proceedings of 20th Annual ACM Symposium on Theory of Computing (STOC 88).
M. Blum, Coin Flipping by Telephone, in Proc. of IEEE Spring COMPCOM, 1982.
C. Cauchin, Efficient Private Bidding and Auctions with an Oblivious Third Party, in Proc. of ACM Conference on Computers, Communications and Security, 1999, Springer Verlag.
C. Crepeau, Equivalence between Two Flavors of Oblivious Transfer, in Proceedings of “Advances in Cryptology-CRYPTO 87”, Lecture Notes in Computer Science, Springer Verlag.
B. De Boer, Oblivious Transfer Protecting Secrecy, in Proceedings of “Advances in Cryptology-EUROCRYPT 90”, Lecture Notes in Computer Science, Springer Verlag.
A. De Santis, G. Di Crescenzo, and G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, in Theoretical Computer Science, vol. 132, (1994), pp. 291–317.
A. De Santis, G. Di Crescenzo, and G. Persiano, Zero-Knowledge Arguments and Public-Key Cryptography, in Information and Computation, vol. 121, (1995), pp. 23–40.
A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung, On Monotone Formula Closure of SZK, in Proceedings of 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS 94).
G. Di Crescenzo, R. Ostrovsky, and S. Rajagopalan, Conditional Oblivious Transfer and Timed-Release Encryption, in Proceedings of “Advances in Cryptology-EUROCRYPT 99”, Lecture Notes in Computer Science, Springer Verlag.
U. Feige, A. Fiat, and A. Shamir, Zero-Knowledge Proofs of Identity, in Journal of Cryptology, vol. 1, n. 2, pp. 77–94, 1988.
M. Franklin and M. Reiter, The Desing and Implementation of a Secure Auction Service, in IEEE Transactions on Software Engineering, vol. 22, n. 5, pp. 302–312, 1996.
O. Goldreich, S. Micali, and A. Wigderson, How to Play any Mental Game, in Proceedings of 19th Annual ACM Symposium on Theory of Computing (STOC 87).
S. Goldwasser and S. Micali, Probabilistic Encryption, in Journal of Computer and System Sciences, vol. 28 (1984), n. 2, pp. 270–299.
S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, in SIAM Journal on Computing, vol. 18, n. 1, 1989.
M. Harkavy, D. Tygar and H. Kikuchi, Electronic Auctions with Private Bids, in Proceedings of 3rd USENIX Workshop on Electronic Commerce, 1998.
J. Kilian, Founding Cryptography on Oblivious Transfer, in Proceedings of 20th Annual ACM Symposium on Theory of Computing (STOC 88).
M. Rabin, How to Exchange Secrets by Oblivious Transfer, TR-81 Aiken Computation Laboratory, Harvard, 1981.
A. Shamir, How to Share a Secret, in Communications of the ACM, vol. 22, pp. 612–613, 1979.
A.C. Yao, Protocols for Secure Computations, in Proceedings of 23th Annual IEEE Symposium on Foundations of Computer Science (FOCS 82).
A.C. Yao, How to Generate and Exchange Secrets, in Proceedings of 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS 86).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Crescenzo, G. (2001). Private Selective Payment Protocols. In: Frankel, Y. (eds) Financial Cryptography. FC 2000. Lecture Notes in Computer Science, vol 1962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45472-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-45472-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42700-1
Online ISBN: 978-3-540-45472-4
eBook Packages: Springer Book Archive