Log in

Relevant bibliographies by topics / SECRET SHARING SYSTEM / Journal articles

To see the other types of publications on this topic, follow the link: SECRET SHARING SYSTEM.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Li, Ying, Hong Min Jiang, and Tao Hu. "A Study on Distributed License Authorization System Based on Threshold Secret Sharing." Applied Mechanics and Materials 380-384 (August 2013): 2749–52. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.2749.

Full text

Abstract:

With the rapid popularity of P2P networks, the demand for digital rights management (DRM) in P2P mode is increasing quickly. The research on issuance of digital content licenses is the key issues in DRM. As for the centralized authorization systems, the security and the efficiency have certain defects. An improved distributed license authorization system is presented in this paper. And the nodes in the system are divided into six kinds of roles in accordance with theirs functions and a new non-interactive verifiable secret sharing protocol is introduced. Because of the adoptions of threshold s

APA, Harvard, Vancouver, ISO, and other styles

12

Deng, Haoyuan, and Ershun Du. "Secret-sharing in distributed power system optimization." iEnergy 1, no. 3 (2022): 278. http://dx.doi.org/10.23919/ien.2022.0038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Zhou, Jun, and Zhen Yu Yang. "Data Privacy Preservation in Wireless Sensor Networks Based on Multi-Secret Sharing Scheme." Applied Mechanics and Materials 411-414 (September 2013): 141–44. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.141.

Full text

Abstract:

The Internet of things is widespread concerned by the whole society now. As an important component of the Internet of things, wireless sensor network has wide application prospect in various fields such as medical and health, military defense. The traditional data privacy protection technology of PKI system used in the WSN networks has its own weakness. This paper presents the secret key sharing mechanism to protect data privacy. The secret key, remote node and base station used to communicate, was divided into multiple secrets. The multiple secrets were distributed in the nodes which connect

APA, Harvard, Vancouver, ISO, and other styles

14

Latha, G. "Efficient Local Secret Sharing for Distributed Blockchain Systems." International Journal for Research in Applied Science and Engineering Technology 9, no. VI (2021): 2043–48. http://dx.doi.org/10.22214/ijraset.2021.35445.

Full text

Abstract:

Blockchain system store transaction data in the form of a distributed database where each peer is to maintain an identical copy. Blockchain systems resemble repetition codes, incurring high storage cost. Recently, distributed storage blockchain (DSB) systems have been proposed to improve storage efficiency by incorporating secret sharing, private key encryption, and information dispersal algorithms. However, the DSB results in significant communication cost when peer failures occur due to denial of service attacks. In this project, we propose a new DSB approach based on a local secret sharing

APA, Harvard, Vancouver, ISO, and other styles

15

Tian, Junfeng, and Yue Li. "Anticollusion Attack Strategy Combining Trust Metrics and Secret Sharing for Friendships Protection." Security and Communication Networks 2021 (July 5, 2021): 1–14. http://dx.doi.org/10.1155/2021/9717747.

Full text

Abstract:

Online social networks provide users with services such as online interaction, instant messaging, and information sharing. The friend search engine, a new type of social application, provides users with the service for querying the list of other individuals’ friends. Currently, the existing research focuses on independent attacks for friend search engines while ignoring the more complicated collusion attacks, which can expose more friendships that users are not willing to share. Compared with independent attackers, collusion attackers share query results by cooperating with each other. In this

APA, Harvard, Vancouver, ISO, and other styles

16

Chernyavskiy, A. F., A. I. Kazlova, V. S. Sadov, and A. A. Kolyada. "Adaptation of the modular number system in threshold secret sharing schemes." Informatics 22, no. 1 (2025): 90–97. https://doi.org/10.37661/1816-0301-2025-22-1-90-97.

Full text

Abstract:

Objectives. The purpose of the research is to test the applicability of the adaptation of the modular number system using a masking transformation with a pseudo-random integer value to the original secret S in a modification of Adi Shamir’s (k, n)-threshold secret sharing scheme to reduce the complexity of calculating the basic integral characteristic to a theoretical minimum.Methods. A modification of Adi Shamir's secret sharing scheme in a threshold cryptosystem based on modular arithmetic (MA cryptosystem) with the generation of shares of secret sharing participants in two stages is conside

APA, Harvard, Vancouver, ISO, and other styles

17

Patel, Kruti. "Evaluation of Proposed Secrete Sharing System based on Encryption for Distributed Cloud Data Security." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 11 (2023): 1525–34. http://dx.doi.org/10.17762/ijritcc.v11i11.10954.

Full text

Abstract:

The Public Key Infrastructure (PKI) is deteriorating, partly due to a lack of comprehensive understanding of encryption mechanisms and also due to flaws in its execution. This paper presents a data storage methodology utilizing secret sharing techniques, which could address the challenges associated with PKI while accommodating innovative architectural designs incorporating features like automated failover and emergency data retrieval. The document introduces a framework which facilitating a cloud-based infrastructure with inherent privacy measures and failover capabilities. To evaluate the pe

APA, Harvard, Vancouver, ISO, and other styles

18

Hashim, Ashwaq Talib, and Zaid Mundher Radeef. "Multiple Image Secret Sharing based on Linear System." Indian Journal of Science and Technology 10, no. 33 (2017): 1–17. http://dx.doi.org/10.17485/ijst/2017/v10i33/113085.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

HAYASHI, D. "Automatic Repair Mechanism of Secret Sharing Storage System." IEICE Transactions on Information and Systems E88-D, no. 5 (2005): 971–75. http://dx.doi.org/10.1093/ietisy/e88-d.5.971.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

M. G. Al-Saidi, N., and M. M. Abdulhadi. "E–Voting System based on Secret Sharing Scheme." Engineering and Technology Journal 35, no. 1B (2017): 13–18. http://dx.doi.org/10.30684/etj.35.1b.3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Reddy, L. Sreenivasulu, and Indrajeet Kumar. "Inside adversary combinatorial attacks in secret sharing scheme via linear system of equations when n = 5." Journal of Discrete Mathematical Sciences and Cryptography 27, no. 8 (2024): 2379–96. https://doi.org/10.47974/jdmsc-1866.

Full text

Abstract:

When an insider possesses greater than or equal to the threshold number of secret shares, he can retrieve an entire secret without any difficulty. This kind of task doesn’t have any big problems. In this work, even if the inside adversary only knows a smaller number of secret shares than the threshold amount, we give the different computational approaches to retrieve the whole secret share. We limit five secret shares in this investigation to be used only for calculation. The assaults in this work are classified into four categories utilising probabilistic and algebraic systems of linear congr

APA, Harvard, Vancouver, ISO, and other styles

22

Chang, Joy, Bo-Yuan Huang, and Justie Juan. "A New Visual Multi-Secrets Sharing Scheme by Random Grids." Cryptography 2, no. 3 (2018): 24. http://dx.doi.org/10.3390/cryptography2030024.

Full text

Abstract:

In (2, 2)-visual secret sharing (VSS) schemes, a common type of (k, n)-threshold VSS schemes, secret information can be decoded directly through only two shares by using a human vision system. Several studies have analyzed methods of simplifying the decoding process and refining encoding to pass more secret images through two identical shares. However, limited secret images are retrieved, and the quality of the recovered images is low. This paper proposes an advanced (2, 2)-VSS scheme that can embed N secret images into two rectangular shares. Compared with other related VSS schemes, more secr

APA, Harvard, Vancouver, ISO, and other styles

23

Framner, Erik, Simone Fischer-Hübner, Thomas Lorünser, Ala Sarah Alaqra, and John Sören Pettersson. "Making secret sharing based cloud storage usable." Information & Computer Security 27, no. 5 (2019): 647–67. http://dx.doi.org/10.1108/ics-01-2019-0016.

Full text

Abstract:

Purpose The purpose of this paper is to develop a usable configuration management for Archistar, which utilizes secret sharing for redundantly storing data over multiple independent storage clouds in a secure and privacy-friendly manner. Selecting the optimal secret sharing parameters, cloud storage servers and other settings for securely storing the secret data shares, while meeting all of end user’s requirements and other restrictions, is a complex task. In particular, complex trade-offs between different protection goals and legal privacy requirements need to be made. Design/methodology/app

APA, Harvard, Vancouver, ISO, and other styles

24

Li, Ping, Shengjun Li, Hongyang Yan, Lishan Ke, Teng Huang, and Alzubair Hassan. "A Group Identification Protocol with Leakage Resilience of Secret Sharing Scheme." Complexity 2020 (March 13, 2020): 1–13. http://dx.doi.org/10.1155/2020/1784276.

Full text

Abstract:

Secret sharing has been study for many years and has had a number of real-word applications. There are several methods to construct the secret-sharing schemes. One of them is based on coding theory. In this work, we construct a secret-sharing scheme that realizes an access structure by using linear codes, in which any element of the access structure can reconstruct the secret key. We prove that our scheme is a multiprover zero-knowledge proof system in the random oracle model, which shows that a passive adversary gains no information about the secret key. Our scheme is also a leakage-resilient

APA, Harvard, Vancouver, ISO, and other styles

25

Al-Najjar, Hazem, and Nadia Al-Rousan. "SSDLP: Sharing Secret Data between Leader and Participant." Chinese Journal of Engineering 2014 (January 14, 2014): 1–7. http://dx.doi.org/10.1155/2014/736750.

Full text

Abstract:

This paper investigates the problem of sharing the secret document containing a secret data between leader and participant(s) depending on specific conditions and rules. The participant(s) can retrieve part of the secret document but will not be able to retrieve any secret data without the leader. At the same time, the leader may have a little information about the secret document but cannot retrieve the secret data and the secret document without cooperating with participant(s). To evaluate the proposed model and the system efficiency, four tests are suggested, which are concatenation and sha

APA, Harvard, Vancouver, ISO, and other styles

26

Chen, Hefeng, and Chin-Chen Chang. "A Novel (t,n) Secret Sharing Scheme Based upon Euler’s Theorem." Security and Communication Networks 2019 (April 1, 2019): 1–7. http://dx.doi.org/10.1155/2019/2387358.

Full text

Abstract:

The t,n secret sharing scheme is used to protect the privacy of information by distribution. More specifically, a dealer splits a secret into n shares and distributes them privately to n participants, in such a way that any t or more participants can reconstruct the secret, but no group of fewer than t participants who cooperate can determine it. Many schemes in literature are based on the polynomial interpolation or the Chinese remainder theorem. In this paper, we propose a new solution to the system of congruences different from Chinese remainder theorem and propose a new scheme for t,n secr

APA, Harvard, Vancouver, ISO, and other styles

27

Yadav, Mainejar, and Ranvijay . "Emerging Trends in Visual Secret Sharing." International Journal of Engineering & Technology 7, no. 3.12 (2018): 374. http://dx.doi.org/10.14419/ijet.v7i3.12.16110.

Full text

Abstract:

Visual Secret Sharing (VSS) is an increased applicability of traditional secret sharing. In VSS, the secret information is recovered by human visual system or lightweight computational device. There are two models available in VSS, one is Visual Cryptography (VC) which is introduced by Naor's in 1994 and other is a Random Grid (RG) based VSS which is proposed by Keren and Kafri. This state of the art covers both the models of VSS along with its application. The various application areas of VSS are visual authentication and identification, image encryption, access control, data hiding etc. The

APA, Harvard, Vancouver, ISO, and other styles

28

Shvetha, A., S. Rathnamala, and M. V. Meenumathi. "Visual Secret Sharing Scheme Using Encrypting Multiple Images." Perspectives in Communication, Embedded-systems and Signal-processing - PiCES 5, no. 1 (2021): 6–10. https://doi.org/10.5281/zenodo.4739451.

Full text

Abstract:

The new VSS scheme introduces two distinct phases such as Message-oriented Security and Image-based Sensitive Scheme. Through this approach the new framework is improving our privacy and secret sharing security. The main purpose of this work is to hide reversible separable data in the image.  In the first step a content provider will use encryption key to encrypt the uncompressed original file. Here we use a data hiding key for the purpose of compressing the least significant bits of the encrypted image in order to generate space for certain additional data. Even if the image content is u

APA, Harvard, Vancouver, ISO, and other styles

29

Cheng, Jingwen, Xuehu Yan, Lintao Liu, Yue Jiang, and Xuan Wang. "Meaningful Secret Image Sharing with Saliency Detection." Entropy 24, no. 3 (2022): 340. http://dx.doi.org/10.3390/e24030340.

Full text

Abstract:

Secret image sharing (SIS), as one of the applications of information theory in information security protection, has been widely used in many areas, such as blockchain, identity authentication and distributed cloud storage. In traditional secret image sharing schemes, noise-like shadows introduce difficulties into shadow management and increase the risk of attacks. Meaningful secret image sharing is thus proposed to solve these problems. Previous meaningful SIS schemes have employed steganography to hide shares into cover images, and their covers are always binary images. These schemes usually

APA, Harvard, Vancouver, ISO, and other styles

30

Mesnager, Sihem, Ahmet Sınak, and Oğuz Yayla. "Threshold-Based Post-Quantum Secure Verifiable Multi-Secret Sharing for Distributed Storage Blockchain." Mathematics 8, no. 12 (2020): 2218. http://dx.doi.org/10.3390/math8122218.

Full text

Abstract:

Blockchain systems store transaction data in the form of a distributed ledger where each node stores a copy of all data, which gives rise to storage issues. It is well-known that the tremendous storage and distribution of the block data are common problems in blockchain systems. In the literature, some types of secret sharing schemes are employed to overcome these problems. The secret sharing method is one of the most significant cryptographic protocols used to ensure the privacy of the data. The main purpose of this paper is to improve the recent distributed storage blockchain systems by prop

APA, Harvard, Vancouver, ISO, and other styles

31

MIYAMOTO, T., Y. MORITA, and S. KUMAGAI. "Vertical Partitioning Method for Secret Sharing Distributed Database System." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A, no. 11 (2006): 3244–49. http://dx.doi.org/10.1093/ietfec/e89-a.11.3244.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Yamamoto, Hirosuke. "Secret sharing system using (k, L, n) threshold scheme." Electronics and Communications in Japan (Part I: Communications) 69, no. 9 (1986): 46–54. http://dx.doi.org/10.1002/ecja.4410690906.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Wan, Song, Yuliang Lu, Xuehu Yan, and Lintao Liu. "A Novel Visual Secret Sharing Scheme Based on QR Codes." International Journal of Digital Crime and Forensics 9, no. 3 (2017): 38–48. http://dx.doi.org/10.4018/ijdcf.2017070104.

Full text

Abstract:

In this paper, a novel visual secret sharing (VSS) scheme using QR codes is investigated. The proposed visual secret sharing scheme based on QR codes(VSSQR) can visually reveal secret image by stacking sufficient (shadow images) shares as well as scan the QR code by a QR code reader. Our VSSQR exploits the error correction mechanism in the QR code structure, to embed the bits corresponding to shares generated by VSS from a secret bit into the same locations of QR codes in the processing of encoding QR. Each output share is a valid QR code, which may reduce the likelihood of attracting the atte

APA, Harvard, Vancouver, ISO, and other styles

34

Prasetyo, Heri, Chih-Hsien Hsia, and Alim Wicaksono Hari Prayuda. "Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction." Journal of Imaging 7, no. 4 (2021): 70. http://dx.doi.org/10.3390/jimaging7040070.

Full text

Abstract:

