{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:26:49Z","timestamp":1725892009429},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462552"},{"type":"electronic","value":"9783540462569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889663_25","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T14:12:37Z","timestamp":1160403157000},"page":"311-325","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Cryptographic Protocols Realizing E-Markets with Price Discrimination"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44598-6_16","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"G. Ateniese","year":"2000","unstructured":"Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, Springer, Heidelberg (2000)"},{"key":"25_CR2","unstructured":"Benaloh, J.: Verifiable Secret-Ballot Elections, PhD Thesis, Yale University (1987)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient Proofs that a Committed Number Lies in an Interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, Springer, Heidelberg (2000)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054154","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"A.H. Chan","year":"1998","unstructured":"Chan, A.H., Frankel, Y., Tsiounis, Y.: Easy Come - Easy Go Divisible Cash. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, Springer, Heidelberg (1998)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Cohen (Benaloh), J.D., Fischer, M.J.: A Robust and Verifiable Cryptographically Secure Election Scheme. In: FOCS 1985 (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, Springer, Heidelberg (1997)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, Springer, Heidelberg (1994) (a personal generator for G)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-46088-8_22","volume-title":"Financial Cryptography","author":"G. Crescenzo Di","year":"2002","unstructured":"Di Crescenzo, G.: Privacy for the Stock Market. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, pp. 269\u2013288. Springer, Heidelberg (2002)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Public Key Cryptography, pp. 119\u2013136 (2001)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Santis, A.D., Crescenzo, G.D., Persiano, G., Yung, M.: On Monotone Formula Closure of SZK. In: FOCS 1994 (1994)","DOI":"10.1109\/SFCS.1994.365745"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, Springer, Heidelberg (1987)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P.-A. Fouque","year":"2001","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing Decryption in the Context of Voting or Lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, Springer, Heidelberg (2001)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser, S.: Multi-party computations: Past and present (invited talk). In: PODC 1997, pp. 1\u20136 (1997)","DOI":"10.1145\/259380.259405"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth annual ACM Symp. Theory of Computing (1987)","DOI":"10.1145\/28395.28420"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-24676-3_34","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A. Kiayias","year":"2004","unstructured":"Kiayias, A., Tsiounis, Y., Yung, M.: Traceable Signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 571\u2013589. Springer, Heidelberg (2004)"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_1","volume-title":"STACS 99","author":"N. Nisan","year":"1999","unstructured":"Nisan, N.: Algorithms for Selfish Agents. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, Springer, Heidelberg (1999)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.: Privacy, Economics, and Price Discrimination on the Internet. In: First Workshop on Economics and Information Security, Berkeley (2002)","DOI":"10.2139\/ssrn.429762"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, Springer, Heidelberg (1999)"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45472-1_18","volume-title":"Financial Cryptography","author":"D. Pointcheval","year":"2001","unstructured":"Pointcheval, D.: Self-Scrambling Anonymizers, Financial Cryptography. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 259\u2013275. Springer, Heidelberg (2001)"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"M. Rabin","year":"1983","unstructured":"Rabin, M.: Transactions protected by beacons. Journal of Computer and System Sciences\u00a027, 256\u2013267 (1983)","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Varian, H.R.: Differential Pricing and Efficiency, First Monday, peer-reviewed journal on the Internet (1996), http:\/\/www.firstmonday.dk\/issues\/issue2\/different\/","DOI":"10.5210\/fm.v1i2.473"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: IEEE FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889663_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T23:52:48Z","timestamp":1627861968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889663_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462552","9783540462569"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11889663_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}