Skip to main content

Secure Selection Protocols

  • Conference paper
Information Security and Cryptology - ICISC’99 (ICISC 1999)

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

Included in the following conference series:

Abstract

The process of selection is omnipresent in the real world and modeling this process as a cryptologic protocol will enable cross use of techniques among similar protocol applications, which will eventually lead to better understanding and refinement of these applications. We present a proposal for a specialised selection protocol with anonymity as the security service. An area for its application is anonymous peer review, where no peer should know the identity of the reviewer.

Research supported by the Australian Research Council grant A49804059

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital sigantures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236–250. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Brands, S.: Untraceable off-line cash in wallets with observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 302–318. Springer, Heidelberg (1994)

    Google Scholar 

  3. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)

    Google Scholar 

  4. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. Technical Report CS-R9413, Computer Science/Department of Algorithmics and Architecture, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands (1994)

    Google Scholar 

  5. Desmedt, Y.: Society and group oriented crytpography: A new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120–127. Springer, Heidelberg (1988)

    Google Scholar 

  6. Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) Advances in Cryptology -CRYPTO 1986. LNCS, pp. 186–194. Springer, Heidelberg (1986)

    Google Scholar 

  7. Frankel, Y., Yung, M.: Escrow encryption systems visited: Attacks, analysis and designs. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 222–235. Springer, Heidelberg (1995)

    Google Scholar 

  8. Frankel, Y., Tsiounis, Y., Yung, M.: Indirect discourse proofs: Achieving efficient fair off-line e-cash. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163. Springer, Heidelberg (1996)

    Google Scholar 

  9. Frankel, Y., Tsiounis, Y., Yung, M.: Fair off-line e-cash made easy. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 257–270. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  10. Niemi, V., Renvall, A.: How to prevent buying of votes in computer elections. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 164–170. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  11. Nurmi, H., Salomaa, A., Santean, L.: Secret ballot elections in computer networks. Computers & Security 10, 553–560 (1991)

    Article  Google Scholar 

  12. Okamoto, T.: Receipt-free electronic voting schemes for large scale elections. In: Security Protocol Workshop (1997)

    Google Scholar 

  13. Petersen, H., Poupard, G.: Efficient scalable fair cash with offline extortion prevention. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 463–473. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  14. Schnorr, C.P.: Efficient signature generation for smart cards. Journal of Cryptology 4, 161–174 (1991)

    Article  MATH  Google Scholar 

  15. Yen, S., Laih, C.: Improved digital signature suitable for batch verification. IEEE Transactions on Computers 44(7), 957–959 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Viswanathan, K., Boyd, C., Dawson, E. (2000). Secure Selection Protocols. In: Song, J. (eds) Information Security and Cryptology - ICISC’99. ICISC 1999. Lecture Notes in Computer Science, vol 1787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719994_11

Download citation

  • DOI: https://doi.org/10.1007/10719994_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67380-4

  • Online ISBN: 978-3-540-45568-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics