Relevant bibliographies by topics / SECRET SHARING SYSTEM

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'SECRET SHARING SYSTEM'

Author: Grafiati
Published: 11 September 2023
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'SECRET SHARING SYSTEM.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "SECRET SHARING SYSTEM"

1

Ebrahimi, Kiasari Mohammad Ebrahim, Abdolrasool Mirghadri, Nasrollah Pakniat, and Mojtaba Nazari. "Multivariate Predictive Interpolation Using Lagrange Interpolation and the Chinese Remainder Theorem." New Researches in Mathematics 6, no. 28 (2019): 145–56. https://doi.org/10.5281/zenodo.14034585.

Full text
Abstract:
In a multivariate predictive secret sharing scheme, one or more secrets are shared among a set of participants in such a way that 1) the shares can be renewed at specified time intervals without the help of the dealer, and 2) while specific subsets of participants, known as authorized subsets, are able to reconstruct the secret(s), other subsets cannot gain any information about the secret(s). The only existing multivariate predictive secret sharing scheme can be viewed as a combination of a single secret sharing scheme and multiple uses of a one-time pad encryption system. This scheme has wea
APA, Harvard, Vancouver, ISO, and other styles
2

Errahmani, Hichem Bouchakour, and Hind Ikni. "A New Approach to Verifying and Sharing a Secret QR Code using Elliptic Curves." Malaysian Journal of Computing and Applied Mathematics 3, no. 1 (2020): 55–65. http://dx.doi.org/10.37231/myjcam.2020.3.1.44.

Full text
Abstract:
One of the modern applications of cryptography is the sharing of secrets in occurrence keys. Indeed, the need to establish a shared secret key in a multi-user system clearly remains a major problem of trust between users. Therefore, one solution is to share this secret key between users seamlessly. New technologies embedded systems such as sensor networks provide an ideal platform for sharing secrets. In addition, elliptic curves offer an adequate solution for reducing the size of keys, which is suitable for embedded systems. In this article, we propose an approach for sharing a secret leaked
APA, Harvard, Vancouver, ISO, and other styles
3

Choudhary, Shipra PraveenKumar, Apeksha Katarni, Shweta Manjrekar, Mrs Vidyullata Devmane, and Mrs Vaishali Hirlekar. "Secret Sharing Approach in Multi-database System." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 15, no. 6 (2016): 6819–23. http://dx.doi.org/10.24297/ijct.v15i6.1606.

Full text
Abstract:
Secret sharing schemes are ideal for storing highly sensitive data. A secret is divided into many parts and every participant gets his unique part. If we combine all of these parts and try regenerating the secret then it might be impractical, and therefore the threshold scheme is used. Shamir’s secret sharing scheme supports the same. Here, some of the parts or all of them are required to reconstruct the secret. Any threshold number of parts are sufficient to reconstruct the original secret. The Admin has a set of files which are confidentiality and availability of data. Whenever a Client r
APA, Harvard, Vancouver, ISO, and other styles
4

Alahmadi, Adel, Alaa Altassan, Ahmad AlKenani, Selda Çalkavur, Hatoon Shoaib, and Patrick Solé. "A Multisecret-Sharing Scheme Based on LCD Codes." Mathematics 8, no. 2 (2020): 272. http://dx.doi.org/10.3390/math8020272.

Full text
Abstract:
Secret sharing is one of the most important cryptographic protocols. Secret sharing schemes (SSS) have been created to that end. This protocol requires a dealer and several participants. The dealer divides the secret into several pieces ( the shares), and one share is given to each participant. The secret can be recovered once a subset of the participants (a coalition) shares their information. In this paper, we present a new multisecret-sharing scheme inspired by Blakley’s method based on hyperplanes intersection but adapted to a coding theoretic situation. Unique recovery requires the use of
APA, Harvard, Vancouver, ISO, and other styles
5

Hashim, Ashwaq T., and Suhad A. Ali. "Reversible Multiple Image Secret Sharing Using Discrete Haar Wavelet Transform." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 6 (2018): 5004. http://dx.doi.org/10.11591/ijece.v8i6.pp5004-5013.

Full text
Abstract:
<p>Multiple Secret Image Sharing scheme is a protected approach to transmit more than one secret image over a communication channel. Conventionally, only single secret image is shared over a channel at a time. But as technology grew up, there is a need to share more than one secret image. A fast (r, n) multiple secret image sharing scheme based on discrete haar wavelet transform has been proposed to encrypt m secret images into n noisy images that are stored over different servers. To recover m secret images r noise images are required. Haar Discrete Wavelet Transform (DWT) is employed a
APA, Harvard, Vancouver, ISO, and other styles
6

S.Patil, Rupali, Sonali Patil, and Sudeep D. Thepade. "Secret Sharing based Secure Authentication System." International Journal of Computer Applications 118, no. 22 (2015): 8–11. http://dx.doi.org/10.5120/20875-3613.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Miyamoto, Toshiyuki, Shinji Doi, Hiroki Nogawa, and Sadatoshi Kumagai. "Autonomous distributed secret sharing storage system." Systems and Computers in Japan 37, no. 6 (2006): 55–63. http://dx.doi.org/10.1002/scj.20388.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lai, Chun-Pong, and Cunsheng Ding. "Several Generalizations of Shamir's Secret Sharing Scheme." International Journal of Foundations of Computer Science 15, no. 02 (2004): 445–58. http://dx.doi.org/10.1142/s0129054104002510.

Full text
Abstract:
A secret sharing scheme is a system designed to share a piece of information or the secret among a group of people such that only authorized people can reconstruct the secret from their shares. Since Blakley and Shamir proposed threshold secret sharing schemes in 1979 independently, many secret sharing schemes have been constructed. In this paper, we present several threshold schemes that are generalizations of Shamir's secret sharing scheme.
APA, Harvard, Vancouver, ISO, and other styles
9

Xu, Guoai, Jiangtao Yuan, Guosheng Xu, and Xingxing Jia. "A New Multi-stage Secret Sharing Scheme for Hierarchical Access Structure with Existential Quantifier." Information Technology and Control 50, no. 2 (2021): 236–46. http://dx.doi.org/10.5755/j01.itc.50.2.27789.

Full text
Abstract:
Multi-stage secret sharing scheme is practical in the case that there is a security system with m ordered checkpoints.It is natural to divide the m checkpoints into m different levels. There are m different secrets, and eachof them with a different importance corresponds to a checkpoint/level. The participants are also divided intom disjoint levels as they do in the hierarchical threshold access structure. Hierarchical threshold access structurewith the existential quantifier ( HTAS∃ ) does not cover the common practice that at least a few numbersof high-ranking participants are required to be
APA, Harvard, Vancouver, ISO, and other styles
10

Errahmani, Hichem Bouchakour, and Hind Ikni. "Verifiable Self-Selecting Secret Sharing Based on Elliptic Curves." International Journal of Software Innovation 8, no. 3 (2020): 51–68. http://dx.doi.org/10.4018/ijsi.2020070104.

Full text
Abstract:
In distributed systems, as any network architecture, cryptography has a vital role in communication security, and sharing a secret represents a jump in this field where the secret depends on a group instead of a single person. In this article, the authors propose a method to share a multi secrets matrix represented by an image, that could be reconstructed without any loss by an access structure over a distributed system. The presented approach has a verifiable property, where each candidate possesses the advantage to verify the validity of his shadow. The security level of the scheme is based
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "SECRET SHARING SYSTEM"

1

Olsson, Fredrik. "A Lab System for Secret Sharing." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2385.

Full text
Abstract:
<p>Finnegan Lab System is a graphical computer program for learning how secret sharing works. With its focus on the algorithms and the data streams, the user does not have to consider machine-specific low-level details. It is highly modularised and is not restricted to secret sharing, but can easily be extended with new functions, such as building blocks for Feistel networks or signal processing. </p><p>This thesis describes what secret sharing is, the development of a new lab system designed for secret sharing and how it can be used.</p>
APA, Harvard, Vancouver, ISO, and other styles
2

Al-Adhami, Ayad. "A secure quorum based multi-tag RFID system." Thesis, University of Plymouth, 2018. http://hdl.handle.net/10026.1/12821.

Full text
Abstract:
Radio Frequency Identification (RFID) technology has been expanded to be used in different fields that need automatic identifying and verifying of tagged objects without human intervention. RFID technology offers a great advantage in comparison with barcodes by providing accurate information, ease of use and reducing of labour cost. These advantages have been utilised by using passive RFID tags. Although RFID technology can enhance the efficiency of different RFID applications systems, researchers have reported issues regarding the use of RFID technology. These issues are making the technology
APA, Harvard, Vancouver, ISO, and other styles
3

