{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T05:31:08Z","timestamp":1791264668025,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642402029","type":"print"},{"value":"9783642402036","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40203-6_3","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T02:48:53Z","timestamp":1376448533000},"page":"38-56","source":"Crossref","is-referenced-by-count":5,"title":["Privacy-Preserving Accountable Computation"],"prefix":"10.1007","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Esfandiar","family":"Mohammadi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Argyraki, K., Maniatis, P., Irzak, O., Ashish, S., Shenker, S.: Loss and delay accountability for the internet. In: IEEE International Conference on Network Protocols, ICNP 2007, pp. 194\u2013205 (October 2007)","DOI":"10.1109\/ICNP.2007.4375850"},{"key":"3_CR2","unstructured":"Backes, M., Druschel, P., Haeberlen, A., Unruh, D.: Csar: A practical and provable technique to make randomized systems accountable. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 2009 (2009)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-03298-1_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M. Belenkiy","year":"2009","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: Compact e-cash and simulatable VRFs revisited. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 114\u2013131. Springer, Heidelberg (2009)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/0-387-34805-0_19","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Bellare","year":"1990","unstructured":"Bellare, M., Goldwasser, S.: New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 194\u2013211. Springer, Heidelberg (1990)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D. Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the sdh assumption in bilinear groups. Journal of Cryptology\u00a021, 149\u2013177 (2008)","journal-title":"Journal of Cryptology"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. IACR Cryptology ePrint Archive, 2000:67 (2000)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-74143-5_17","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Chase","year":"2007","unstructured":"Chase, M., Lysyanskaya, A.: Simulatable VRFs with applications to multi-theorem NIZK. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 303\u2013322. Springer, Heidelberg (2007)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Freedman, M.J., Molnar, D.: Accountability. In: Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O\u2019Reilly and Associates (2001)","DOI":"10.1145\/375348.377427"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 416\u2013431. Springer, Heidelberg (2005)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J. Groth","year":"2010","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 321\u2013340. Springer, Heidelberg (2010)"},{"issue":"5","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/080725386","volume":"41","author":"J. Groth","year":"2012","unstructured":"Groth, J., Sahai, A.: Efficient noninteractive proof systems for bilinear groups. SIAM Journal on Computing\u00a041(5), 1193\u20131232 (2012)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR14","unstructured":"Haeberlen, A., Avramopoulos, I., Rexford, J., Druschel, P.: NetReview: Detecting when interdomain routing goes wrong. In: Proceedings of the 6th Symposium on Networked Systems Design and Implementation, NSDI 2009 (2009)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kuznetsov, P., Druschel, P.: PeerReview: Practical accountability for distributed systems. In: Proceedings of the 21st ACM Symposium on Operating Systems Principles, SOSP 2007 (2007)","DOI":"10.1145\/1294261.1294279"},{"key":"3_CR16","unstructured":"Hofheinz, D., Shoup, V.: Gnuc: A new universal composability framework. IACR Cryptology ePrint Archive, p. 303 (2011)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T., Vogt, A.: Accountability: definition and relationship to verifiability. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010, pp. 526\u2013535 (2010)","DOI":"10.1145\/1866307.1866366"},{"key":"3_CR18","unstructured":"K\u00fcsters, R.: Simulation-based security with inexhaustible interactive turing machines. In: Proc. 19th IEEE Computer Security Foundations Workshop, pp. 309\u2013320 (2006)"},{"key":"3_CR19","unstructured":"Lampson, B.W.: Computer security in the real world. In: Proc. Annual Computer Security Applications Conference (December 2000)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Laskowski, P., Chuang, J.: Network monitors and contracting systems: competition and innovation. In: Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2006, New York, NY, USA, pp. 183\u2013194 (2006)","DOI":"10.1145\/1159913.1159935"},{"key":"3_CR21","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th FOCS, New York, New York, USA, October 17-19, pp. 120\u2013130 (1999)"},{"key":"3_CR22","unstructured":"Michalakis, N., Soul\u00e9, R., Grimm, R.: Ensuring content integrity for untrusted peer-to-peer content distribution networks. In: Proceedings of the 4th USENIX Conference on Networked Systems Design & Implementation, NSDI 2007, p. 11 (2007)"},{"key":"3_CR23","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. IEEE Symposium on Security and Privacy, p. 0184 (2001)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Yumerefendi, A.R., Chase, J.S.: Trust but verify: accountability for network services. In: Proceedings of the 11th Workshop on ACM SIGOPS European Workshop, EW 11, New York, NY, USA (2004)","DOI":"10.1145\/1133572.1133585"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Yumerefendi, A.R., Chase, J.S.: Strong accountability for network storage. In: 5th USENIX Conference on File and Storage Technologies (2007)","DOI":"10.1145\/1288783.1288786"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40203-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:46:48Z","timestamp":1559508408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40203-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402029","9783642402036"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40203-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}