sharing 0.1.1 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 5c3ca365fc28e5bd00b60ddae38c473e7cc4fab0bd82601634380e58d823c966
-  data.tar.gz: 839ded7393e627ae15fefcd4be3bb05d797ccc0b7a61af54e73232a57f594cdf
+  metadata.gz: b091eefc1c0e4656e732cfdbc983177df829e0c646467227871bf2a3dfc18203
+  data.tar.gz: 493c97755883f09df9fd19b9e9f9dcb09f4a15756cd22401bce780e4b574123c
 SHA512:
-  metadata.gz: 75cc42e29de49f5a9391f021753869398b42bcdfd87204de288a37c27f85be3da0883772b9e2722847c78f870bad47558e37f6eff2c24d3f1f41bdeff4c2d44b
-  data.tar.gz: 0b399903a1837bdee94707f7317b214b60339ab96b2d3684e62a7be04d93d5882d1b2e7ba238f8bb2146c73663c905e8ad69d667ceb353200cbcfd054154d473
+  metadata.gz: 6405b3a080f2a669b1f0882d9baec0e29c7ffaa93cafb5738a1636fdf58f596129c7a8436470dfbb4fd059e78b15b9b060a557bfb789e1316dbf1605b031545b
+  data.tar.gz: 5a8096e9f83b122550d62cd97417b928bd37d64a5902c857a7d7c7f515ddb97264ab1b87cbde0590e9e7bdcda3acdb4c95a75cdaab0fb0bb9bad120f91373e6a

data/CHANGELOG.md

@@ -1,3 +1,7 @@
+## [0.2.0] - 2022-03-25
+
+- Add multiplication to Shamir's secret sharing implementation and overall improvements.
+
 ## [0.1.1] - 2022-03-25
 
 - Fix threshold setting on Shamir's scheme v1

data/Gemfile

@@ -4,13 +4,9 @@ ruby ">= 2.6.0"
 
 source "https://rubygems.org"
 
-# Specify your gem's dependencies in secret_sharing.gemspec
+# Specify your gem"s dependencies in sharing.gemspec
 gemspec
 
-gem "hensel_code", "~> 0.3.1"
-
-gem "prime", "~> 0.1.2"
-
 gem "rake", "~> 13.0"
 
 gem "minitest", "~> 5.0"
@@ -23,4 +19,8 @@ gem "rubocop-rake", "~> 0.6"
 
 gem "minitest-reporters", "~> 1.5"
 
-gem "codecov", require: false, group: :test
+gem "simplecov", "~>0.21", require: false
+
+gem "simplecov-console", "~>0.9", require: false
+
+gem "codecov", require: false, group: "test"

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    sharing (0.1.0)
+    sharing (0.2.0)
       hensel_code (~> 0.3.1)
       prime (~> 0.1.2)
 
@@ -55,25 +55,32 @@ GEM
       docile (~> 1.1)
       simplecov-html (~> 0.11)
       simplecov_json_formatter (~> 0.1)
+    simplecov-console (0.9.1)
+      ansi
+      simplecov
+      terminal-table
     simplecov-html (0.12.3)
     simplecov_json_formatter (0.1.4)
     singleton (0.1.1)
+    terminal-table (3.0.2)
+      unicode-display_width (>= 1.1.1, < 3)
     unicode-display_width (2.1.0)
 
 PLATFORMS
   x86_64-darwin-19
+  x86_64-linux
 
 DEPENDENCIES
   codecov
-  hensel_code (~> 0.3.1)
   minitest (~> 5.0)
   minitest-reporters (~> 1.5)
-  prime (~> 0.1.2)
   rake (~> 13.0)
   rubocop (~> 1.21)
   rubocop-minitest (~> 0.17.2)
   rubocop-rake (~> 0.6)
   sharing!
+  simplecov (~> 0.21)
+  simplecov-console (~> 0.9)
 
 RUBY VERSION
    ruby 3.1.0p0

data/README.md

@@ -1,6 +1,10 @@
 # Sharing
 