Goh, Vik Tor. "Intrusion detection framework for encrypted networks." Thesis, Queensland University of Technology, 2010. https://eprints.qut.edu.au/41733/1/Vik_Tor_Goh_Thesis.pdf.

Full text
Abstract:
Network-based Intrusion Detection Systems (NIDSs) monitor network traffic for signs of malicious activities that have the potential to disrupt entire network infrastructures and services. NIDS can only operate when the network traffic is available and can be extracted for analysis. However, with the growing use of encrypted networks such as Virtual Private Networks (VPNs) that encrypt and conceal network traffic, a traditional NIDS can no longer access network traffic for analysis. The goal of this research is to address this problem by proposing a detection framework that allows a commercial
APA, Harvard, Vancouver, ISO, and other styles
4

Reistad, Tord Ingolf. "A General Framework for Multiparty Computations." Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-16567.

Full text
Abstract:
Multiparty computation is a computation between multiple players which want to compute a common function based on private input. It was first proposed over 20 years ago and has since matured into a well established science. The goal of this thesis has been to develop efficient protocols for different operations used in multiparty computation and to propose uses for multiparty computation in real world systems. This thesis therefore gives the reader an overview of multiparty computation from the simplest primitives to the current state of software frameworks for multiparty computation, and prov
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Zhaohong. "Information-Theoretic Secure Outsourced Computation in Distributed Systems." UKnowledge, 2016. http://uknowledge.uky.edu/ece_etds/88.

Full text
Abstract:
Secure multi-party computation (secure MPC) has been established as the de facto paradigm for protecting privacy in distributed computation. One of the earliest secure MPC primitives is the Shamir's secret sharing (SSS) scheme. SSS has many advantages over other popular secure MPC primitives like garbled circuits (GC) -- it provides information-theoretic security guarantee, requires no complex long-integer operations, and often leads to more efficient protocols. Nonetheless, SSS receives less attention in the signal processing community because SSS requires a larger number of honest participan
APA, Harvard, Vancouver, ISO, and other styles
6

Traverso, Giulia [Verfasser], Johannes [Akademischer Betreuer] Buchmann, and Reihaneh [Akademischer Betreuer] Safavi-Naini. "Long-Term Confidential Secret Sharing-Based Distributed Storage Systems / Giulia Traverso ; Johannes Buchmann, Reihaneh Safavi-Naini." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2019. http://d-nb.info/1188410377/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Leung, Philip, and Daniel Svensson. "SecuRES: Secure Resource Sharing System : AN INVESTIGATION INTO USE OF PUBLIC LEDGER TECHNOLOGY TO CREATE DECENTRALIZED DIGITAL RESOURCE-SHARING SYSTEMS." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-187348.

Full text
Abstract:
The project aims at solving the problem of non-repudiation, integrity and confidentiality of data when digitally exchanging sensitive resources between parties that need to be able to trust each other without the need for a trusted third party. This is done in the framework of answering to what extent digital resources can be shared securely in a decentralized public ledger-based system compared to trust-based alternatives. A background of existing resource sharing solutions is explored which shows an abundance third party trust-based systems, but also an interest in public ledger solutions in
APA, Harvard, Vancouver, ISO, and other styles
8

Subbiah, Arun. "Efficient Proactive Security for Sensitive Data Storage." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19719.

Full text
Abstract:
Fault tolerant and secure distributed data storage systems typically require that only up to a threshold of storage nodes can ever be compromised or fail. In proactively-secure systems, this requirement is modified to hold only in a time interval (also called epoch), resulting in increased security. An attacker or adversary could compromise distinct sets of nodes in any two time intervals. This attack model is also called the mobile adversary model. Proactively-secure systems require all nodes to "refresh" themselves periodically to a clean state to maintain the availability, integrity, and co
APA, Harvard, Vancouver, ISO, and other styles
9

Timilsina, Santosh. "Physical Layer Security in Training-Based Single-Hop/Dual-Hop Massive MIMO Systems." OpenSIUC, 2018. https://opensiuc.lib.siu.edu/theses/2376.