A new technique for progressive visual secret sharing (PVSS) with adaptive priority weight is proposed in this paper. This approach employs the bitwise and eXclusive-OR (XOR) based approaches for generating a set of shared images from a single secret image. It effectively overcomes the former scheme limitation on dealing with an odd number of stacked or collected shared images in the recovery process. The presented technique works well when the number of stacked shared images is odd or even. As documented in experimental results, the proposed method offers good results over binary, grayscale,

APA, Harvard, Vancouver, ISO, and other styles

35

Xie, Hui Juan, Wei She, and Chang Hao Han. "Shamir's Threshold Scheme to Ensure Security in Cloud Computing Services." Applied Mechanics and Materials 543-547 (March 2014): 3632–35. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.3632.

Full text

Abstract:

Cloud computing system preserves the security and privacy of a user's data by replicating data among several clouds and by using the secret sharing approach. It uses the database management system DBMS (data source) to manage and control the operations between the clients and them ulti-clouds inside a cloud service provider [1]. Generally speaking, The Shamir's threshold scheme is suitable for the shares in the cloud computing. The Shamir's threshold scheme as a secret sharing scheme will attract more attention in the cloud computing in future.

APA, Harvard, Vancouver, ISO, and other styles

36

Qin, Hua Wang, Xiao Hua Zhu, and Yue Wei Dai. "A Leakproof Secret Sharing Scheme Based on Environment Sensing." Applied Mechanics and Materials 665 (October 2014): 647–53. http://dx.doi.org/10.4028/www.scientific.net/amm.665.647.

Full text

Abstract:

A leakproof secret sharing scheme based on environment sensing is proposed, in which the shadows of participants and the shared secret are leakproof, and can be used repeatedly. The counterfeit shadows of the participants and the authentication information of the shared secret can be changed dynamically basing on environment sensing. So the scheme is secure even against a mobile adversary. Besides, through introducing the concept of adversary structure and the transformation of access structure to adversary structure, the secret sharing on general access structure is realized. Compared to the

APA, Harvard, Vancouver, ISO, and other styles

37

Wu, Zhen, Yining Liu, and Xingxing Jia. "A Novel Hierarchical Secret Image Sharing Scheme with Multi-Group Joint Management." Mathematics 8, no. 3 (2020): 448. http://dx.doi.org/10.3390/math8030448.

Full text

Abstract:

With the spread of the Internet, the speed of data spread is getting faster and faster. It benefits us a lot but also brings us many potential security problems, especially the problem of privacy leakage. For example, more and more people choose to store their private images in the cloud. Secret image sharing as a significant method has been widely applied in protecting images in the cloud, which reduces the risks of data leakage and data loss. Generally, the secret image sharing scheme would encrypt the secret image into a series of shares and then stored these shares in a cloud. However, whe

APA, Harvard, Vancouver, ISO, and other styles

38

Lee, Jae Hwan, and Jong Hwan Park. "Broadcast Encryption System Using Secret Sharing and Subset Difference Methods." Journal of Broadcast Engineering 20, no. 1 (2015): 92–109. http://dx.doi.org/10.5909/jbe.2015.20.1.92.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Lee, Chul-Ung, Hyoung Joong Kim, Jong Hyuk Park, Sang-Soo Yeo, and Jaesoo Yang. "A Pervasive Secret Sharing Scheme For Embedded Visual Communication System." Intelligent Automation & Soft Computing 16, no. 3 (2010): 433–47. http://dx.doi.org/10.1080/10798587.2010.10643091.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Ahmed, Ali, and Loay George. "Compression image sharing using DCT- Wavelet transform and coding by Blackely method." Iraqi Journal for Computers and Informatics 43, no. 1 (2017): 28–39. http://dx.doi.org/10.25195/ijci.v43i1.74.

Full text

Abstract:

The increased use of computer and internet had been related to the wide use of multimedia information. The requirement forprotecting this information has risen dramatically. To prevent the confidential information from being tampered with, one needs toapply some cryptographic techniques. Most of cryptographic strategies have one similar weak point that is the information is centralized.To overcome this drawback the secret sharing was introduced. It’s a technique to distribute a secret among a group of members, suchthat every member owns a share of the secret; but only a particular combination

APA, Harvard, Vancouver, ISO, and other styles

41

Yu, Haoyang, Junwei Zhang, Zixiao Xiang, Biao Liu, and Huamin Feng. "Lossless Reversible Data Hiding in Encrypted Image for Multiple Data Hiders Based on Pixel Value Order and Secret Sharing." Sensors 23, no. 10 (2023): 4865. http://dx.doi.org/10.3390/s23104865.

Full text

Abstract:

Reversible data hiding in encrypted images (RDH-EI) is instrumental in image privacy protection and data embedding. However, conventional RDH-EI models, involving image providers, data hiders, and receivers, limit the number of data hiders to one, which restricts its applicability in scenarios requiring multiple data embedders. Therefore, the need for an RDH-EI accommodating multiple data hiders, especially for copyright protection, has become crucial. Addressing this, we introduce the application of Pixel Value Order (PVO) technology to encrypted reversible data hiding, combined with the secr

APA, Harvard, Vancouver, ISO, and other styles

42

Yang, Yu Guang, and Hai Ping Chai. "A Trusted Multi-Party Authentication Scheme Based on Proactive-ElGamal Threshold Secret Sharing System." Applied Mechanics and Materials 235 (November 2012): 20–24. http://dx.doi.org/10.4028/www.scientific.net/amm.235.20.

Full text

Abstract:

In most existing authentication schemes users are authenticated by the server one by one which results in lower efficiency of authentication when the number of users is large. Aiming at the drawback, this paper propose an efficient trusted multi-party authentication scheme based on threshold secret sharing, the discrete logarithm problem and ElGamal cryptosystem. Using (t,n) threshold secret sharing idea, the paper propose a (t,n) threshold authentication scheme which can not only simultaneously authenticate t users satisfying some specific conditions, but also authenticate new users dynamical

APA, Harvard, Vancouver, ISO, and other styles

43

Hosseini Beghaeiraveri, Seyed Amir, Mohammad Izadi, and Mohsen Rezvani. "Broadcast Complexity and Adaptive Adversaries in Verifiable Secret Sharing." Security and Communication Networks 2020 (August 1, 2020): 1–10. http://dx.doi.org/10.1155/2020/9428457.

Full text

Abstract:

Verifiable secret sharing (VSS) is one of the basic problems in the theory of distributed cryptography and has an important role in secure multiparty computation. In this case, it is tried to share a confidential data as secret, between multiple nodes in a distributed system, in the presence of an active adversary that can destroy some nodes, such that the secret can be reconstructed with the participation of certain size of honest nodes. A dynamic adversary can change its corrupted nodes among the protocol. So far, there is not a formal definition and there are no protocols of dynamic adversa

APA, Harvard, Vancouver, ISO, and other styles

44

Liu, Yuan, Licheng Wang, Xiaoying Shen, Lixiang Li, and Dezhi An. "Space-Efficient Key-Policy Attribute-Based Encryption from Lattices and Two-Dimensional Attributes." Security and Communication Networks 2020 (August 7, 2020): 1–11. http://dx.doi.org/10.1155/2020/2345369.

Full text

Abstract:

Linear secret-sharing scheme (LSSS) is a useful tool for supporting flexible access policy in building attribute-based encryption (ABE) schemes. But in lattice-based ABE constructions, there is a subtle security problem in the sense that careless usage of LSSS-based secret sharing over vectors would lead to the leakage of the master secret key. In this paper, we propose a new method that employs LSSS to build lattice-based key-policy attribute-based encryption (KP-ABE) that resolves this security issue. More specifically, no adversary can reconstruct the master secret key since we introduce a

APA, Harvard, Vancouver, ISO, and other styles

45

Song, Anxiao, Jiaxuan Fu, Xutong Mu, XingHui Zhu, and Ke Cheng. "L-SecNet: Towards Secure and Lightweight Deep Neural Network Inference." Journal of Networking and Network Applications 3, no. 4 (2023): 171–81. http://dx.doi.org/10.33969/j-nana.2023.030404.

Full text

Abstract:

The advances in machine learning technology has promoted its great potential for deep neural network (DNN) inference powered applications of Internet of Things (IoT), such as facial verification cameras and speech recognition assistants. The current deployment of these applications also raises serious privacy concerns, especially when sensitive individual information is accessed easily by various IoT devices. Fortunately, the cryptography-based solutions are able to execute secure inference without infringing the user’s raw data and the model owner’s proprietary model. However, existing works

APA, Harvard, Vancouver, ISO, and other styles

46

Tejedor-Romero, Marino, David Orden, Ivan Marsa-Maestre, Javier Junquera-Sanchez, and Jose Manuel Gimenez-Guzman. "Distributed Remote E-Voting System Based on Shamir’s Secret Sharing Scheme." Electronics 10, no. 24 (2021): 3075. http://dx.doi.org/10.3390/electronics10243075.

Full text

Abstract:

A number of e-voting systems have been proposed in the last decades, attracting the interest of the research community. The challenge is far from being fully addressed, especially for remote systems. In this work, we propose DiverSEC, a distributed, remote e-voting system based on Shamir secret sharing, operations in Galois field and mixnets, which enables end-to-end vote verification. Parties participate as nodes in the network, protecting their interests and ensuring process integrity due to the conflicting interests. The threat model is very conservative, not letting even the most privilege

APA, Harvard, Vancouver, ISO, and other styles

47

Cree, Joy, and Alex May. "Code-routing: a new attack on position verification." Quantum 7 (August 9, 2023): 1079. http://dx.doi.org/10.22331/q-2023-08-09-1079.

Full text

Abstract:

The cryptographic task of position verification attempts to verify one party's location in spacetime by exploiting constraints on quantum information and relativistic causality. A popular verification scheme known as f-routing involves requiring the prover to redirect a quantum system based on the value of a Boolean function f. Cheating strategies for the f-routing scheme require the prover use pre-shared entanglement, and security of the scheme rests on assumptions about how much entanglement a prover can manipulate. Here, we give a new cheating strategy in which the quantum system is encoded

APA, Harvard, Vancouver, ISO, and other styles

48

Gupta, Kanav, Neha Jawalkar, Ananta Mukherjee, et al. "SIGMA: Secure GPT Inference with Function Secret Sharing." Proceedings on Privacy Enhancing Technologies 2024, no. 4 (2024): 61–79. http://dx.doi.org/10.56553/popets-2024-0107.

Full text

Abstract:

Secure 2-party computation (2PC) enables secure inference that offers protection for both proprietary machine learning (ML) models and sensitive inputs to them. However, the existing secure inference solutions suffer from high latency and communication overheads, particularly for transformers. Function secret sharing (FSS) is a recent paradigm for obtaining efficient 2PC protocols with a preprocessing phase. We provide Sigma, the first end-to-end system for secure transformer inference based on FSS. By constructing new FSS-based protocols for complex machine learning functionalities, such as S

APA, Harvard, Vancouver, ISO, and other styles

49

Lee, Jae Hwan, and Jong Hwan Park. "2-Subset Difference Broadcast Encryption System Based on Secret Sharing Method." Journal of Broadcast Engineering 20, no. 4 (2015): 580–97. http://dx.doi.org/10.5909/jbe.2015.20.4.580.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Lee, Jae Hwan, and Jong Hwan Park. "A Transmission-Efficient Broadcast Encryption System Based on Secret Sharing Method." Journal of Broadcast Engineering 21, no. 3 (2016): 412–24. http://dx.doi.org/10.5909/jbe.2016.21.3.412.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!