English
Related papers

Related papers: Hash function based secret sharing scheme designs

200 papers

We propose an adaptive threshold multi secret sharing scheme based solely on cryptographically secure hash functions. We show that the proposed scheme is also: perfect, ideal, verifiable, and proactive. Moreover the proposed scheme has a…

Cryptography and Security · Computer Science 2023-02-07 M. Andrecut

In this paper, a renewable, multi-use, multi-secret sharing scheme for general access structure based on one-way collision resistant hash function is presented in which each participant has to carry only one share. By applying…

Cryptography and Security · Computer Science 2019-07-09 Angsuman Das , Avishek Adhikari

Sharing a secret efficiently amongst a group of participants is not easy since there is always an adversary / eavesdropper trying to retrieve the secret. In secret sharing schemes, every participant is given a unique share. When the desired…

Cryptography and Security · Computer Science 2022-11-04 James Smith

This paper first reviews some basic properties of cryptographic hash function, secret sharing scheme, and Latin square. Then we discuss why Latin square or its critical set is a good choice for secret representation and its relationship…

Cryptography and Security · Computer Science 2011-07-12 Chi Sing Chum , Xiaowen Zhang

A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a collection of secret recovery functions. The study of schemes using arbitrary probability spaces and unbounded number of…

Cryptography and Security · Computer Science 2022-10-25 László Csirmaz

A secret sharing scheme is a method to store information securely and reliably. Particularly, in a threshold secret sharing scheme, a secret is encoded into $n$ shares, such that any set of at least $t_1$ shares suffice to decode the…

Information Theory · Computer Science 2016-04-04 Wentao Huang , Michael Langberg , Joerg Kliewer , Jehoshua Bruck

Multi-secret sharing is an extension of secret sharing technique where several secrets are shared between the participants, each according to a specified access structure. The secrets can be reconstructed according to the access structure…

Cryptography and Security · Computer Science 2014-07-25 V. P. Binu , A. Sreekumar

A (t,n)-threshold secret sharing scheme is a method to distribute a secret among n participants in such a way that any t participants can recover the secret, but no t-1 participants can. In this paper, we propose two secret sharing schemes…

Cryptography and Security · Computer Science 2012-05-02 Maggie Habeeb , Delaram Kahrobaei , Vladimir Shpilrain

Secret image sharing deals with splitting confidential images into several shares and the original image can be reconstructed from the qualified subset of the shares. Secret sharing schemes are used in transmission and storage of private…

Cryptography and Security · Computer Science 2015-01-14 V. P. Binu , A. Sreekumar

Secret sharing is a new alternative for outsourcing data in a secure way.It avoids the need for time consuming encryption decryption process and also the complexity involved in key management.The data must also be protected from untrusted…

Cryptography and Security · Computer Science 2015-02-27 V. P. Binu , A. Sreekumar

Secret sharing schemes are widely used now a days in various applications, which need more security, trust and reliability. In secret sharing scheme, the secret is divided among the participants and only authorized set of participants can…

Cryptography and Security · Computer Science 2014-06-24 V P Binu , A Sreekumar

Group oriented applications are getting more and more popular in mobile Internet and call for secure and efficient secret sharing (SS) scheme to meet their requirements. A $(t,n)$ threshold SS scheme divides a secret into $n$ shares such…

Cryptography and Security · Computer Science 2021-04-13 Fuyou Miao , Yue Yu , Keju Meng , Wenchao Huang , Yan Xiong

Threshold secret sharing schemes do not prevent any malicious behavior of the dealer or shareholders and so we need verifiable secret sharing, to detect and identify the cheaters, to achieve fair reconstruction of a secret. The problem of…

Cryptography and Security · Computer Science 2012-03-19 Keyur Parmar , Devesh Jinwala

Secret sharing schemes based on the idea of hidden multipliers in encryption are proposed. As a platform, one can use both multiplicative groups of finite fields and groups of invertible elements of commutative rings, in particular,…

Cryptography and Security · Computer Science 2021-08-17 Vitaly Roman'kov

The main aim of this paper is to construct a multi-secret sharing scheme for general access structure in a trusted dealer model using suitable hash function and Lagrange's interpolation method. Even though, the proposed scheme is a…

Cryptography and Security · Computer Science 2014-09-02 Partha Sarathi Roy , Avishek Adhikari

One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme the secret K is distributed among a finite set of participants P by a special participant called the dealer, in such a way that only…

Information Theory · Computer Science 2020-03-31 Ghanem Meriem , Bouroubi Sadek

Secret sharing is a method of dividing a secret among n par- ticipants and allows only qualified subset to reconstruct the secret and hence provides better reliability and availability of secret data.In the generalized secret sharing…

Cryptography and Security · Computer Science 2014-07-15 V P Binu , A Sreekumar

In this paper a secret sharing scheme based on the word problem in groups is introduced. The security of the scheme and possible variations are discussed in section 2. The article concludes with the suggestion of two categories of platform…

Cryptography and Security · Computer Science 2010-09-02 Dimitrios Panagopoulos

Function Secret Sharing (FSS) schemes enable sharing efficiently secret functions. Schemes dedicated to point functions, referred to as Distributed Point Functions (DPFs), are the center of FSS literature thanks to their numerous…

Cryptography and Security · Computer Science 2026-03-19 Marc Damie , Florian Hahn , Andreas Peter , Jan Ramon

This note proposes a method of space efficient secret sharing in which k secrets are mapped into n shares (n>=k) of the same size. Since, n can be chosen to be equal to k, the method is space efficient. This method may be compared with…

Cryptography and Security · Computer Science 2010-01-11 Abhishek Parakh , Subhash Kak
‹ Prev 1 2 3 10 Next ›