Full text
Abstract:
The broadcast nature of wireless medium has made information security as one of the most important and critical issues in wireless systems. Physical layer security, which is based on information-theoretic secrecy concepts, can be used to secure the wireless channels by exploiting the noisiness and imperfections of the channels. Massive multiple-input multiple-output (MIMO) systems, which are equipped with very large antenna arrays at the base stations, have a great potential to boost the physical layer security by generating the artificial noise (AN) with the exploitation of excess degrees-of-
APA, Harvard, Vancouver, ISO, and other styles
10

Хіцко, Яна Володимирівна. "Математичне моделювання задач криптографії та обробки сигналів з використанням неканонічних гіперкомплексних числових систем". Thesis, НТУУ "КПІ", 2016. https://ela.kpi.ua/handle/123456789/15092.

Full text
Abstract:
Дисертація присвячена математичному моделюванню задач криптографії та обробки сигналів з використанням неканонічних гіперкомплексних числових систем, застосування яких зменшує кількість обчислень при функціонуванні таких моделей та дозволяє оптимізувати їх за окремими характеристиками. Результати моделювання задачі розділення секрету показали, що застосування неканонічних гіперкомплексних числових систем, починаючи з вимірності 4, зменшує кількість потрібних обчислень у порівнянні із застосуванням канонічних гіперкомплексних числових систем. Розроблено методи побудови структур неканонічних г
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "SECRET SHARING SYSTEM"

1

Cimato, Stelvio, and Ching-Nung Yang. Visual Cryptography and Secret Image Sharing. Taylor & Francis Group, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cimato, Stelvio, and Ching-Nung Yang. Visual Cryptography and Secret Image Sharing. Taylor & Francis Group, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cimato, Stelvio, and Ching-Nung Yang. Visual Cryptography and Secret Image Sharing. Taylor & Francis Group, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cimato, Stelvio, and Ching-Nung Yang. Visual Cryptography and Secret Image Sharing. Taylor & Francis Group, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cimato, Stelvio, and Ching-Nung Yang. Visual Cryptography and Secret Image Sharing. Taylor & Francis Group, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cimato, Stelvio, and Ching-Nung Yang. Visual Cryptography and Secret Image Sharing. Taylor & Francis Group, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Visual cryptography and secret image sharing. Taylor & Francis, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Laderman, Charlie. Sharing the Burden. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780190618605.001.0001.

Full text
Abstract:
The destruction of the Armenian community in the Ottoman Empire was an unprecedented tragedy. Theodore Roosevelt was adamant that it was the “greatest crime” of the First World War. The mass killing of approximately one million Armenian Christians was the culmination of a series of massacres that Winston Churchill would recall had roused publics on both sides of the Atlantic and inspired fervent appeals to see the Armenians “righted.” This book explains why the Armenian struggle for survival became so entangled with the debate over the United States’ international role as it rose to world powe
APA, Harvard, Vancouver, ISO, and other styles
9

Davis, Coralynn V. Talking Tools, Femina narrans, and the Irrepressibility of Women. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252038426.003.0008.

Full text
Abstract:
This concluding chapter looks at what happens in Maithil women's folktales when stories of women's suffering at the hands of other women are first suppressed and later overheard by men who have the power to alleviate such suffering. Maithil women are structurally pitted against one another in their pursuit of security and resources in the context of patriarchal, patrilineal, and patrilocal formations. It is these oppositions that account for the storied abuse meted out by co-wives, mothers-in-law, and the mistresses of servants. However, the solidarities women nonetheless form—in part through
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "SECRET SHARING SYSTEM"

1

