Literatura académica sobre el tema "MULTI SECRET SHARING SCHEME"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "MULTI SECRET SHARING SCHEME".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "MULTI SECRET SHARING SCHEME"
Endurthi, Anjaneyulu, Oinam B. Chanu, Appala N. Tentu y V. Ch Venkaiah. "Reusable Multi-Stage Multi-Secret Sharing Schemes Based on CRT". Journal of Communications Software and Systems 11, n.º 1 (23 de marzo de 2015): 15. http://dx.doi.org/10.24138/jcomss.v11i1.113.
Texto completoZHANG, EN y YONGQUAN CAI. "RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS". International Journal of Foundations of Computer Science 24, n.º 06 (septiembre de 2013): 879–97. http://dx.doi.org/10.1142/s012905411350024x.
Texto completoCai, Hongliang y Dan Tang. "Multi Secret Image Sharing Scheme of General Access Structure with Meaningful Shares". Mathematics 8, n.º 9 (14 de septiembre de 2020): 1582. http://dx.doi.org/10.3390/math8091582.
Texto completoJuan, Justie Su-Tzu, Jen-Yu Lin, Bo-Yuan Huang y Yu-Chun Chung. "Advanced fault-tolerant visual multi-secret sharing scheme". Journal of Surveillance, Security and Safety 3 (2022): 41–54. http://dx.doi.org/10.20517/jsss.2021.29.
Texto completoLuo, Shuangshuang, Zhihui Li, Depeng Meng y Jiansheng Guo. "Efficient quantum secret sharing scheme based on monotone span program". Laser Physics 33, n.º 8 (22 de junio de 2023): 085201. http://dx.doi.org/10.1088/1555-6611/acd630.
Texto completoXu, Guoai, Jiangtao Yuan, Guosheng Xu y Xingxing Jia. "A New Multi-stage Secret Sharing Scheme for Hierarchical Access Structure with Existential Quantifier". Information Technology and Control 50, n.º 2 (17 de junio de 2021): 236–46. http://dx.doi.org/10.5755/j01.itc.50.2.27789.
Texto completoChen, Chien-Chang, Cheng-Shian Lin y Jia-Zhan Chen. "Boolean-Based (k, n, m) Multi-Secret Image Sharing". Axioms 11, n.º 5 (23 de abril de 2022): 197. http://dx.doi.org/10.3390/axioms11050197.
Texto completoCsirmaz, Laszlo. "Secret sharing and duality". Journal of Mathematical Cryptology 15, n.º 1 (25 de noviembre de 2020): 157–73. http://dx.doi.org/10.1515/jmc-2019-0045.
Texto completoChang, Joy, Bo-Yuan Huang y Justie Juan. "A New Visual Multi-Secrets Sharing Scheme by Random Grids". Cryptography 2, n.º 3 (17 de septiembre de 2018): 24. http://dx.doi.org/10.3390/cryptography2030024.
Texto completoHwang, Ren-Junn y Chin-Chen Chang. "An on-line secret sharing scheme for multi-secrets". Computer Communications 21, n.º 13 (septiembre de 1998): 1170–76. http://dx.doi.org/10.1016/s0140-3664(98)00191-1.
Texto completoTesis sobre el tema "MULTI SECRET SHARING SCHEME"
Miceli, Christopher. "One Time Password Scheme Via Secret Sharing Techniques". ScholarWorks@UNO, 2011. http://scholarworks.uno.edu/td/1330.
Texto completoTurban, Tiina. "A Secure Multi-Party Computation Protocol Suite Inspired by Shamir's Secret Sharing Scheme". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2014. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-25874.
Texto completoFokin, Dennis. "A secure multi-party scheme with certificateless cryptography for secret key extraction". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231574.
Texto completoMånga system innehåller känslig data, exempelvis användaruppgifter som används för autentiseringsändamål. För stora system är en vanlig lösning att lagra data i en konfigurationsfil hos en betrodd tredje part. Det skulle emellertid innebära att den svagaste länken är om motståndare får tillgång till den betrodda parten. I teorin kan detta lösas genom att kryptera data men i praktiken flyttar det bara på problemet men löser det inte, eftersom någon typ av autentiseringsdata behövs för att dekryptera konfigurationsfilen. En mer flexibel lösning behövs som kräver mindre mänsklig interaktion samtidigt som det ger en högre grad av säkerhet. Denna avhandling föreslår ett komplett kryptografiskt system för att lösa detta problem i en typisk företagsmiljö med en ytterligare uppsättning implementationskrav genom att använda multipartsberäknande och Shamirs secret sharing protokoll. Dessutom kombinerar arbetet det nämnda systemet med ett certifikatfritt krypteringsbaserat protokoll kombinerat med multipartsberäkningar, eftersom certifikat oftast innebär en tidskrävande process. Systemet har utvärderats med avseende på säkerhet och effektivitet med slutsatsen att det ser lovande ut. När det gäller prestanda kommer huvuddelen av omkostnaden från den certifikatfria kryptografin, en begränsning för det specifika scenariot som kanske inte är närvarande i allmänhet. Arbetet ger också motiv för att vidareutveckla Java-bibliotek för kryptografi, speciellt för multipartsberäknande protokoll och certifikatlös kryptering.
Potay, Sunny. "Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography". TopSCHOLAR®, 2012. http://digitalcommons.wku.edu/theses/1151.
Texto completoLai, Chun-Pong. "Several variants and generalizations of Shamir's secret sharing scheme /". View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20LAI.
Texto completoIncludes bibliographical references (leaves 55-58). Also available in electronic version. Access restricted to campus users.
Framner, Erik. "A Configuration User Interface for Multi-Cloud Storage Based on Secret Sharing : An Exploratory Design Study". Thesis, Karlstads universitet, Handelshögskolan (from 2013), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-71354.
Texto completoPRISMACLOUD
Kaskaloglu, Kerem. "Some Generalized Multipartite Access Structures". Phd thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/2/12611965/index.pdf.
Texto completoAl-Adhami, Ayad. "A secure quorum based multi-tag RFID system". Thesis, University of Plymouth, 2018. http://hdl.handle.net/10026.1/12821.
Texto completoPrakash, Aravind. "Confidential Data Dispersion using Thresholding". Scholarly Repository, 2009. http://scholarlyrepository.miami.edu/oa_theses/232.
Texto completoSmith, Guillaume. "Concevoir des applications temps-réel respectant la vie privée en exploitant les liens entre codes à effacements et les mécanismes de partages de secrets". Thesis, Toulouse, ISAE, 2014. http://www.theses.fr/2014ESAE0045/document.
Texto completoData from both individuals and companies is increasingly aggregated and analysed to provide new and improved services. There is a corresponding research effort to enable processing of such data in a secure and privacy preserving way, in line with the increasing public concerns and more stringent regulatory requirements for the protection of such data. Secure Multi-Party Computation (MPC) and secret sharing are mechanisms that can enable both secure distribution and computations on private data. In this thesis, we address the inefficiencies of these mechanisms by utilising results from a theoretically related rich area, erasure codes. We derive links between erasure codes and secret sharing, and use Maximum Distance Separable (MDS) codes as a basis to provide real-time applications relying on private user's data, revealing this data only to the selected group (which can be empty). The thesis has three contributions. A new class of erasure code called on-the-fly coding, have been introduced for their improvements in terms of recovery delay and achievable capacity. However little is known about the complexity of the systematic and non-systematic variants of this code, notably for live multicast transmission of multimedia content which is their ideal use case. The evaluation of both variants demonstrate that the systematic code outperforms the non-systematic one in regard to both the buffer sizes and the computation complexity. Then, we propose a new Layered secret sharing scheme and its application to Online Social Network (OSN). In current OSN, access to the user's profile information is managed by the service provider based on a limited set of rules. The proposed scheme enables automated profile sharing in OSN's groups with fine grained privacy control, via a multi-secret sharing scheme comprising of layered shares, without relying on a trusted third party. We evaluate the security of the scheme and the resulting profile's level of protection in an OSN scenario. Finally, after showing that erasure codes are efficient for real-time applications and that the security offered by secret sharing schemes can be applied to real-case applications, we derive the theoretical links between MDS codes and secret sharing to enable the implementation of efficient secret sharing scheme built from MDS codes. To illustrate this efficiency, we implement two of these schemes and evaluate their benefits in regard to computation and communication costs in an MPC application
Libros sobre el tema "MULTI SECRET SHARING SCHEME"
Curr, Leon Olsson, Pearlwort Snead y Arri Isak Beck. Codex 32: A Shamir Secret Sharing Scheme. Bickers & Son, 2022.
Buscar texto completoCapítulos de libros sobre el tema "MULTI SECRET SHARING SCHEME"
Cai, Yongquan, Zhanhai Luo y Yi Yang. "Verifiable Rational Multi-secret Sharing Scheme". En Communications in Computer and Information Science, 42–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-27452-7_6.
Texto completoBlundo, Carlo, Alfredo De Santis, Giovanni Di Crescenzo, Antonio Giorgio Gaggia y Ugo Vaccaro. "Multi-Secret Sharing Schemes". En Advances in Cryptology — CRYPTO ’94, 150–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-48658-5_17.
Texto completoBu, Shanyue y Ronggeng Yang. "Novel and Effective Multi-Secret Sharing Scheme". En Lecture Notes in Electrical Engineering, 461–67. London: Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-4853-1_58.
Texto completoBeimel, Amos, Aner Ben-Efraim, Carles Padró y Ilya Tyomkin. "Multi-linear Secret-Sharing Schemes". En Theory of Cryptography, 394–418. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54242-8_17.
Texto completoDeshmukh, Maroti, Neeta Nain y Mushtaq Ahmed. "Enhanced Modulo Based Multi Secret Image Sharing Scheme". En Information Systems Security, 212–24. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49806-5_11.
Texto completoSiva Reddy, L. y Munaga V. N. K. Prasad. "Extended Visual Cryptography Scheme for Multi-secret Sharing". En Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics, 249–57. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2529-4_26.
Texto completoKandar, Shyamalendu y Bibhas Chandra Dhara. "A (t, n) Multi-secret Sharing Scheme with Updated Secret Shadows". En Proceedings of the International Conference on Computing and Communication Systems, 621–29. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-6890-4_60.
Texto completoTentu, Appala Naidu, Abdul Basit, K. Bhavani y V. Ch Venkaiah. "Multi-secret Sharing Scheme for Level-Ordered Access Structures". En Number-Theoretic Methods in Cryptology, 267–78. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-76620-1_16.
Texto completoTentu, Appala Naidu y Allam Appa Rao. "Efficient Verifiable Multi-Secret Sharing Based on Y.C.H Scheme". En Communications in Computer and Information Science, 100–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44893-9_9.
Texto completoLi, HuiXian, ChunTian Cheng y LiaoJun Pang. "A New (t, n)-Threshold Multi-secret Sharing Scheme". En Computational Intelligence and Security, 421–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11596981_61.
Texto completoActas de conferencias sobre el tema "MULTI SECRET SHARING SCHEME"
Lin, Changlu y Lein Harn. "Unconditionally secure multi-secret sharing scheme". En 2012 IEEE International Conference on Computer Science and Automation Engineering (CSAE). IEEE, 2012. http://dx.doi.org/10.1109/csae.2012.6272572.
Texto completoRunhua, Shi, Huang Liusheng, Luo yonglong y Zhong Hong. "A Threshold Multi-secret Sharing Scheme". En 2008 IEEE International Conference on Networking, Sensing and Control (ICNSC). IEEE, 2008. http://dx.doi.org/10.1109/icnsc.2008.4525497.
Texto completoShi Runhua y Zhong Hong. "A hierarchical threshold multi-secret sharing scheme". En 2008 2nd International Conference on Anti-counterfeiting, Security and Identification. IEEE, 2008. http://dx.doi.org/10.1109/iwasid.2008.4688398.
Texto completoLiaojun, Pang, Li Huixian, Jiao Licheng y Wang Yumin. "A Verifiable Multi-secret Sharing Scheme (VMSS)". En 2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007). IEEE, 2007. http://dx.doi.org/10.1109/cisw.2007.4425603.
Texto completoYu, Bin, Xiaohui Xu y Liguo Fang. "Multi-secret Sharing Threshold Visual Cryptography Scheme". En 2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007). IEEE, 2007. http://dx.doi.org/10.1109/cisw.2007.4425620.
Texto completoJuan Qu, Limin Zou y Jianzhong Zhang. "A practical dynamic multi-secret sharing scheme". En 2010 IEEE International Conference on Information Theory and Information Security (ICITIS). IEEE, 2010. http://dx.doi.org/10.1109/icitis.2010.5689507.
Texto completoYong-Jun, Geng, Fan Xiao-Hong y Hong Fan. "A New Multi-secret Sharing Scheme with Multi-policy". En The 9th International Conference on Advanced Communication Technology. IEEE, 2007. http://dx.doi.org/10.1109/icact.2007.358655.
Texto completoYang, Ming. "An Unconditionally Secure Multi-round Revocation Scheme Using Secret Sharing". En TENCON 2005 - 2005 IEEE Region 10 Conference. IEEE, 2005. http://dx.doi.org/10.1109/tencon.2005.301003.
Texto completoDeryabin, Maxim, Nikolay Chervyakov, Andrei Tchernykh, Mikhail Babenko, Nikolay Kucherov, Vanessa Miranda-Lopez y Arutyun Avetisyan. "Secure Verifiable Secret Short Sharing Scheme for Multi-Cloud Storage". En 2018 International Conference on High Performance Computing & Simulation (HPCS). IEEE, 2018. http://dx.doi.org/10.1109/hpcs.2018.00114.
Texto completoYu, Bin, Zhengxin Fu y Liguo Fang. "A Modified Multi-Secret Sharing Visual Cryptography Scheme". En 2008 International Conference on Computational Intelligence and Security (CIS). IEEE, 2008. http://dx.doi.org/10.1109/cis.2008.120.
Texto completo