{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:16:46Z","timestamp":1770229006947,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":66,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819975624","type":"print"},{"value":"9789819975631","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-7563-1_16","type":"book-chapter","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T20:01:50Z","timestamp":1698696110000},"page":"343-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["LucidiTEE: Scalable Policy-Based Multiparty Computation with Fairness"],"prefix":"10.1007","author":[{"given":"Sivanarayana","family":"Gaddam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranjit","family":"Kumaresan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Raghuraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rohit","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"key":"16_CR1","unstructured":"Intel SGX for linux. https:\/\/github.com\/intel\/linux-sgx"},{"key":"16_CR2","unstructured":"Mint. https:\/\/www.mint.com"},{"key":"16_CR3","unstructured":"OFX: The payments API that lets you scale, simplify and save. https:\/\/developer.ofx.com\/"},{"key":"16_CR4","unstructured":"Rocksdb. https:\/\/github.com\/facebook\/rocksdb"},{"key":"16_CR5","unstructured":"Tendermint core in go. https:\/\/github.com\/tendermint\/tendermint"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Androulaki, E., et al.: Hyperledger fabric: a distributed operating system for permissioned blockchains. In: Proceedings of the Thirteenth EuroSys Conference, EuroSys 2018, pp. 30:1\u201330:15. ACM, New York, NY, US (2018)","DOI":"10.1145\/3190508.3190538"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: Security and Privacy (SP), 2014 IEEE Symposium on, pp. 443\u2013458. IEEE (2014)","DOI":"10.1109\/SP.2014.35"},{"key":"16_CR8","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, \u0141.: Fair two-party computations via bitcoin deposits. Cryptology ePrint Archive, Report 2013\/837 (2013). https:\/\/eprint.iacr.org\/2013\/837"},{"key":"16_CR9","unstructured":"Baudet, M., et al.: State machine replication in the libra blockchain (2019)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-44381-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"A Beimel","year":"2014","unstructured":"Beimel, A., Gabizon, A., Ishai, Y., Kushilevitz, E., Meldgaard, S., Paskin-Cherniavsky, A.: Non-interactive secure multiparty computation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 387\u2013404. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_22"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/978-3-319-56617-7_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"A Beimel","year":"2017","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E.: Ad Hoc PSM protocols: secure computation without coordination. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 580\u2013608. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_20"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-22792-9_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A Beimel","year":"2011","unstructured":"Beimel, A., Lindell, Y., Omri, E., Orlov, I.: 1\/p-secure multiparty computation without honest majority and the best of both worlds. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 277\u2013296. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_16"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00145-008-9026-x","volume":"21","author":"M Bellare","year":"2008","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: relations among notions and analysis of the generic composition paradigm. J. Cryptol. 21(4), 469\u2013491 (2008)","journal-title":"J. Cryptol."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-662-44381-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"I Bentov","year":"2014","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 421\u2013439. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_24"},{"key":"16_CR15","unstructured":"Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., Wu, H.. Zexe: enabling decentralized private computation. Cryptology ePrint Archive, Report 2018\/962 (2018). https:\/\/eprint.iacr.org\/2018\/962"},{"key":"16_CR16","unstructured":"Bowman, M., Miele, A., Steiner, M., Vavala, B.: Private data objects: an overview. arXiv preprint arXiv:1807.05686 (2018)"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Brandenburger, M., Cachin, C., Lorenz, M., Kapitza, R\u00fc.: Rollback and forking detection for trusted execution environments using lightweight collective memory. In: 2017 47th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 157\u2013168. IEEE (2017)","DOI":"10.1109\/DSN.2017.45"},{"key":"16_CR18","unstructured":"Brickell, E., Li, J.: Enhanced privacy id from bilinear pairing. Cryptology ePrint Archive, Report 2009\/095 (2009)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-319-66402-6_21","volume-title":"Computer Security \u2013 ESORICS 2017","author":"S Chandra","year":"2017","unstructured":"Chandra, S., Karande, V., Lin, Z., Khan, L., Kantarcioglu, M., Thuraisingham, B.: Securing data analytics on SGX with randomization. In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017. LNCS, vol. 10492, pp. 352\u2013369. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66402-6_21"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Cheng, R., et al.: Ekiden: a platform for confidentiality-preserving, trustworthy, and performant smart contract execution. CoRR, abs\/1804.05141 (2018)","DOI":"10.1109\/EuroSP.2019.00023"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Green, M., Jain, A., Kaptchuk, G., Miers, I.: Fairness in an unfair world: Fair multiparty computation from public bulletin boards. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 719\u2013728. ACM, New York, NY, USA (2017)","DOI":"10.1145\/3133956.3134092"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 364\u2013369. ACM, New York, NY, USA (1986)","DOI":"10.1145\/12130.12168"},{"key":"16_CR24","unstructured":"Das, P., et al.: FastKitten: practical smart contracts on bitcoin. In: 28th USENIX Security Symposium (USENIX Security 19), pp. 801\u2013818. USENIX Association, Santa Clara, CA (2019)"},{"key":"16_CR25","unstructured":"Dheeru, D., Taniskidou, E.K.: UCI machine learning repository (2017)"},{"key":"16_CR26","unstructured":"Dinh, T.T.A., Saxena, P., Chang, E.C., Ooi, B.C., Zhang, C.: M2R: enabling stronger privacy in mapreduce computation. In: USENIX Security Symposium, pp. 447\u2013462 (2015)"},{"key":"16_CR27","unstructured":"Gaddam, S., et al.: LucidiTEE: a tee-blockchain system for policy-compliant multiparty computation with fairness. Cryptology ePrint Archive, Report 2019\/178 (2019)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Felsen, S., Kiss, \u00c1., Schneider, T., Weinert, C.: Secure and private function evaluation with intel SGX (2019)","DOI":"10.1145\/3338466.3358919"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Fisch, B., Vinayagamurthy, D., Boneh, D., Gorbunov, S.: Iron: functional encryption using intel SGX. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 765\u2013782. ACM, New York, NY, USA (2017)","DOI":"10.1145\/3133956.3134106"},{"issue":"2","key":"16_CR30","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Gentry, C., et al.: Fully homomorphic encryption using ideal lattices. In: Stoc, vol. 9, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: Scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, SOSP 2017, pp. 51\u201368. ACM, New York, NY, USA (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-55220-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Goldwasser","year":"2014","unstructured":"Goldwasser, S., et al.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 578\u2013602. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_32"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-85174-5_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"S Goldwasser","year":"2008","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-time programs. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 39\u201356. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_3"},{"issue":"2","key":"16_CR35","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-11799-2_7","volume-title":"Theory of Cryptography","author":"D Gordon","year":"2010","unstructured":"Gordon, D., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On complete primitives for fairness. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 91\u2013108. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_7"},{"key":"16_CR37","unstructured":"Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. In: Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco\/French Riviera, May 30 - June 3, 2010. Proceedings, pp. 157\u2013176 (2010)"},{"issue":"3","key":"16_CR38","doi-asserted-by":"publisher","first-page":"370","DOI":"10.2478\/popets-2019-0052","volume":"2019","author":"A Gribov","year":"2019","unstructured":"Gribov, A., Vinayagamurthy, D., Gorbunov, S.: StealthDB: a scalable encrypted database with full SQL query support. Proc. Priv. Enhancing Technol. 2019(3), 370\u2013388 (2019)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"16_CR39","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the fujisaki-okamoto transformation. Cryptology ePrint Archive, Report 2017\/604 (2017). https:\/\/eprint.iacr.org\/2017\/604"},{"key":"16_CR40","unstructured":"Hunt, T., Zhu, Z., Xu, Y., Peter, S., Witchel, E.: Ryoan: a distributed sandbox for untrusted computation on secret data. In: Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation, OSDI 2016, pp. 533\u2013549. USENIX Association, Berkeley, CA, USA (2016)"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Kaptchuk, G., Miers, I., Green, M.: Giving state to the stateless: augmenting trustworthy computation with ledgers. In: 26th Annual Network and Distributed System Security Symposium, NDSS 2019, San Diego, California, USA, 24\u201327 February 2019 (2019)","DOI":"10.14722\/ndss.2019.23060"},{"key":"16_CR42","doi-asserted-by":"crossref","unstructured":"Kaptchuk, G., Miers, I., Green, M.: Giving state to the stateless: augmenting trustworthy computation with ledgers (2019)","DOI":"10.14722\/ndss.2019.23060"},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-662-49896-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Kiayias","year":"2016","unstructured":"Kiayias, A., Zhou, H.-S., Zikas, V.: Fair and robust multi-party computation using a global transaction ledger. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 705\u2013734. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_25"},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"Kosba, A., Miller, A., Shi, E., Wen, Z., Papamanthou, C.: Hawk: the blockchain model of cryptography and privacy-preserving smart contracts. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 839\u2013858. IEEE (2016)","DOI":"10.1109\/SP.2016.55"},{"key":"16_CR45","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Bentov, I.: How to use bitcoin to incentivize correct computations. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 30\u201341. ACM 2014","DOI":"10.1145\/2660267.2660380"},{"key":"16_CR46","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Vaikuntanathan, V., Vasudevan, P.N.: Improvements to secure computation with penalties. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 406\u2013417 (2016)","DOI":"10.1145\/2976749.2978421"},{"key":"16_CR47","unstructured":"Marlinspike, M.: Private contact discovery for signal (2017)"},{"key":"16_CR48","unstructured":"Matetic, S., et al.: ROTE: rollback protection for trusted execution. In: 26th USENIX Security Symposium (USENIX Security 2017), pp. 1289\u20131306. USENIX Association, Vancouver, BC (2017)"},{"key":"16_CR49","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"key":"16_CR50","doi-asserted-by":"crossref","unstructured":"Parno, B., Lorch, J.R., Douceur, J.R., Mickens, J., McCune, J.M.: Memoir: practical state continuity for protected modules. In: Proceedings of the 2011 IEEE Symposium on Security and Privacy, SP 2011, pp. 379\u2013394. IEEE Computer Society, Washington, DC, USA (2011)","DOI":"10.1109\/SP.2011.38"},{"key":"16_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-56620-7_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Shi, E., Tram\u00e8r, F.: Formal abstractions for attested execution secure processors. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 260\u2013289. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_10"},{"key":"16_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-39200-9_6","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"B Pinkas","year":"2003","unstructured":"Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 87\u2013105. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_6"},{"key":"16_CR53","doi-asserted-by":"crossref","unstructured":"Priebe, C., Vaswani, K., Costa, M.: EnclaveDB: a secure database using SGX. In: EnclaveDB: A Secure Database Using SGX. IEEE (2018)","DOI":"10.1109\/SP.2018.00025"},{"key":"16_CR54","unstructured":"Rane, A., Lin, C., Tiwari, M.: Raccoon: closing digital side-channels through obfuscated execution. In: 24th USENIX Security Symposium (USENIX Security 2015), pp. 431\u2013446. USENIX Association, Washington, D.C. (2015)"},{"key":"16_CR55","doi-asserted-by":"crossref","unstructured":"Schuster, F., et al.: VC3: trustworthy data analytics in the cloud using SGX. In: Proceedings of the IEEE Symposium on Security and Privacy (2015)","DOI":"10.1109\/SP.2015.10"},{"key":"16_CR56","unstructured":"Shamis, A., et al.: CCF: a framework for building confidential verifiable replicated services. Technical report MSR-TR-2019-16, Microsoft (2019)"},{"key":"16_CR57","doi-asserted-by":"crossref","unstructured":"Shih, M.-W., Lee, S., Kim, T., Peinado, M.: T-SGX: eradicating controlled-channel attacks against enclave programs (2017)","DOI":"10.14722\/ndss.2017.23193"},{"key":"16_CR58","doi-asserted-by":"crossref","unstructured":"Shinde, S., Chua, Z.L., Narayanan, V., Saxena, P.: Preventing page faults from telling your secrets. In: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, ASIA CCS 2016, pp. 317\u2013328. ACM, New York, NY, USA (2016)","DOI":"10.1145\/2897845.2897885"},{"key":"16_CR59","unstructured":"Sinha, R., Christodorescu, M.: VeritasDB: high throughput key-value store with integrity. Cryptology ePrint Archive, Report 2018\/251 (2018). https:\/\/eprint.iacr.org\/2018\/251"},{"key":"16_CR60","doi-asserted-by":"crossref","unstructured":"Sinha, R., Rajamani, S., Seshia, S.A.: A compiler and verifier for page access oblivious computation. In: Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, ESEC\/FSE 2017, pp. 649\u2013660. ACM, New York, NY, USA (2017)","DOI":"10.1145\/3106237.3106248"},{"key":"16_CR61","unstructured":"Strackx, R., Piessens, F.: Ariadne: a minimal approach to state continuity. In: 25th USENIX Security Symposium (USENIX Security 2016), pp. 875\u2013892. USENIX Association, Austin, TX (2016)"},{"key":"16_CR62","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 39\u201356. ACM, New York, NY, USA (2017)","DOI":"10.1145\/3133956.3133979"},{"key":"16_CR63","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164. IEEE Computer Society, Washington, DC, USA (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"16_CR64","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, SFCS 1986, pp. 162\u2013167. IEEE Computer Society, Washington, DC, USA (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"16_CR65","doi-asserted-by":"crossref","unstructured":"Zhang, D., Askarov, A., Myers, A.C.: Predictive mitigation of timing channels in interactive systems. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, pp. 563\u2013574. ACM, New York, NY, USA (2011)","DOI":"10.1145\/2046707.2046772"},{"key":"16_CR66","unstructured":"Zheng, W., Dave, A., Beekman, J.G., Popa, R.A., Gonzalez, J.E., Stoica, I.: Opaque: an oblivious and encrypted distributed analytics platform. In: Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation, NSDI 2017, pp. 283\u2013298. USENIX Association, Berkeley, CA (2017)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7563-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T02:18:19Z","timestamp":1730427499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7563-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819975624","9789819975631"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7563-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augusta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"129","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}