Hedabou, Mustapha. "Cloud Key Management Based on Verifiable Secret Sharing." In Network and System Security. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92708-0_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Yan-Xiao, and Ching-Nung Yang. "Enhanced Secret Image Sharing Using POB Number System." In Security with Intelligent Computing and Big-data Services. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16946-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chaudhury, Shion Samadder, Sabyasachi Dutta, and Kouichi Sakurai. "$$AC^0$$ Constructions of Secret Sharing Schemes – Accommodating New Parties." In Network and System Security. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65745-1_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nallabothu, Shivakrishna, N. Rukmarekha, and Y. V. Subbarao. "Generalized Secret Sharing Scheme Based on MDS Codes." In ICICCT 2019 – System Reliability, Quality Control, Safety, Maintenance and Management. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-8461-5_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ma, Siyuan, Yuewu Wang, Chunjing Kou, Peng Wang, Haotian Shi, and Jiwu Jing. "HiddenStor: A Steganographic Storage System Built on Secret Sharing." In Lecture Notes in Computer Science. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-4731-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Ming-Ming, Lu-Ting Tian, and Zhi-Guo Qu. "Efficient Multiparty Quantum Secret Sharing Scheme in High-Dimensional System." In Cloud Computing and Security. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00012-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Shi, Ronghua, Ye Kang, and Zhaoyuan Zhang. "Quantum Secret Sharing Based on Chinese Remainder Theorem in Hyperchaotic System." In Cyberspace Safety and Security. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03584-0_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sanyasi Naidu, P., and Reena Kharat. "Secure Authentication in Online Voting System Using Multiple Image Secret Sharing." In Communications in Computer and Information Science. Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-2738-3_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Auzel, Alexandre, and Vorapong Suppakitpaisarn. "Bridging Algorithmic Foundations with Information Security and Privacy: Set-k-Multicover Problem and Homomorphic Secret Sharing." In Algorithmic Foundations for Social Advancement. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-0668-9_15.

Full text
Abstract:
Abstract We explore the connections between two fields of study—the algorithmic foundations and the domains of information security and privacy. The principles of algorithmic foundations are instrumental in enhancing the efficiency of cryptographic systems. This is particularly relevant for post-quantum cryptography systems like isogeny-based cryptography, which benefit from efficient implementations. Conversely, methods from information privacy can be applied to ensure the trustability of several combinatorial algorithms, including linear integer programming and triangle counting. In this cha
APA, Harvard, Vancouver, ISO, and other styles
10

Perera, Maharage Nisansala Sevwandi, Toru Nakamura, Takashi Matsunaka, Hiroyuki Yokoyama, and Kouichi Sakurai. "Group Oriented Attribute-Based Encryption Scheme from Lattices with the Employment of Shamir’s Secret Sharing Scheme." In Network and System Security. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-39828-5_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "SECRET SHARING SYSTEM"

1

Yada, Junya, Yusuke Kozawa, and Hiromasa Habuchi. "Enhanced Illumination-light VN-CodeSK System with Secret Sharing Scheme." In 2024 IEEE 13th Global Conference on Consumer Electronics (GCCE). IEEE, 2024. https://doi.org/10.1109/gcce62371.2024.10761010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhu, Guangye, Keqian Liu, Liqiang Wu, and Zijun Guo. "An Efficient Verifiable Asymmetric Secret Sharing Scheme for Cloud System." In 2025 5th International Conference on Neural Networks, Information and Communication Engineering (NNICE). IEEE, 2025. https://doi.org/10.1109/nnice64954.2025.11064339.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Xie, Hao, Haoqian Pu, He Zhou, and Junhe Zhou. "A Multi-Wavelength Multiplexed Tunable Optical Secret Sharing System Based on D2NN." In 2024 Asia Communications and Photonics Conference (ACP) and International Conference on Information Photonics and Optical Communications (IPOC). IEEE, 2024. https://doi.org/10.1109/acp/ipoc63121.2024.10810019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Guangliang, Lingyun Li, Shengxian Xie, and Junqing Li. "Secret Sharing System and Secret Sharing Matrix." In 2009 International Conference on Computational Intelligence and Security. IEEE, 2009. http://dx.doi.org/10.1109/cis.2009.230.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Babenko, M., A. Tchernykh, E. Golimblevskaia, H. N. Viet, and V. Chaurasiya. "Computationally secure threshold secret sharing scheme with minimal redundancy." In The International Workshop on Information, Computation, and Control Systems for Distributed Environments. Crossref, 2020. http://dx.doi.org/10.47350/iccs-de.2020.02.

Full text
Abstract:
When designing and using distributed storage systems with cloud technology, the security issues become crucial. One of the promising mechanisms is the computationally secure threshold secret sharing scheme. We propose a computationally secure secret sharing scheme based on the minimally redundant modular code. It reduces the computational complexity of data encoding and decoding and reduce data redundancy. We show that it is computationally secure and provides data redundancy equivalent to the redundancy of the Rabin system. We demonstrate that the minimally redundant modular code does not sat
APA, Harvard, Vancouver, ISO, and other styles
6

