{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:19:40Z","timestamp":1769977180753,"version":"3.49.0"},"publisher-location":"Cham","reference-count":66,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030171377","type":"print"},{"value":"9783030171384","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-17138-4_5","type":"book-chapter","created":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T14:04:43Z","timestamp":1554213883000},"page":"99-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["$$\\textsc {Wys}^\\star $$ : A DSL for Verified Secure Multi-party Computations"],"prefix":"10.1007","author":[{"given":"Aseem","family":"Rastogi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikhil","family":"Swamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hicks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,3]]},"reference":[{"key":"5_CR1","unstructured":"Frama-c. \n                    https:\/\/frama-c.com\/"},{"key":"5_CR2","unstructured":"Z3 theorem prover. \n                    z3.codeplex.com"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24676-3_3","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"G Aggarwal","year":"2004","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the \n                    \n                      \n                    \n                    $$k^{th}$$\n                  -ranked element. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 40\u201355. Springer, Heidelberg (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-540-24676-3_3"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Almeida, J.B., et al.: A fast and verified software stack for secure function evaluation. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017 (2017)","DOI":"10.1145\/3133956.3134017"},{"key":"5_CR5","unstructured":"Almeida, J.B., et al.: Verified implementations for secure and verifiable computation (2014)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Araki, T., et al.: Generalizing the SPDZ compiler for other protocols. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018 (2018)","DOI":"10.1145\/3243734.3243854"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Atkey, R.: Parameterised notions of computation. J. Funct. Program. 19, 335\u2013376 (2009). \n                    https:\/\/doi.org\/10.1017\/S095679680900728X\n                    \n                  . \n                    http:\/\/journals.cambridge.org\/article_S095679680900728X","DOI":"10.1017\/S095679680900728X"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11541868_4","volume-title":"Theorem Proving in Higher Order Logics","author":"BE Aydemir","year":"2005","unstructured":"Aydemir, B.E., et al.: Mechanized metatheory for the masses: the PoplMark challenge. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 50\u201365. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/11541868_4"},{"key":"5_CR9","unstructured":"Backes, M., Maffei, M., Mohammadi, E.: Computationally sound abstraction and verification of secure multi-party computations. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) (2010)"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Barthe, G., Fournet, C., Gr\u00e9goire, B., Strub, P., Swamy, N., B\u00e9guelin, S.Z.: Probabilistic relational verification for cryptographic implementations. In: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014, pp. 193\u2013206 (2014). \n                    https:\/\/doi.org\/10.1145\/2535838.2535847","DOI":"10.1145\/2535838.2535847"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-22792-9_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Barthe","year":"2011","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., B\u00e9guelin, S.Z.: Computer-aided security proofs for the working cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 71\u201390. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22792-9_5"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: STOC (1990)","DOI":"10.1145\/100216.100287"},{"key":"5_CR13","unstructured":"Bedrock, a coq library for verified low-level programming. \n                    http:\/\/plv.csail.mit.edu\/bedrock\/"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: CCS (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"5_CR15","unstructured":"Bhargavan, K., Fournet, C., Kohlweiss, M., Pironti, A., Strub, P.Y.: Implementing TLS with verified cryptographic security. In: IEEE Symposium on Security & Privacy, Oakland, pp. 445\u2013462 (2013). \n                    http:\/\/www.ieee-security.org\/TC\/SP2013\/papers\/4977a445.pdf"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-662-47854-7_14","volume-title":"Financial Cryptography and Data Security","author":"D Bogdanov","year":"2015","unstructured":"Bogdanov, D., J\u00f5emets, M., Siim, S., Vaht, M.: How the Estonian Tax and Customs Board Evaluated a tax fraud detection system based on secure multi-party computation. In: B\u00f6hme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 227\u2013234. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-47854-7_14"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192\u2013206. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-88313-5_13"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-03549-4_20"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"B\u00fcscher, N., Demmler, D., Katzenbeisser, S., Kretzmer, D., Schneider, T.: HyCC: compilation of hybrid protocols for practical secure computation. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018 (2018)","DOI":"10.1145\/3243734.3243786"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000). \n                    https:\/\/doi.org\/10.1007\/s001459910006","journal-title":"J. Cryptol."},{"key":"5_CR21","unstructured":"Chandran, N., Gupta, D., Rastogi, A., Sharma, R., Tripathi, S.: EzPC: programmable, efficient, and scalable secure two-party computation for machine learning. Cryptology ePrint Archive, Report 2017\/1109 (2017). \n                    https:\/\/eprint.iacr.org\/2017\/1109"},{"key":"5_CR22","unstructured":"Choi, S.G., Hwang, K.W., Katz, J., Malkin, T., Rubenstein, D.: Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces (2011). \n                    http:\/\/eprint.iacr.org\/"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Crockett, E., Peikert, C., Sharp, C.: Alchemy: a language and compiler for homomorphic encryption made easy. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018 (2018)","DOI":"10.1145\/3243734.3243828"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theoret. Comput. Sci. 103(2), 235\u2013271 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Fromherz, A., Giannarakis, N., Hawblitzel, C., Parno, B., Rastogi, A., Swamy, N.: A verified, efficient embedding of a verifiable assembly language. In: 46th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2019 (2019)","DOI":"10.1145\/3290376"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: STOC (1987)","DOI":"10.1145\/28395.28420"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Holzer, A., Franz, M., Katzenbeisser, S., Veith, H.: Secure two-party computations in ANSI C. In: CCS (2012)","DOI":"10.1145\/2382196.2382278"},{"key":"5_CR28","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS (2012)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"5_CR30","unstructured":"Juvekar, C., Vaikuntanathan, V., Chandrakasani, A.: GAZELLE: a low latency framework for secure neural network inference. In: USENIX Security 2018 (2018)"},{"key":"5_CR31","unstructured":"Kamm, L.: Privacy-preserving statistical analysis using secure multi-party computation. Ph.D. thesis, University of Tartu (2015)"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Automatically optimizing secure computation. In: CCS (2011)","DOI":"10.1145\/2046707.2046786"},{"issue":"9","key":"5_CR33","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MC.2011.224","volume":"44","author":"F Kerschbaum","year":"2011","unstructured":"Kerschbaum, F., et al.: Secure collaborative supply-chain management. Computer 44(9), 38\u201343 (2011)","journal-title":"Computer"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Laud, P., Randmets, J.: A domain-specific language for low-level secure multiparty computation protocols. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS 2015 (2015)","DOI":"10.1145\/2810103.2813664"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Launchbury, J., Diatchki, I.S., DuBuisson, T., Adams-Moran, A.: Efficient lookup-table protocol in secure multiparty computation. In: ICFP (2012)","DOI":"10.1145\/2364527.2364556"},{"issue":"7","key":"5_CR36","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1538788.1538814","volume":"52","author":"X Leroy","year":"2009","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009)","journal-title":"Commun. ACM"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Liu, C., Huang, Y., Shi, E., Katz, J., Hicks, M.: Automating efficient RAM-model secure computation. In: IEEE Symposium on Security and Privacy, Oakland (2014)","DOI":"10.1109\/SP.2014.46"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Liu, J., Juuti, M., Lu, Y., Asokan, N.: Oblivious neural network predictions via MiniONN transformations. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017 (2017)","DOI":"10.1145\/3133956.3134056"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Malka, L.: VMCrypt: modular software architecture for scalable secure computation. In: CCS (2011)","DOI":"10.1145\/2046707.2046787"},{"key":"5_CR40","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay: a secure two-party computation system. In: USENIX Security (2004)"},{"key":"5_CR41","unstructured":"Mardziel, P., Hicks, M., Katz, J., Hammer, M., Rastogi, A., Srivatsa, M.: Knowledge inference for optimizing and enforcing secure computations. In: Proceedings of the Annual Meeting of the US\/UK International Technology Alliance (2013)"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Meijer, E., Beckman, B., Bierman, G.: LINQ: reconciling object, relations and xml in the .net framework. In: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, SIGMOD 2006, p. 706. ACM, New York (2006). \n                    https:\/\/doi.org\/10.1145\/1142473.1142552","DOI":"10.1145\/1142473.1142552"},{"issue":"1","key":"5_CR43","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991). \n                    https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4","journal-title":"Inf. Comput."},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Zhang, Y.: SecureML: a system for scalable privacy-preserving machine learning. In: IEEE S&P (2017)","DOI":"10.1109\/SP.2017.12"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Mood, B., Gupta, D., Carter, H., Butler, K.R.B., Traynor, P.: Frigate: a validated, extensible, and efficient compiler and interpreter for secure computation. In: IEEE EuroS&P (2016)","DOI":"10.1109\/EuroSP.2016.20"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Nanevski, A., Morrisett, G., Shinnar, A., Govereau, P., Birkedal, L.: Ynot: dependent types for imperative programs. In: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, ICFP (2008)","DOI":"10.1145\/1411204.1411237"},{"issue":"5\u20136","key":"5_CR47","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1017\/S0956796808006953","volume":"18","author":"A Nanevski","year":"2008","unstructured":"Nanevski, A., Morrisett, J.G., Birkedal, L.: Hoare type theory, polymorphism and separation. J. Funct. Program. 18(5\u20136), 865\u2013911 (2008). \n                    http:\/\/ynot.cs.harvard.edu\/papers\/jfpsep07.pdf","journal-title":"J. Funct. Program."},{"key":"5_CR48","unstructured":"Nielsen, J.D.: Languages for secure multiparty computation and towards strongly typed macros. Ph.D. thesis (2009)"},{"key":"5_CR49","doi-asserted-by":"crossref","unstructured":"Nielsen, J.D., Schwartzbach, M.I.: A domain-specific programming language for secure multiparty computation. In: PLAS (2007)","DOI":"10.1145\/1255329.1255333"},{"key":"5_CR50","unstructured":"PolarSSL verification kit (2015). \n                    http:\/\/trust-in-soft.com\/polarssl-verification-kit\/"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Protzenko, J., et al.: Verified low-level programming embedded in F* (ICFP) (2017)","DOI":"10.1145\/3110261"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"Rastogi, A., Hammer, M.A., Hicks, M.: Wysteria: a programming language for generic, mixed-mode multiparty computations. In: Proceedings of the 2014 IEEE Symposium on Security and Privacy (2014)","DOI":"10.1109\/SP.2014.48"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Rastogi, A., Mardziel, P., Hammer, M., Hicks, M.: Knowledge inference for optimizing secure multi-party computation. In: PLAS (2013)","DOI":"10.1145\/2465106.2465117"},{"key":"5_CR54","unstructured":"Rastogi, A., Swamy, N., Hicks, M.: WYS*: a DSL for verified secure multi-party computations (2019). \n                    https:\/\/arxiv.org\/abs\/1711.06467"},{"key":"5_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-37621-7_9","volume-title":"Software Security - Theories and Systems","author":"A Sabelfeld","year":"2004","unstructured":"Sabelfeld, A., Myers, A.C.: A model for delimited information release. In: Futatsugi, K., Mizoguchi, F., Yonezaki, N. (eds.) ISSS 2003. LNCS, vol. 3233, pp. 174\u2013191. Springer, Heidelberg (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-540-37621-7_9"},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"Schropfer, A., Kerschbaum, F., Muller, G.: L1 - an intermediate language for mixed-protocol secure computation. In: COMPSAC (2011)","DOI":"10.1109\/COMPSAC.2011.46"},{"issue":"11","key":"5_CR57","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":"5_CR58","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-1-4684-6686-7_5","volume-title":"The Mathematical Gardner","author":"A Shamir","year":"1981","unstructured":"Shamir, A., Rivest, R.L., Adleman, L.M.: Mental poker. In: Klarner, D.A. (ed.) The Mathematical Gardner, pp. 37\u201343. Springer, Boston (1981). \n                    https:\/\/doi.org\/10.1007\/978-1-4684-6686-7_5"},{"key":"5_CR59","doi-asserted-by":"crossref","unstructured":"Swamy, N., et al.: Dependent types and multi-monadic effects in F*. In: POPL (2016)","DOI":"10.1145\/2837614.2837655"},{"key":"5_CR60","unstructured":"The Coq Development Team: The Coq proof assistant. \n                    http:\/\/coq.inria.fr"},{"key":"5_CR61","unstructured":"VIFF, the virtual ideal functionality framework. \n                    http:\/\/viff.dk\/"},{"key":"5_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-59451-5_2","volume-title":"Advanced Functional Programming","author":"P Wadler","year":"1995","unstructured":"Wadler, P.: Monads for functional programming. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 24\u201352. Springer, Heidelberg (1995). \n                    https:\/\/doi.org\/10.1007\/3-540-59451-5_2\n                    \n                  . \n                    http:\/\/dl.acm.org\/citation.cfm?id=647698.734146"},{"key":"5_CR63","doi-asserted-by":"crossref","unstructured":"Yang, J., Hawblitzel, C.: Safe to the last instruction: automated verification of a type-safe operating system. In: Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010 (2010)","DOI":"10.1145\/1806596.1806610"},{"key":"5_CR64","doi-asserted-by":"crossref","unstructured":"Yang, X., Chen, Y., Eide, E., Regehr, J.: Finding and understanding bugs in C compilers. In: Proceedings of ACM SIGPLAN 2011 Conference on Programming Language Design and Implementation (2011)","DOI":"10.1145\/1993498.1993532"},{"key":"5_CR65","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"5_CR66","unstructured":"Zahur, S., Evans, D.: Obliv-C: a language for extensible data-oblivious computation. Unpublished (2015). \n                    http:\/\/oblivc.org\/downloads\/oblivc.pdf"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17138-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:16:44Z","timestamp":1558343804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17138-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030171377","9783030171384"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17138-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"POST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles of Security and Trust","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"post2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/post","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}