{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:09:54Z","timestamp":1758272994200,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312830"},{"type":"electronic","value":"9783642312847"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31284-7_21","type":"book-chapter","created":{"date-parts":[[2012,6,13]],"date-time":"2012-06-13T10:15:58Z","timestamp":1339582558000},"page":"344-362","source":"Crossref","is-referenced-by-count":4,"title":["A General Construction for 1-Round \u03b4-RMT and (0, \u03b4)-SMT"],"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"}]},{"given":"Pengwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computation (extended abstract). In: Proc. of STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crepeau, C., Damgard, I.: Multiparty Unconditionally Secure Protocols (Extended Abstract). In: Proc. of FOCS, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"issue":"1","key":"21_CR3","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":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-12678-9_11","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2010","author":"Y. Desmedt","year":"2010","unstructured":"Desmedt, Y., Erotokritou, S., Safavi-Naini, R.: Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol.\u00a06055, pp. 166\u2013183. Springer, Heidelberg (2010)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Frankle, Y., Yung, M.: Multi-receiver\/Multi-sender network security: efficient authenticated multicast\/feedback. In: IEEE Infocom, pp. 2045\u20132054 (1992)","DOI":"10.1109\/INFCOM.1992.263476"},{"key":"21_CR6","unstructured":"Elias, P.: List Decoding for Noisy Channels. Technical Report 335, MIT Research Lab of Electronics (1957)"},{"key":"21_CR7","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":"21_CR8","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"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Guruswami, V.: Linear-algebraic List Decoding of Folded Reed-Solomon Codes. CoRR abs\/1106.0436 (2011)","DOI":"10.1109\/CCC.2011.22"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Rudra, A.: Explicit Codes Achieving List Decoding Capability: Error-Correction With Optimal Redundancy. IEEE Transactions on Information Theory\u00a054(1) (2008)","DOI":"10.1109\/TIT.2007.911222"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Sudan, M.: Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. In: FOCS, pp. 28\u201339 (1998)","DOI":"10.1109\/SFCS.1998.743426"},{"key":"21_CR12","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)"},{"issue":"2","key":"21_CR13","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.: Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. IJACT\u00a02(2), 159\u2013197 (2010)","journal-title":"IJACT"},{"key":"21_CR14","unstructured":"Srinathan, K.: Secure Distributed Communication. PhD Thesis, IIT Madras (2006)"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"Sudan, M.: Decoding of Reed Solomon Codes beyond the Error-Correction Bound. J. Complexity\u00a013(1), 180\u2013193 (1997)","journal-title":"J. Complexity"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-77026-8_9","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"K. Srinathan","year":"2007","unstructured":"Srinathan, K., Patra, A., Choudhary, A., Rangan, C.P.: Probabilistic Perfectly Reliable and Secure Message Transmission \u2013 Possibility, Feasibility and Optimality. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 101\u2013122. Springer, Heidelberg (2007)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Srinathann, K., Choudhary, A., Patra, A., Rangann, C.: Efficient Single Phase Unconditionally Secure Message Transmission with Optimum Communication Complexity. In: PODC, p. 457 (2008)","DOI":"10.1145\/1400751.1400855"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/978-3-540-28628-8_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K. Srinathan","year":"2004","unstructured":"Srinathan, K., Narayanan, A., Pandu Rangan, C.: Optimal Perfectly Secure Message Transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 545\u2013561. Springer, Heidelberg (2004)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Safavi-Naini, R., Tuhin, M.A.A., Shi, H.: Optimal Message Transmission Protocols with Flexible Parameters. In: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011), pp. 453\u2013458 (2011)","DOI":"10.1145\/1966913.1966978"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Safavi-Naini, R., Tuhin, M.A.A., Wang, P.: A General Construction for 1-round \u03b4-RMT and (0, \u03b4)-SMT. Cryptology ePrint Archive (2012)","DOI":"10.1007\/978-3-642-31284-7_21"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-27576-0_14","volume-title":"Financial Cryptography and Data Security","author":"M.A.A. Tuhin","year":"2012","unstructured":"Tuhin, M.A.A., Safavi-Naini, R.: Optimal One Round Almost Perfectly Secure Message Transmission (Short Paper). In: Danezis, G. (ed.) FC 2011. LNCS, vol.\u00a07035, pp. 173\u2013181. Springer, Heidelberg (2012)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Wu, J., Stinson, D.R.: Three Improved Algorithms for Multi-path Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission. In: IEEE Transactions on Dependable and Secure Computing, pp. 929\u2013937 (2011)","DOI":"10.1109\/TDSC.2010.48"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31284-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T04:47:59Z","timestamp":1743396479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31284-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312830","9783642312847"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31284-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}