Xing, Pengzhi, Hongwei Li, Meng Hao, Hanxiao Chen, Jia Hu, and Dongxiao Liu. "Distributed Function Secret Sharing and Applications." In Network and Distributed System Security Symposium. Internet Society, 2025. https://doi.org/10.14722/ndss.2025.242233.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wu, Wen-Chuan, Ke-Chung Cheng, and Shang-Chian Yang. "Secret digital images over cloud computing using meaningful secret sharing technique." In 2017 International Conference on Applied System Innovation (ICASI). IEEE, 2017. http://dx.doi.org/10.1109/icasi.2017.7988579.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Esmaeili, Younes, Mohammad Haeri, and Saeed Adelipour. "Secure Control System Using Iterative Secret Sharing." In 2023 31st International Conference on Electrical Engineering (ICEE). IEEE, 2023. http://dx.doi.org/10.1109/icee59167.2023.10334894.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Patel, Kinjal. "Secure multiparty computation using secret sharing." In 2016 International conference on Signal Processing, Communication, Power and Embedded System (SCOPES). IEEE, 2016. http://dx.doi.org/10.1109/scopes.2016.7955564.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Braun, Johannes, Alexander Wiesmaier, and Johannes Buchmann. "On the Security of Encrypted Secret Sharing." In 2013 46th Hawaii International Conference on System Sciences (HICSS). IEEE, 2013. http://dx.doi.org/10.1109/hicss.2013.426.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "SECRET SHARING SYSTEM"

1

Pasupuleti, Murali Krishna. Scalable Quantum Networks: Entanglement-Driven Secure Communication. National Education Services, 2025. https://doi.org/10.62311/nesx/rrvi525.

Full text
Abstract:
Abstract: Scalable quantum networks, powered by entanglement-driven secure communication, are poised to revolutionize global information exchange, cybersecurity, and quantum computing infrastructures. Unlike classical communication systems, quantum networks leverage quantum entanglement and superposition to enable ultra-secure data transmission, quantum key distribution (QKD), and instantaneous information sharing across large-scale networks. This research explores the fundamental principles of entanglement-based communication, the role of quantum repeaters, quantum memory, and multi-nodal ent
APA, Harvard, Vancouver, ISO, and other styles
2

Ali, Saleem, Miriam Aczel, and Kaveh Madani. Building a Global Minerals Trust for a Just Green Transition. United Nations University Institute for Water, Environment and Health (UNU INWEH), 2025. https://doi.org/10.53328/inr25sal004.

Full text
Abstract:
"Today, more than 70% of global production for key critical minerals is concentrated in just a few countries, raising serious concerns about supply security, market volatility, and geopolitical risk. Achieving a just and sustainable energy transition hinges on fair and reliable access to critical minerals—materials key for low-carbon technologies. However, global supply chains remain environmentally damaging and vulnerable to geopolitical tensions, creating systemic risks for both climate and economic goals. • A Global Minerals Trust offers a new multilateral model to promote responsible stewa
APA, Harvard, Vancouver, ISO, and other styles
3

Raja, Rameez Ali, Vidushi Toshniwal, and Rodrigo Salgado. GIS-Based Geotechnical Database for Collaborative GIS. Purdue University, 2023. http://dx.doi.org/10.5703/1288284317637.

Full text
Abstract:
INDOT spends at least 8 million dollars annually on geotechnical site investigations, not including the amounts spent by contractors. The laborious and costly job of data collection in geotechnical practice requires the efficient storing and organizing of this valuable data to develop correlations and trends in spatially varying geotechnical data. INDOT currently uses gINT software for managing geotechnical data and ArcGIS for storing boring logs and geotechnical reports. The INDOT geotechnical office is pursuing means to improve the efficiency of their operations by developing a GIS-based geo
APA, Harvard, Vancouver, ISO, and other styles
4

African Open Science Platform Part 1: Landscape Study. Academy of Science of South Africa (ASSAf), 2019. http://dx.doi.org/10.17159/assaf.2019/0047.

Full text
Abstract:
This report maps the African landscape of Open Science – with a focus on Open Data as a sub-set of Open Science. Data to inform the landscape study were collected through a variety of methods, including surveys, desk research, engagement with a community of practice, networking with stakeholders, participation in conferences, case study presentations, and workshops hosted. Although the majority of African countries (35 of 54) demonstrates commitment to science through its investment in research and development (R&amp;D), academies of science, ministries of science and technology, policies, rec
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'SECRET SHARING SYSTEM' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography