{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:09:32Z","timestamp":1725689372690},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314094"},{"type":"electronic","value":"9783642314100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31410-0_6","type":"book-chapter","created":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T06:26:59Z","timestamp":1340173619000},"page":"82-98","source":"Crossref","is-referenced-by-count":0,"title":["Bounds and Constructions for 1-Round (0,\u03b4)-Secure Message Transmission against Generalized Adversary"],"prefix":"10.1007","author":[{"given":"Reihaneh","family":"Safavi-Naini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Ashraful Alam","family":"Tuhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC 1988)","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computation (extended abstract). In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 1\u201310. ACM, New York (1988)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/62212.62214","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC 1988)","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty Unconditionally Secure Protocols (extended abstract). In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 11\u201319. ACM, New York (1988)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-48285-7_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"M. Carpentieri","year":"1994","unstructured":"Carpentieri, M., De Santis, A., Vaccaro, U.: Size of Shares and Probability of Cheating in Threshold Schemes. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 118\u2013125. Springer, Heidelberg (1994)"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1013856431727","volume":"25","author":"S. Cabello","year":"2002","unstructured":"Cabello, S., Padr\u00f3, C., S\u00e1ez, G.: Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. Des. Codes Cryptography\u00a025(2), 175\u2013188 (2002)","journal-title":"Des. Codes Cryptography"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-21554-4_17","volume-title":"Applied Cryptography and Network Security","author":"A. Choudhury","year":"2011","unstructured":"Choudhury, A., Kurosawa, K., Patra, A.: Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol.\u00a06715, pp. 292\u2013308. Springer, Heidelberg (2011)"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly Secure Message Transmission. Journal of the ACM\u00a040(1), 17\u201347 (1993)","journal-title":"Journal of the ACM"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11602613_29","volume-title":"Algorithms and Computation","author":"Y. Desmedt","year":"2005","unstructured":"Desmedt, Y., Wang, Y., Burmester, M.: A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 277\u2013287. Springer, Heidelberg (2005)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-70936-7_17","volume-title":"Theory of Cryptography","author":"M. Fitzi","year":"2007","unstructured":"Fitzi, M., Franklin, M., Garay, J., Vardhan, S.H.: Towards Optimal and Efficient Perfectly Secure Message Transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 311\u2013322. Springer, Heidelberg (2007)"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M.K. Franklin","year":"2000","unstructured":"Franklin, M.K., Wright, R.N.: Secure Communication in Minimal Connectivity Models. Journal of Cryptology\u00a013(1), 9\u201330 (2000)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player Simulation and General Adversary Structures in Perfect Multiparty Computation. Journal of Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"Journal of Cryptology"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-10230-1_8","volume-title":"Information Theoretic Security","author":"K. Kurosawa","year":"2009","unstructured":"Kurosawa, K., Suzuki, K.: Almost Secure (1-Round, n-Channel) Message Transmission Scheme. In: Desmedt, Y. (ed.) ICITS 2007. LNCS, vol.\u00a04883, pp. 99\u2013112. Springer, Heidelberg (2009)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11935230_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"S. Obana","year":"2006","unstructured":"Obana, S., Araki, T.: Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 364\u2013379. Springer, Heidelberg (2006)"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/S0895480100378689","volume":"20","author":"W. Ogata","year":"2006","unstructured":"Ogata, W., Kurosawa, K., Stinson, D.R.: Optimum Secret Sharing Scheme Secure against Cheating. SIAM J. Discrete Math.\u00a020(1), 79\u201395 (2006)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(98)00149-5","volume":"68","author":"C. Padro","year":"1998","unstructured":"Padro, C.: Robust Vector Space Secret Sharing Schemes. Inf. Process. Lett.\u00a068(3), 107\u2013111 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1504\/IJACT.2010.038309","volume":"2","author":"A. Patra","year":"2010","unstructured":"Patra, A., Choudhary, A., Srinathan, K., Rangan, C.P.: Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. Int. J. Appl. Cryptol.\u00a02(2), 159\u2013197 (2010)","journal-title":"Int. J. Appl. Cryptol."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1023\/A:1008378426278","volume":"16","author":"C. Padr\u00f3","year":"1999","unstructured":"Padr\u00f3, C., S\u00e1ez, G., Villar, J.: Detection of Cheaters in Vector Space Secret Sharing Schemes. Des. Codes Cryptography\u00a016(1), 75\u201385 (1999)","journal-title":"Des. Codes Cryptography"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/73007.73014","volume-title":"Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (STOC 1989)","author":"T. Rabin","year":"1989","unstructured":"Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (extended abstract). In: Johnson, D.S. (ed.) Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (STOC 1989), pp. 73\u201385. ACM, New York (1989)"},{"issue":"2","key":"6_CR18","first-page":"133","volume":"1","author":"M. Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How to Share a Secret with Cheaters. Journal of Cryptology\u00a01(2), 133\u2013138 (1988)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/974121.974124","volume":"33","author":"Y. Wang","year":"2004","unstructured":"Wang, Y.: Robust Key Establishment in Sensor Networks. SIGMOD Record\u00a033(1), 14\u201319 (2004)","journal-title":"SIGMOD Record"},{"key":"6_CR20","unstructured":"Wu, J., Stinson, D.R.: Three Improved Algorithms for Multi-path Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission, \n                    \n                      http:\/\/eprint.iacr.org\/2009\/413.pdf"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31410-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:59:32Z","timestamp":1620129572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31410-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314094","9783642314100"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31410-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}