Skip to main content
SpringerLink
Log in
Book cover

International Conference on Financial Cryptography

FC 2001: Financial Cryptography pp 269–288Cite as

Privacy for the Stock Market

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2339))

Abstract

We investigate the problem of performing Stock Market operations, such as buying or selling shares of a certain stock, in a private way, which had recently been left open.

We present a formal definition for a private stock purchase protocol, addressing several privacy and security concerns on usual on-line stock market operations. According to our definition, a client would not reveal how many shares she is buying or selling (not even which of these two cases is happening), and what price she is offering for those. We then present an efficient protocol meeting this definition, based on the hardness of the decisional Diffie-Hellman problem. Our protocol requires no interaction between the clients, can be executed in a constant number of rounds between the clients and the server, and requires several technical contributions, such as a new and efficient zero-knowledge protocol for proving sum-related statements about encrypted values, which is of independent interest.

Copyright 2001, Telcordia Technologies, Inc. All Rights Reserved.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bellare and S. Micali, A Non-Interactive Oblivious Transfer Protocol and its Applications, in Proceedings of “Advances in Cryptology-CRYPTO’88”, Lecture Notes in Computer Science, Springer Verlag.

    Google Scholar 

  2. M. Bellare, S. Micali, and R. Ostrovsky, Perfect Zero-Knowledge in Constant Rounds, in Proceedings of 22th Annual ACM Symposium on Theory of Computing (STOC’90).

    Google Scholar 

  3. G. Brassard, C. Crépeau, and D. Chaum, Minimum Disclosure Proofs of Knowledge, Journal of Computer and System Sciences, vol. 37, no. 2, 1988, pp. 156–189.

    Article  MATH  MathSciNet  Google Scholar 

  4. 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.

    Google Scholar 

  5. C. Crépeau, Equivalence between Two Flavors of Oblivious Transfer, in Proceedings of “Advances in Cryptology-CRYPTO’87”, Lecture Notes in Computer Science, Springer Verlag.

    Google Scholar 

  6. C. Cachin, J. Camenish, J. Kilian, and J. Muller, One-Round Secure Computation and Secure Autonomous Agents, in Proceedings of ICALP 2000, Springer Verlag.

    Google Scholar 

  7. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung, How to Share a Function Securely, in Proceedings of 26th Annual ACM Symposium on Theory of Computing (STOC’87).

    Google Scholar 

  8. 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).

    Google Scholar 

  9. G. Di Crescenzo, Private Selective Payment Protocols, in Proceedings of Financial Cryptography 2000, Springer Verlag.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. U. Feige, A. Fiat, and A. Shamir, Zero-Knowledge Proofs of Identity, in Journal of Cryptology, vol. 1, n. 2, pp. 77–94, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  12. T. El Gamal, A Public key Cryptosystem abd a Signature scheme based on Discrete Logarythms, in Proceedings of “Advances in Cryptology — CRYPTO’84”, Lecture Notes in Computer Science, Springer Verlag.

    Google Scholar 

  13. 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.

    Article  Google Scholar 

  14. 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).

    Google Scholar 

  15. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, in SIAM Journal on Computing, vol. 18, n. 1, 1989.

    Google Scholar 

  16. M. Harkavy, D. Tygar and H. Kikuchi, Electronic Auctions with Private Bids, in Proceedings of 3rd USENIX Workshop on Electronic Commerce, 1998.

    Google Scholar 

  17. M. Jakobsson and A. Juels, Addition of El-Gamal Plaintexts, in Proceedings of “Advances in Cryptology-ASIACRYPT 2000”, Lecture Notes in Computer Science, Springer Verlag.

    Google Scholar 

  18. P. MacKenzie and J. Sorensen, Anonymous Investing: Hiding the Identities of Stockholders, in Proceedings of Financial Cryptography 1999, Springer Verlag.

    Google Scholar 

  19. M. Naor and B. Pinkas, Efficient Oblivious Transfer Protocols, in Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001).

    Google Scholar 

  20. T. Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, in Proceedings of “Advances in Cryptology-CRYPTO’91”, Lecture Notes in Computer Science, Springer Verlag.

    Google Scholar 

  21. M. Rabin, How to Exchange Secrets by Oblivious Transfer, TR-81 Aiken Computation Laboratory, Harvard, 1981.

    Google Scholar 

  22. A. Shamir, How to Share a Secret, in Communications of the ACM, vol. 22, pp. 612–613, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  23. K. Sako, An Auction Protocol Which Hides Bids of Losers, in Proceedings of Public-Key Cryptography 2000, Springer Verlag.

    Google Scholar 

  24. K. Sakurai and S. Miyazaki, A Bulletin-Board based Digital Auction Scheme with Bidding Down Strategy, in Proceedings of 1999 International Workshop on Cryptographic Techniques and E-Commerce.

    Google Scholar 

  25. T. Sander, A. Young, and M. Yung, Cryptocomputing in NC 1, in Proceedings of 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS’99).

    Google Scholar 

  26. S. Stubblebine and P. Syverson, Fair on-line Auctions without Special Trusted Parties, in Proceedings of Financial Cryptography 1999, Springer Verlag.

    Google Scholar 

  27. A.C. Yao, Protocols for Secure Computations, in Proceedings of 23th Annual IEEE Symposium on Foundations of Computer Science (FOCS’82).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Telcordia Technologies Inc., 445 South Street, Morristown, NJ, 07960, USA

    Giovanni Di Crescenzo

Authors
  1. Giovanni Di Crescenzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Naval Research Laboratory, Washington, DC, 20375, USA

    Paul Syverson

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Crescenzo, G. (2002). Privacy for the Stock Market. In: Syverson, P. (eds) Financial Cryptography. FC 2001. Lecture Notes in Computer Science, vol 2339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46088-8_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-46088-8_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44079-6

  • Online ISBN: 978-3-540-46088-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation