{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:08:57Z","timestamp":1766066937332,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030036379"},{"type":"electronic","value":"9783030036386"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03638-6_1","type":"book-chapter","created":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T03:12:53Z","timestamp":1541041973000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Privacy-Preserving Distributed Economic Dispatch Protocol for Smart Grid"],"prefix":"10.1007","author":[{"given":"Avikarsha","family":"Mandal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Armknecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Zenner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,2]]},"reference":[{"key":"1_CR1","unstructured":"Distribution network operators in baden w\u00fcrttemberg. https:\/\/www.energieatlas-bw.de\/netze\/verteilnetzbetreiber-strom . Accessed 30 July 2018"},{"key":"1_CR2","unstructured":"A framework for efficient secure computation. http:\/\/fresco.readthedocs.io\/en\/latest\/ . Accessed: 17 Aug 2017"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 1986","author":"JC Benaloh","year":"1987","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret secret (Extended Abstract). In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251\u2013260. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_19"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TII.2013.2287807","volume":"10","author":"G Binetti","year":"2014","unstructured":"Binetti, G., Davoudi, A., Naso, D., Turchiano, B., Lewis, F.L.: A distributed auction-based algorithm for the nonconvex economic dispatch problem. IEEE Trans. Ind. Inf. 10(2), 1124\u20131132 (2014)","journal-title":"IEEE Trans. Ind. Inf."},{"key":"1_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, Cambridge (2015)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285\u2013304. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_15"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"issue":"6","key":"1_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"2006","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theor. 22(6), 644\u2013654 (2006)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MPE.2009.934876","volume":"8","author":"H Farhangi","year":"2010","unstructured":"Farhangi, H.: The path of the smart grid. IEEE Power Energy Mag. 8(1), 18\u201328 (2010)","journal-title":"IEEE Power Energy Mag."},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1109\/59.76723","volume":"6","author":"M Huneault","year":"1991","unstructured":"Huneault, M., Galiana, F.D.: A survey of the optimal power flow literature. IEEE Trans. Power Syst. 6(2), 762\u2013770 (1991)","journal-title":"IEEE Trans. Power Syst."},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-642-39212-2_56","volume-title":"Automata, Languages, and Programming","author":"H Lipmaa","year":"2013","unstructured":"Lipmaa, H., Toft, T.: Secure equality and greater-than tests with sublinear online complexity. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 645\u2013656. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_56"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"7911","DOI":"10.1109\/ACCESS.2018.2802456","volume":"6","author":"E Liu","year":"2018","unstructured":"Liu, E., Cheng, P.: Mitigating cyber privacy leakage for distributed dc optimal power flow in smart grid with radial topology. IEEE Access 6, 7911\u20137920 (2018)","journal-title":"IEEE Access"},{"key":"1_CR14","unstructured":"Danezis, G., Jawurek, M., Kerschbaum, F.: Sok: Privacy Technologies for Smart Grids - A Survey of Options. Microsoft Res., Cambridge, UK (2012)"},{"key":"1_CR15","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-48021-3_7","volume-title":"Future Network Systems and Security","author":"A Mandal","year":"2016","unstructured":"Mandal, A.: Privacy preserving consensus-based economic dispatch in smart grid systems. In: Doss, R., Piramuthu, S., Zhou, W. (eds.) FNSS 2016. CCIS, vol. 670, pp. 98\u2013110. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48021-3_7"},{"key":"1_CR16","unstructured":"Mandal, A., Zenner, E.: Poster: privacy in distributed economic dispatch in smart grid. In: 2nd IEEE European Symposium on Security and Privacy (EuroS&P) (2017)"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0531(92)90091-U","volume":"56","author":"RP McAfee","year":"1992","unstructured":"McAfee, R.P.: A dominant strategy double auction. J. Econ. Theory 56(2), 434\u2013450 (1992)","journal-title":"J. Econ. Theory"},{"issue":"11","key":"1_CR18","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"1_CR19","unstructured":"FERC Staff. Economic dispatch: Concepts, practices and issues. https:\/\/www.ferc.gov\/CalendarFiles\/20051110172953-FERC%20Staff%20Presentation.pdf . Accessed 30 July 2018"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/SURV.2012.021312.00034","volume":"15","author":"Y Yan","year":"2013","unstructured":"Yan, Y., Qian, Y., Sharif, H., Tipper, D.: A survey on smart grid communication infrastructures: motivations, requirements and challenges. IEEE Commun. Surv. Tutor. 15(1), 5\u201320 (2013)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"4","key":"1_CR21","doi-asserted-by":"publisher","first-page":"4416","DOI":"10.1109\/TPWRS.2013.2271640","volume":"28","author":"S Yang","year":"2013","unstructured":"Yang, S., Tan, S., Xu, J.: Consensus based approach for economic dispatch problem in a smart grid. IEEE Trans. Power Syst. 28(4), 4416\u20134426 (2013)","journal-title":"IEEE Trans. Power Syst."},{"issue":"15","key":"1_CR22","doi-asserted-by":"publisher","first-page":"3853","DOI":"10.1049\/iet-gtd.2017.0141","volume":"11","author":"Z Yang","year":"2017","unstructured":"Yang, Z., Cheng, P., Chen, J.: Differential-privacy preserving optimal power flow in smart grid. IET Gener., Transm. Distrib. 11(15), 3853\u20133861 (2017)","journal-title":"IET Gener., Transm. Distrib."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Zhao, C., He, J., Cheng, P., Chen, J.: Privacy-preserving consensus-based energy management in smart grid. In: 2017 IEEE Power Energy Society General Meeting, pp. 1\u20135, July 2017","DOI":"10.1109\/PESGM.2017.8274438"}],"container-title":["Lecture Notes in Computer Science","Secure IT Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03638-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T06:14:36Z","timestamp":1572416076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03638-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030036379","9783030036386"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03638-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"NordSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nordic Conference on Secure IT Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nordsec2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/securitylab.no\/nordsec18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}