Questions tagged [secret-sharing]
Secret sharing refers to splitting a secret among multiple parties so that together they can reconstruct it. All parties, or just a threshold number of them, can be required for reconstruction. If fewer than the required number of parties participate, no information should be leaked about the secret.
548
questions
2
votes
0
answers
23
views
How to distribute share that sums to 0 without a dealer?
I am looking for a protocol where each party generates a share such that $\sum_{i\in [n]} s_i =0$ where the shares should remain secret. The adversary may corrupt n-2 parties, and the parties can be ...
- 99
0
votes
1
answer
127
views
Additive Secret Sharing of Floating point numbers
Consider a floating point number $f$ in IEEE 754 format with sign, exponent and significand values as $f.s$, $f.e$, and $f.sig$. Given this floating point number $f$, I want to compute the shares of $...
2
votes
0
answers
99
views
Secret sharing scheme which cannot tell fake shares from real ones
I am looking for a secret sharing algorithm which accepts a large array, some elements of which are real shares and the rest are fake. The algorithm should satisfy the following conditions:
If all ...
- 121
0
votes
0
answers
34
views
can ownership proofs be added to circuits to make them zk-snark resistant to quantum proof forgery attacks?
According to my previous question the proofs cannot be broken by quantum computation, you cannot obtain the witness of the generated zk-snark proof.
link to my previous question.
Now if the concern is ...
- 3
1
vote
1
answer
43
views
The representation of truncation protocol in SecureML
The secure multiparty computation framework SecureML 1 has proposed a truncation protocol for decimal arithmetic in the integer field.
As mentioned in this paper,
In field $\mathbb{Z}_{2^l}$, $x\in [...
- 11
0
votes
0
answers
30
views
Open-Source Shamir Secret Sharing Hardware Implementations in GF
Is there any hardware implementation of Shamir's secret-sharing method available? I have only go the following two implementations in the existing literature.
Paper 1
Paper 2
Anything more in the ...
- 1
5
votes
11
answers
9k
views
For Symmetric Cryptography, why is it considered more important to safeguard a key than the function/algorithm for encrypting/decrypting a message?
As stated for the question above here's an analogy:
You are a robber looking for a house to rob with two different scenarios that might occur.
1. You have a key that you know belongs to a house and ...
- 67
0
votes
0
answers
22
views
Subkeys of multiple generated sets not combineable Shamir Secret Sharing
I am using a Shamir Secret Sharing implementation in Java and I have the use case,
that I may have to generate more Subkeys of the Secret after I already generated some.
Generating them works, but if ...
- 1
0
votes
1
answer
80
views
Group secret agreement for clients do not have connection to each other
In my idea, $n$ clients will have the connection to a server, and clients will not be able to connect with other clients. Are there any previous design has been published to let $n$ clients agree on a ...
0
votes
0
answers
41
views
Transmit a password to inheritors
I am looking for a safe and easy way for my inheritors to get a password after my death. That can be the password of a digital vault, a password manager, or anything else.
I could write the password ...
- 1
0
votes
1
answer
66
views
Shamir Secret Sharing for API Authentication
I want to implement authentication for an API and thought about using Shamir Secret Sharing to do so.
My plan is to generate 1 Master Key which is stored in the Database, we then generate about 1000 ...
- 1
1
vote
0
answers
39
views
Function Secret Sharing
Bob has constructed a non-linear function $f: \mathbb{R}^n\rightarrow \mathbb{R}^m$ of moderate complexity (i.e., evaluation takes on the order of seconds on a modern computer). Is it possible to ...
- 11
0
votes
1
answer
90
views
Secret Sharing Floating point numbers in IEEE-754 Format
Various papers in the literature (such as https://eprint.iacr.org/2022/322.pdf, https://eprint.iacr.org/2013/850.pdf) use the sign, exponent, and significand values to additively secret share the ...
1
vote
1
answer
84
views
How does the key generation of a homomorphic secret-sharing protocol works?
I am new to cryptography and do not have sufficient background knowledge, and I am sorry for any possible vagueness in my question.
I am reading a paper (https://eprint.iacr.org/2019/129.pdf) about ...
- 13
0
votes
0
answers
51
views
Multiplicative inverse protocol for MPC that outputs 0 when input is 0
Setting: Shamir secret-sharing over the field $GF(p)$, $p$ a prime.
For $a\in GF(p)$, I would like a protocol that takes a sharing $[a]$ as input, and outputs: $[a^{-1}]$ if $a\neq 0$, and $[0]$ if $a=...
1
vote
1
answer
98
views
The state of Shamir's Secret Sharing in 2023
Shamir's Secret Sharing GPL implementation called ssss got removed from Tails OS years back.
Is Shamir's secret sharing still secure nowadays? Why was it removed ...
- 173
1
vote
1
answer
102
views
Why don't basically all "clusters" and similar distributed systems use Shamir's secret sharing method?
When I came to the topic of Ansible (Vault), when deploying secrets in Ansible and other passwords up to 128 characters Shamir's Secret Sharing would be an ideal solution I think:
The secret is never ...
- 173
2
votes
1
answer
89
views
Alternative definition of secret sharing using entropy
I ame reading the paper "Secret-Sharing schemes: A survey" by Amos Beimel. Here there are two definitions of secret sharing.
The first one states:\
A distribution scheme $\langle \Pi,\mu \...
- 93
0
votes
2
answers
99
views
Query about arithmetic finite fields
I was working on implementing shamir secret sharing in GF(2^256), According to my knowledge multiplication in a finite field is defined as mul(a,b) = (a*b)%mod, where mod is the irreducible polynomial....
- 33
0
votes
1
answer
48
views
How to maximise compatibility of Shamir's Secret Sharing
I want to create a shared secret from a short string (e.g. a password) which should be easy to decrypt also in the long term. Unfortunately, I have quite a hard time to make the different tools work ...
- 101
1
vote
1
answer
102
views
Instead of asymetric encryption, why not use two One-time pad? [duplicate]
Why is the following protocol never used to share a symetric key between two parties ?
⊕ is the XOR operation.
Alice has M and wants to send it to Bob.
Alice generates K₁ randomly.
Bob generates K₂ ...
- 13
0
votes
1
answer
75
views
Interpolation of Shamir secret in the Exponent
I'm trying to interpolate a Shamir secret in the exponent based on Boneh's and Shoup's book, Section 22.1 and Corollary 22.2. I think I understand how the scheme works, but I'm stuck now with some ...
- 103
0
votes
0
answers
54
views
Is it posible to generate SNARK of MPC share validity?
Assume we have a central issuing authority that sends each participant a share that reconstructs in key $P_k$. I.e. Shamir Secret Share with $2$ out of $N$ format where $N>3$.
This central ...
- 1
0
votes
1
answer
83
views
Is it possible to have a shared secret between an unlimited number of parties asynchronously?
Let's say I encrypt a message with some secret and store it in a database. Later, I want to securely share that secret with someone, so that they can read the message as well. Even later, I want to ...
- 101
1
vote
1
answer
143
views
Is ($2^{256} + 297$) safe to use as modulus in Shamir Secret Sharing?
The python code example on Wikipedia uses the 12th Mersenne Prime ($2 ^ {127} - 1$) as the modulus. I'd like to share a 32 byte secret. Is it safe to simply change the modulus to p = $2 ^ {256} + 297$?...
- 113
1
vote
2
answers
69
views
How to redistribute shares for Distributed Shamir Secret Sharing?
I'm working on a Distributed Key Generation protocol. The idea is similar to this.
TLDR: Aggregated Shamir Secret Sharing, each participant acts as a dealer & distributed the secret shares of its ...
- 111
1
vote
0
answers
59
views
Understanding Garbled Circuit Design in Gazelle Protocol
I have been examining the Gazelle paper, which focuses on secure inference protocols. One section constructs a Garbled Circuit using inputs cx, sx, and sy to compute the ReLU function in neural ...
- 33
1
vote
0
answers
59
views
Impact of New Secret Sharing Paper with $O(n)$ additions for recovery
I hope this question is not too speculative.
Applebaum, Nir and Pinkas have a new paper which has an $n-$party secret sharing scheme with:
reconstruction complexity of $O(n)$ additions
constant share ...
- 21.2k
0
votes
0
answers
64
views
How can I have a message signed by other shares of a private key without revealing it?
I am looking for guidance on implementing a protocol where a BLS private key is split into 2 out of 3 shares using Shamir's Secret Sharing, and signatures must be obtained without revealing the ...
- 225
0
votes
1
answer
78
views
Wrong verification with Pedersen verifiable secret sharing
According to section 4.2 of Pedersen's verifiable secret sharing, given a secret share $(s_i, t_i)$, it is possible to verify that the secret share is valid by using the commitments $E_j$, for $j=0,\...
- 103
0
votes
1
answer
59
views
How to calculate inverse of an element using MPC and secret sharing
Suppose we have multiple parties ${P_i}$ each holding a secret share $(y_i,k_i)$ of the secret $(y,k)$. How can we calculate the inverse value $(y+k)^{-1}$ using multiparty computation such that these ...
1
vote
0
answers
39
views
What are the software tools used for customizing secret sharing and network steganography, which can be used for enhancing secret data transmission? [closed]
My goal is to enhance by bringing some changes to these techniques and schemes so that any improvements can be brought to them. So I tried to find some of the tools and came up with these:
Secret ...
- 11
3
votes
1
answer
183
views
Reference for basic secret sharing and MPC arithmetic algorithms
I am looking for references for the most basic secret sharing and MPC arithmetic algorithms for generic rings or prime fields.
Problem:
Suppose there are $m$ parties $P_1, \ldots, P_m$ which wish to ...
- 133
1
vote
0
answers
82
views
Feldman Verifiable secret sharing verify [closed]
I recently started to learn about Shamir secret sharing and Feldman's VSS Scheme.
I know the concepts But I can't figure out how it works. mostly because many of modulates are with "p" and ...
- 83
1
vote
2
answers
95
views
Why does Shamir secret sharing appear to need ordered shares?
The implementation of Shamir secret sharing in this code, only generates the original image if the shares are provided in consecutive order (ex: [2,3,4]) and won't work in any other share order (ex: [...
- 111
0
votes
1
answer
43
views
recovering the original secret of secret sharing [closed]
What is the specific process of recovering the original secret of secret sharing? Is the parties with secret shares communicating with each other and exchanging secret shares, and if the number of ...
- 41
5
votes
2
answers
2k
views
Is there a way to calculate a hash with two people so that no one knows the pre-image but if they get together they do?
I'm trying to find a way to have multi party hash computation, more specifically for SHA256. I want for two people to be able to compute a hash so that none of them knows the pre-image but when they ...
- 140
2
votes
1
answer
62
views
Lagrange interpolation in the exponent
I am going over the paper https://verifiable-timed-signatures.github.io/web/assets/paper.pdf and on page 5, it says the following:
Suppose I have a t-out-of-n threshold sharing scheme for the secret $\...
- 45
1
vote
0
answers
72
views
Communication through shared seed in RNG
Given that there are two parties, and a process has been conducted by which both parties are knowledgeable of a shared value p, how could two parties communicate with each other over a public channel ...
- 45
2
votes
0
answers
25
views
Why zero sharings are used to mask secret value to the masked value appears to be a random value?
Some interpretations say "By masking a secret value with a uniformly random zero sharing, the masked value appears to be a random value drawn from a uniform distribution. This randomness helps ...
- 21
3
votes
3
answers
562
views
Reference implementation of Shamir's Secret Sharing
Is there an implementation of Shamir's Secret Sharing that can be regarded as a "canonical" (or "reference" or "standard") implementation, so that I can test other ...
- 133
3
votes
1
answer
125
views
Garbled circuit and secret sharing
Recently, I was reading the paper One Hot Garbling published on CCS 2021. I noticed a sentence in it:
In this work, we forgo the standard GC notation of garbled labels in
favor of garbled sharings of ...
- 112
1
vote
1
answer
119
views
Question about Secure Multi-Party Computation
I am doing research about Non-interactive Secure Multi-party Computation and encounter a dilemma that I am not quite sure if it is possible and wonder if there are better thoughts that could help.
...
- 13
3
votes
1
answer
712
views
Solving Shamir secret sharing schemes
I have been working through the introduction to cryptography with coding theory book and have just come across Shamir secret sharing questions. However I just don't quite think I'm understanding it ...
- 41
1
vote
1
answer
38
views
Symmetry shares
I’m sorry if this is already answered, however, regarding symmetric key components to create a symmetric key using xor
(So eg comp1 xor comp2 xor comp3 = key)
If in the case of an AES KEY, which goes ...
- 11
2
votes
1
answer
90
views
Multi party authentication or encryption
I rent a room in a building. There are also 9 others who rent other rooms in this building. Just like everyone else who rents a room I only have one key of this building.
With my key I can open the ...
- 123
0
votes
1
answer
45
views
SMCQL practical examples
I am looking for some practical examples on how to use SMCQL on some typical SQL queries. The paper seems to be oriented more towards theory. Can somebody point me to some examples to understand it ...
- 181
1
vote
1
answer
521
views
What is the flaw of secret sharing?
What is the flaw of secret sharing? It seems that there is no mention in the literature of the defects of secret sharing, such as the defects of homomorphic encryption may be less efficient computing, ...
- 41
0
votes
1
answer
123
views
Conditional Boolean circuits
I have two questions I couldn't find straightforward answers to after many searches.
(1) We can perform 2-party MPC over arbitrary functions using Garbled Circuit. To do that, we first need to convert ...
- 103
1
vote
1
answer
73
views
Constructing a straight line from two points not working in integer modulo group
I have a pair of coordinates of which all values belong to $Z_{p}$ where $p$ is a prime. I want to construct a straight line that goes through those two coordinates. Then I want to generate two more ...
- 153