-A secret sharing Ruby library.
+![GitHub Workflow Status](https://img.shields.io/github/workflow/status/davidwilliam/sharing/Ruby)
+
+Sharing is a Ruby gem with implmementations of secret sharing schemes with homomorphic properties. Although secret sharing schemes and multiparty computation protocols are distinct notions, multiparty computation protocols are typically enabled by secret sharing schemes. In this setting, security comes from the use of multiple parties. If they collude, all security is lost, but satisfactory levels of security can be established by trusting a subset of them will not to collude. In many settings where corrupting security requires corrupting all the parties, and considering you are one of the computing parties, security  is guaranteed if you are one of the parties.
+
+Computing linear functions is trivial. Each non-linear operation however requires interaction between the parties/extra steps (for most secret sharing schemes).
 
 ## Installation
 
@@ -27,6 +31,13 @@ Secret Sharing currently supports two schemes:
 
 # Usage
 
+In the examples below, there are two main levels of execution:
+
+- Computations performed by the owner of the secrets (those are computations using instance methods)
+- Computations performed over the secret shares (those are computations using class methods)
+
+This distiction is important since we are showing everything at once here, for completeness and for clarity. However it is important to keep in mind that after the secret shares are generated, the computations over the shares are intended to be computed independetly by each participant (party), each one with their corresponding shares.
+
 ## Shamir's Secret Sharing V1
 
 The Shamir's secret sharing v1 scheme is based on the work of Adi Shamir in [How to Share a Secret](https://web.mit.edu/6.857/OldStuff/Fall03/ref/Shamir-HowToShareASecret.pdf).
@@ -58,9 +69,9 @@ We reconstruct the secrets as follows:
 
 ```ruby
 reconstructed_secret1 = sss.reconstruct_secret(shares1)
-# => (22/1)
+# => 22
 reconstructed_secret2 = sss.reconstruct_secret(shares2)
-# => (36/1)
+# => 36
 ```
 
 We can compute linear functions without requiring communication between the share holders: 
@@ -80,18 +91,18 @@ and we can check that:
 
 ```ruby
 sss.reconstruct_secret(shares1_add_shares2)
-# => (58/1)
+# => 58
 sss.reconstruct_secret(shares2_sub_shares1)
-# => (14/1)
+# => 14
 sss.reconstruct_secret(shares1_smul_scalar)
-# => (44/1)
+# => 44
 sss.reconstruct_secret(shares1_sdiv_scalar)
-# => (11/1)
+# => 11
 ```
 
 ### Using Hensel Codes
 
-The gem Secret Sharing takes advantage of the gem [Hensel Codes](https://github.com/davidwilliam/hensel_code) for homomorphically encoding rational numbers as integers in order to compute over the integers and yet obtain results over the rationals.
+The gem Secret Sharing takes advantage of the gem [Hensel Code](https://github.com/davidwilliam/hensel_code) for homomorphically encoding rational numbers as integers in order to compute over the integers and yet obtain results over the rationals.
 
 As most (if not all) of secret sharing schemes over finite fields `F_p` for `p > 2`, the secret inputs are naturally required to be positive integers in `F_p`. In this way, if we compute subtraction and we end up with a result that is negative, the reconstruction will fail (provided we don't have any econding in place). Same will occur if we compute a scalar division involving a scalar that is not a divisor of the corresponding secret. For addressing this and many other arithmetic problems, we can use Hensel codes to allow secret inputs to be positive and negative rational numbers.
 
@@ -143,13 +154,13 @@ We reconstruct the secrets:
 
 ```ruby
 reconstruct_secret1_add_secret2 = sss.reconstruct_secret(shares1_add_shares2)
-# => 3361138990/1
+# => 3361138990
 reconstruct_secret1_sub_secret2 = sss.reconstruct_secret(shares1_sub_shares2)
-# => 2174854642/1
+# => 2174854642
 reconstruct_shares1_smul_scalar = sss.reconstruct_secret(shares1_smul_scalar)
-# => 1383998411/1
+# => 1383998411
 reconstruct_shares1_sdiv_scalar = sss.reconstruct_secret(shares1_sdiv_scalar)
-# => 3044796497/1
+# => 3044796497
 ```
 
 and we can check that:
@@ -165,6 +176,94 @@ HenselCode::TruncatedFinitePadicExpansion.new(sss.p, 1, reconstructed_shares1_sd
 # => 2/15
 ```
 
+### Multiplication
+
+As we previously saw, linear functions are easy to compute with shares created by an instance of Shamir's secret sharing scheme. Non-linear functions need some strategy that require extra steps in other to successfuly achieve the desired results. We implement multiplication in the context of Shamir's secret sharing scheme following the approach discussed by Dan Bognadov in [Foundations and properties of Shamir's secret sharing scheme - Research Seminar in Cryptography](https://uuslepo.it.da.ut.ee/~peeter_l/teaching/seminar07k/bogdanov.pdf).
+
+We define an instance of Shamir's secret sharing scheme with the following parameters:
+
+```ruby
+params = { lambda_: 16, total_shares: 6, threshold: 3 }
+# => {:lambda_=>16, :total_shares=>6, :threshold=>3}
+sss = Sharing::Polynomial::Shamir::V1.new params
+# => #<Sharing::Polynomial::Shamir::V1:0x0000000105423640 @lambda_=16, @p=49367, @threshold=3, @total_shares=6>
+```
+
+As before, we define the secrets and create shares for them:
+
+```ruby
+secret1 = 13
+secret2 = 28
+shares1 = sss.create_shares(secret1)
+# => [[1, 43064], [2, 20333], [3, 30554], [4, 24360], [5, 1751], [6, 12094]]
+shares2 = sss.create_shares(secret2)
+# => [[1, 7983], [2, 18517], [3, 31630], [4, 47322], [5, 16226], [6, 37076]]
+``` 
+
+We combine both shares on a single array in preparation for the multiplication steps:
+
+```ruby
+operands_shares = [shares1, shares2]
+# => [[[1, 43064], [2, 20333], [3, 30554], [4, 24360], [5, 1751], [6, 12094]], [[1, 7983], [2, 18517], [3, 31630], [4, 47322], [5, 16226], [6, 37076]]]
+```
+
+Recall we are working with a t-out-of-n secret sharing scheme and this is actually required in this setting. We have a total of `n = 6` shares and threshold `t = 3`. In order to correctly recover the result of the multiplication over shares, we need to select any combination of `2 * t - 1` shares out of the total number of shares:
+
+```ruby
+selected_shares = Sharing::Polynomial::Shamir::V1.select_mul_shares(sss.total_shares, sss.threshold, operands_shares)
+# => => [[[2, 20333], [1, 43064], [5, 1751], [3, 30554], [4, 24360]], [[2, 18517], [1, 7983], [5, 16226], [3, 31630], [4, 47322]]]
+```
+
+Now we have everything we need to compute multiplication over the secret shares, which we do in two rounds. First round:
+
+```ruby
+mul_round1 = Sharing::Polynomial::Shamir::V1.mul_first_round(selected_shares, sss.total_shares, sss.threshold, sss.lambda_, sss.p)
+# => [[2, [[1, 25284], [2, 5881], [3, 2537], [4, 15252], [5, 44026], [6, 39492]]], [1, [[1, 36061], [2, 17299], [3, 32435], [4, 32102], [5, 16300], [6, 34396]]], [5, [[1, 30221], [2, 32724], [3, 33210], [4, 31679], [5, 28131], [6, 22566]]], [3, [[1, 46172], [2, 33017], [3, 8081], [4, 20731], [5, 21600], [6, 10688]]], [4, [[1, 12410], [2, 39133], [3, 5920], [4, 11505], [5, 6521], [6, 40335]]]]
+```
+
+Then we perform the second round:
+
+```ruby
+mul_round2 = Sharing::Polynomial::Shamir::V1.mul_second_round(mul_round1)
+# => [[1, 150148], [2, 128054], [3, 82183], [4, 111269], [5, 116578], [6, 147477]]
+```
+
+Then we only need a number equal to the threshold to reconstruct the result of the multipliction over the shares:
+
+```ruby
+selected_multiplication_shares = mul_round2.sample(sss.threshold)
+# => [[6, 147477], [2, 128054], [1, 150148]
+sss.reconstruct_secret(selected_multiplication_shares)
+# => 364
+```
+
+and we can check that
+
+```ruby
+secret1 * secret2
+# => 364
+```
+
+### t-out-of-n Secret Sharing
+
+Now we defined a threshold value that is less than the total number of shares:
+
+```ruby
+params = {total_shares: 5, threshold: 3, lambda_: 16}
+# => {:total_shares=>5, :threshold=>3, :lambda_=>16}
+sss = Sharing::Polynomial::Shamir::V1.new params
+# => #<Sharing::Polynomial::Shamir::V1:0x000000010b046e90 @lambda_=16, @p=61343, @threshold=3, @total_shares=5>
+secret = 25
+# => 25
+shares = sss.create_shares(secret)
+# => [[1, 54707], [2, 50401], [3, 48450], [4, 48854], [5, 51613]]
+selected_shares = shares.sample(3)
+reconstructed_secret = sss.reconstruct_secret(selected_shares)
+# => 25
+```
+
+Everything else works the sabe as before except the fact that only `3` shares are required to reconstruct the secret.
+
 ## Asmuth-Bloom V2
 
 The Asmuth-Bloom V2 was proposed by Ersoy et al. in in [Homomorphic extensions of CRT-based secret sharing](https://www.sciencedirect.com/science/article/pii/S0166218X20303012)). The reference is a CRT-based secret sharing scheme introduced by Asmuth-Bloom in [A modular approach to key safeguarding](https://ieeexplore.ieee.org/abstract/document/1056651).
@@ -239,4 +338,4 @@ Bug reports and pull requests are welcome on GitHub at https://github.com/davidw
 
 ## License
 
-The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).

data/lib/sharing/polynomial/shamir/v1.rb

@@ -28,12 +28,44 @@ module Sharing
           shares.map { |s| [s[0], (s[1] * mod_inverse(scalar, prime)) % prime] }
         end
 
+        def self.mul_first_round(shares, total_shares, threshold, lambda_, prime)
+          shares1, shares2 = shares
+          xs = shares1.map(&:first)
+          shares1.zip(shares2).map.with_index do |s, i|
+            share = prepare_share_for_multiplication(i, xs, prime, s)
+            reshares = create_shares(share, total_shares, threshold, lambda_, prime)
+            encode_reshares(reshares, prime, s)
+          end
+        end
+
+        def self.encode_reshares(reshares, prime, s_pair)
+          reshares_encoded = reshares.map do |ss|
+            [ss[0], (ss[1].numerator * mod_inverse(ss[1].denominator, prime)) % prime]
+          end
+          [s_pair[0][0], reshares_encoded]
+        end
+
+        def self.prepare_share_for_multiplication(index, xs_, prime, s_pair)
+          beta = lagrange_basis_polynomial_inner_loop(index, xs_)
+          (s_pair[0][1] * s_pair[1][1] * beta) % prime
+        end
+
+        def self.mul_second_round(mul_round1)
+          multiplication_shares = mul_round1.map(&:last).map { |m| m.map(&:last) }.transpose.map(&:sum)
+          multiplication_shares.map.with_index { |m, i| [i + 1, m] }
+        end
+
+        def self.select_mul_shares(total_shares, threshold, shares)
+          indices = (0..total_shares - 1).to_a.sample((2 * threshold) - 1)
+          shares.map { |shares_| shares_.values_at(*indices) }
+        end
+
         def self.generate_random_coefficients(total_shares, lambda_)
           random_distinct_numbers("integer", total_shares - 1, lambda_ - 1)
         end
 
-        def self.create_shares(secret, total_shares, lambda_, prime)
-          random_coefficients = generate_random_coefficients(total_shares, lambda_)
+        def self.create_shares(secret, total_shares, threshold, lambda_, prime)
+          random_coefficients = generate_random_coefficients(threshold, lambda_)
           (1..total_shares).map.with_index { |x, i| [i + 1, f(x, secret, random_coefficients) % prime] }
         end
 
@@ -44,6 +76,10 @@ module Sharing
           generate_prime
         end
 
+        def params
+          [lambda_, p, total_shares, threshold]
+        end
+
         def create_shares(secret)
           random_coefficients = generate_random_coefficients
           (1..total_shares).map { |x| [x, f(x, secret, random_coefficients) % p] }

data/lib/sharing/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module Sharing
-  VERSION = "0.1.1"
+  VERSION = "0.2.0"
 end

data/sig/secret_sharing.rbs

@@ -1,4 +1,4 @@
-module SecretSharing
+module Sharing
   VERSION: String
   # See the writing guide of rbs: https://github.com/ruby/rbs#guides
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: sharing
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.2.0
 platform: ruby
 authors:
 - David William Silva
@@ -54,6 +54,7 @@ files:
 - Rakefile
 - bin/console
 - bin/setup
+- codecov
 - lib/sharing.rb
 - lib/sharing/crt/asmuth-bloom/v2.rb
 - lib/sharing/polynomial/shamir/v1.rb