{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:43:54Z","timestamp":1743097434546,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031488054"},{"type":"electronic","value":"9783031488061"}],"license":[{"start":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T00:00:00Z","timestamp":1701734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T00:00:00Z","timestamp":1701734400000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-48806-1_25","type":"book-chapter","created":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T17:02:12Z","timestamp":1701709332000},"page":"385-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cassiopeia: Practical On-Chain Witness Encryption"],"prefix":"10.1007","author":[{"given":"Schwinn","family":"Saereesitthipitak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dionysis","family":"Zindros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,5]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Baird, L., Mukherjee, P., Sinha, R.: i-TiRE: incremental timed-release encryption or how to use timed-release encryption on blockchains? Cryptology ePrint Archive, Paper 2021\/800 (2021). https:\/\/eprint.iacr.org\/2021\/800","DOI":"10.1145\/3548606.3560704"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"25_CR3","unstructured":"Benhamouda, F., et al.: Can a public blockchain keep a secret? Cryptology ePrint Archive, Paper 2020\/464 (2020). https:\/\/eprint.iacr.org\/2020\/464"},{"key":"25_CR4","unstructured":"Benhamouda , F., Lin, H.: Multiparty reusable non-interactive secure computation. Cryptology ePrint Archive, Paper 2020\/221 (2020). https:\/\/eprint.iacr.org\/2020\/221"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-36594-2_18","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2013","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Paneth, O., Ostrovsky, R.: Succinct non-interactive arguments via linear interactive proofs. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 315\u2013333. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_18"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"25_CR7","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. Cryptology ePrint Archive, Paper 2010\/543 (2010). https:\/\/eprint.iacr.org\/2010\/543"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-031-22969-5_6","volume-title":"Advances in Cryptology - ASIACRYPT 2022","author":"M Campanelli","year":"2023","unstructured":"Campanelli, M., David, B., Khoshakhlagh, H., Konring, A., Nielsen, J.: Encryption to the future. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13793, pp. 151\u2013180. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_6"},{"key":"25_CR9","unstructured":"Cascudo, I., David, B.: Scrape: scalable randomness attested by public entities. Cryptology ePrint Archive, Paper 2017\/216 (2017). https:\/\/eprint.iacr.org\/2017\/216"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S. Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"25_CR11","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. Association for Computing Machinery New York, NY, USA (2017)","DOI":"10.1145\/3133956.3134092"},{"key":"25_CR12","unstructured":"D\u00f6ttling, N., Hanzlik, L., Magri, B., Wohnig, S.: McFly: verifiable encryption to the future made practical. Cryptology ePrint Archive, Paper 2022\/433 (2022). https:\/\/eprint.iacr.org\/2022\/433"},{"key":"25_CR13","unstructured":"Ende, M.: Momo. Puffin, M\u00fcnchen (2009)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 40\u201349 (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 467\u2013476. Association for Computing Machinery New York, NY, USA (2013)","DOI":"10.1145\/2488608.2488667"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C., Lewko, A.B., Waters, B.: Witness encryption from instance independent assumptions. Cryptology ePrint Archive, Paper 2014\/273 (2014). https:\/\/eprint.iacr.org\/2014\/273","DOI":"10.1007\/978-3-662-44371-2_24"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: How to run turing machines on encrypted data. Cryptology ePrint Archive, Paper 2013\/229 (2013). https:\/\/eprint.iacr.org\/2013\/229","DOI":"10.1007\/978-3-642-40084-1_30"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-030-97121-2_10","volume-title":"Public-Key Cryptography - PKC 2022","author":"V Goyal","year":"2022","unstructured":"Goyal, V., Kothapalli, A., Masserova, E., Parno, B., Song, Y.: Storing and retrieving secrets on a blockchain. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022 Part I. LNCS, vol. 13177, pp. 252\u2013282. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_10"},{"key":"25_CR20","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: a new hash function for zero-knowledge proof systems. In: Proceedings of the 30th USENIX Security Symposium, pp. 519\u2013535. USENIX Association. United States Conference date: 11\u201308-2021 Through 13\u201308-2021 (2021)"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11935230_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J Groth","year":"2006","unstructured":"Groth, J.: Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 444\u2013459. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_29"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Gurkan, K., Jovanovic, P., Maller, M., Meiklejohn, Stern, G., Tomescu, A.: Aggregatable distributed key generation. Cryptology ePrint Archive, Paper 2021\/005 (2021). https:\/\/eprint.iacr.org\/2021\/005","DOI":"10.1007\/978-3-030-77870-5_6"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-04159-4_19","volume-title":"Selected Areas in Cryptography","author":"S Heidarvand","year":"2009","unstructured":"Heidarvand, S., Villar, J.L.: Public verifiability from pairings in secret sharing schemes. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 294\u2013308. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04159-4_19"},{"key":"25_CR24","unstructured":"Labs, P.: tlock: Timelock encryption\/decryption made practical. https:\/\/github.com\/drand\/tlock"},{"issue":"11","key":"25_CR25","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1007\/s10623-018-0461-x","volume":"86","author":"J Liu","year":"2018","unstructured":"Liu, J., Jager, T., Kakvi, S.A., Warinschi, B.: How to build time-lock encryption. Des. Codes Crypt. 86(11), 2549\u20132586 (2018)","journal-title":"Des. Codes Crypt."},{"key":"25_CR26","unstructured":"Mangipudi, E.V., Lu, D., Psomas, A., Kate, A.: Collusion-deterrent threshold information escrow. Cryptology ePrint Archive, Paper 2021\/095 (2021). https:\/\/eprint.iacr.org\/2021\/095"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Mao, W.: Timed-release cryptography. Cryptology ePrint Archive, Paper 2001\/014 (2001). https:\/\/eprint.iacr.org\/2001\/014","DOI":"10.1024\/1012-5302.14.6.423"},{"key":"25_CR28","unstructured":"Mascia, C., Sala, M., Villa, I.: A survey on functional encryption (2021)"},{"key":"25_CR29","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report, USA (1996)"},{"key":"25_CR30","unstructured":"Ruiz, A., Villar, J.L.: Publicly verifiable secret sharing from paillier\u2019s cryptosystem. In: Wulf, C., Lucks, S., Yau, P.-W. (eds.) WEWoRC 2005 - Western European Workshop on Research in Cryptology, pp. 98\u2013108. Gesellschaft f\u00fcr Informatik e.V, Bonn (2005)"},{"key":"25_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"B Schoenmakers","year":"1999","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148\u2013164. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_10"},{"issue":"11","key":"25_CR32","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":"25_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"M Stadler","year":"1996","unstructured":"Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190\u2013199. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_17"},{"key":"25_CR34","unstructured":"Zindros, D.: Hours of horus: keyless cryptocurrency wallets. Cryptology ePrint Archive, Paper 2021\/715 (2021). https:\/\/eprint.iacr.org\/2021\/715"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security. FC 2023 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48806-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T17:06:12Z","timestamp":1701709572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48806-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,5]]},"ISBN":["9783031488054","9783031488061"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48806-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,5]]},"assertion":[{"value":"5 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","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":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","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 (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"182","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":"39","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":"2","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":"21% - 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.5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}