{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:03:01Z","timestamp":1766048581734},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T00:00:00Z","timestamp":1433289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Swiss SNF","award":["200020-132794"],"award-info":[{"award-number":["200020-132794"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10623-015-0103-5","type":"journal-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T11:18:01Z","timestamp":1433243881000},"page":"663-676","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Zero-knowledge proofs of knowledge for group homomorphisms"],"prefix":"10.1007","volume":"77","author":[{"given":"Ueli","family":"Maurer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,3]]},"reference":[{"key":"103_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal D., Maurer U.: Breaking RSA generically is equivalent to factoring. In: Advances in Cryptology\u2014EUROCRYPT 2009. Lecture Notes in Computer Science, vol. 5479, pp. 36\u201353. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-01001-9_2"},{"key":"103_CR2","unstructured":"Bangerter E.: Efficient zero knowledge proofs of knowledge for homomorphisms. Ph.D. Thesis, Ruhr University Bochum (2005)."},{"key":"103_CR3","doi-asserted-by":"crossref","unstructured":"Bangerter E., Camenisch J., Maurer U.: Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order. In: Public Key Cryptography\u2014PKC 2005. Lecture Notes in Computer Science, vol. 3386, pp. 154\u2013171. Springer, Berlin (2005).","DOI":"10.1007\/978-3-540-30580-4_11"},{"key":"103_CR4","doi-asserted-by":"crossref","unstructured":"Bangerter E., Camenisch J., Krenn S.: Efficiency limitations for $$\\varSigma $$ \u03a3 -protocols for group homomorphisms. In: Theory of Cryptography TCC. Lecture Notes in Computer Science, vol. 5978, pp. 553\u2013571. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-11799-2_33"},{"key":"103_CR5","doi-asserted-by":"crossref","unstructured":"Camenisch J., Kiayias A., Yung M.: On the portability of generalized Schnorr proofs. In: Advances in Cryptology\u2014EUROCRYPT 2009. Lecture Notes in Computer Science, vol. 5479, pp. 425\u2013442. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-01001-9_25"},{"key":"103_CR6","unstructured":"Cramer R.: Modular design of secure, yet practical cryptographic protocols. Ph.D. Thesis, University of Amsterdam (1996)."},{"key":"103_CR7","unstructured":"Damg\u00e5rd I.: On $$\\varSigma $$ \u03a3 -Protocols. Course Notes. \u00c5rhus University, Denmark (2002)."},{"key":"103_CR8","doi-asserted-by":"crossref","unstructured":"Diffie W., Hellman M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976).","DOI":"10.1109\/TIT.1976.1055638"},{"key":"103_CR9","doi-asserted-by":"crossref","unstructured":"Feige U., Fiat A., Shamir A.: Zero-knowledge proofs of identity. J. Cryptol. 1, 77\u201394 (1988).","DOI":"10.1007\/BF02351717"},{"key":"103_CR10","doi-asserted-by":"crossref","unstructured":"Fiat A., Shamir A.: How to prove yourself: practical solution to identification and signature problems. In: Advances in Cryptology\u2014CRYPTO \u201986. Lecture Notes in Computer Science, vol. 263, pp. 186\u2013194. Springer, Berlin (1987).","DOI":"10.1007\/3-540-47721-7_12"},{"key":"103_CR11","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Micali S., Rackoff C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18, 186\u2013208 (1989).","DOI":"10.1137\/0218012"},{"key":"103_CR12","doi-asserted-by":"crossref","unstructured":"Guillou L.C., Quisquater J.-J.: A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In: Advances in Cryptology\u2014EUROCRYPT \u201988. Lecture Notes in Computer Science, vol. 330, pp. 123\u2013128. Springer, Berlin (1988).","DOI":"10.1007\/3-540-45961-8_11"},{"key":"103_CR13","doi-asserted-by":"crossref","unstructured":"Koyama K., Maurer U., Okamoto T., Vanstone S.A.: New public-key schemes based on elliptic curves over $$Z_n$$ Z n . In: Advances in Cryptology\u2014CRYPTO \u201991. Lecture Notes in Computer Science, vol. 576, pp. 252\u2013266. Springer, Berlin (1992).","DOI":"10.1007\/3-540-46766-1_20"},{"key":"103_CR14","doi-asserted-by":"crossref","unstructured":"Maurer U.: Unifying zero-knowledge proofs of knowledge. In: Preneel, B. (ed.) Advances in Cryptology\u2014AFRICACRYPT 2009. Lecture Notes in Computer Science, vol. 5580, pp. 272\u2013286. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-02384-2_17"},{"key":"103_CR15","doi-asserted-by":"crossref","unstructured":"Okamoto T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Advances in Cryptology\u2014CRYPTO \u201992. Lecture Notes in Computer Science, vol. 740, pp. 31\u201353. Springer, Berlin (1992).","DOI":"10.1007\/3-540-48071-4_3"},{"key":"103_CR16","doi-asserted-by":"crossref","unstructured":"Pedersen T.: Non-interactive and information-theoretical secure verifiable secret sharing. In: Advances in Cryptology\u2014CRYPTO \u201991. Lecture Notes in Computer Science, vol. 576, pp. 129\u2013140. Springer, Berlin (1991).","DOI":"10.1007\/3-540-46766-1_9"},{"key":"103_CR17","doi-asserted-by":"crossref","unstructured":"Rivest R.L., Shamir A., Adleman L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978).","DOI":"10.1145\/359340.359342"},{"key":"103_CR18","unstructured":"Schnorr C.P.: Efficient identification and signatures for smart cards. In: Advances in Cryptology\u2014CRYPTO \u201989. Lecture Notes in Computer Science, vol. 435, pp. 239\u2013252. Springer, Berlin (1990)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0103-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0103-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0103-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:40Z","timestamp":1559246320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0103-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,3]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["103"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0103-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,3]]}}}