{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:04:24Z","timestamp":1767337464726},"reference-count":12,"publisher":"Faculty of Electrical Engineering and Computing, Univ. of Zagreb","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CIT"],"published-print":{"date-parts":[[2012]]},"DOI":"10.2498\/cit.1002101","type":"journal-article","created":{"date-parts":[[2012,12,17]],"date-time":"2012-12-17T09:15:52Z","timestamp":1355735752000},"source":"Crossref","is-referenced-by-count":8,"title":["Mixnets: Implementation and Performance Evaluation of Decryption and Re-encryption Types"],"prefix":"10.20532","volume":"20","author":[{"given":"Pance","family":"Ribarski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ljupcho","family":"Antovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"8460","reference":[{"key":"ref0","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"ref0","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[1] R. Aditya, C. Boyd, E.Dawson, B. Lee, K. Peng, Batch verification for equality of discrete logarithms and threshold decryptions. In Applied Cryptography and Network Security Second International Conference on Applied Cryptography and Network Security (LNCS3089) (M. JAKOBSSON, M. YUNG, J. ZHOU, EDITORS), (2004) pp. 494\u2013508, Yellow Mountain, China. Springer-Verlag. http:\/\/eprints.qut.edu.au\/23930\/","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[3] T. El Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms. In Proceedings of CRYPTO 84 on Advances in cryptology, (1985) pp. 10\u201318, NewYork, NY, USA. Springer-Verlag, NewYork, Inc. ISBN 0-387-15658-5.http:\/\/portal.acm.org\/citation.cfm?id=19478.19480","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[4] J. Furukawa, K. Sako, An efficient publicly verifiable mix-net for long inputs. In Financial Cryptography and Data Security (GIOVANNI DI CRESCENZO, AVI RUBIN, EDITORS), volume 4107 of Lecture Notes in Computer Science, (2006) pp. 111\u2013125. Springer Berlin\/Heidelberg. ISBN 978-3-540-46255-2.","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[6] A. Huszti and A. Peth\u02ddo, A secure electronic exam system. Publicationes Mathematicae, 77(3-4) (2010), 299\u2013312. ISSN 0033-3883.","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[7] T. P. Pedersen, Non-interactive and informationtheoretic secure verifiable secret sharing. In Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO '91, (1992), pp. 129\u2013140, London, UK. Springer-Verlag. ISBN 3-540-55188-3. http:\/\/portal.acm.org\/citation.cfm?id=646756.705507","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[8] A. Serjantov, R.Dingledine, P. Syverson, From a trickle to a flood: Active attacks on several mix types. In Proceedings of Information Hiding Workshop (IH 2002) (F. PETITCOLAS, EDITOR, (2002) pp. 36\u201352. Springer-Verlag, LNCS 2578.","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[9] A. Shamir, How to share a secret. Commun. ACM, 22 (November 1979), 612\u2013613. ISSN 0001-0782. http:\/\/doi.acm.org\/10.1145\/359168.359176","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[10] US-NAVY, Onion routing program, June 2011. http:\/\/www.onion-router.net\/","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[11] US-NAVY, Tor project, June 2011. https:\/\/www.torproject.org\/","DOI":"10.1007\/s00145-006-0347-3"},{"key":"ref0","doi-asserted-by":"crossref","unstructured":"[12] D. Wikstrom, Verificatum \u2013 provably secure mixnet, June 2011. http:\/\/www.verificatum.com\/verificatum\/index.html","DOI":"10.1007\/s00145-006-0347-3"}],"container-title":["Journal of Computing and Information Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/cit.fer.hr\/index.php\/CIT\/article\/view\/2101\/1559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T04:14:22Z","timestamp":1498018462000},"score":1,"resource":{"primary":{"URL":"http:\/\/cit.srce.unizg.hr\/index.php\/CIT\/article\/view\/2101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"URL":"https:\/\/doi.org\/10.2498\/cit.1002101","relation":{},"ISSN":["1330-1136"],"issn-type":[{"value":"1330-1136","type":"print"}],"subject":[],"published":{"date-parts":[[2012]]}}}