rsa-accumulator 0.1.0 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 6b5bb2ad698c4440d30bdbd29b3be321a3829b78bad6e188d06b351e8d81f337
-  data.tar.gz: e9270d41f253c25b4f2a44ca51d4fd03bc8ff323a173b8fff845ba5c8af5ef3c
+  metadata.gz: 9f38593cbe657293995ebc98f360b248664b552acaf748201f5fa5d4bf27d6aa
+  data.tar.gz: b6d45c16e546ba04b788c41b9426943266cd5bff76b848f1f6fb5eac1e8ad193
 SHA512:
-  metadata.gz: 3bf39ed19c73847ec804b63032d940e55595f38f6b3e4abce3aba7bceb7524f06bc7a7b015264309e4b2c0123b22c999a110d08bb5982a16790deee658b00bc7
-  data.tar.gz: b91fac654230b7f9e5837eb4249881f71e915e3f7911dd63e7bf4065ce8b7daa50bdd8beb0c3ff59283b39ff73972afec66bb4558824ac75918e0b43c1580761
+  metadata.gz: 4b43ce23e5961c58adfab5a752a599117a2d13733fdbdab01f2cf608df8a2a99e949edee002e140dcaa3ab94664793b877420c9c9bdc14faa400e6aa6ab9f94f
+  data.tar.gz: 24d9067f9931519c80159879ef4d5d0b125807d197c0ea3985e6f7ff8b0321915fa61e14463378856b8683f16d973a49d292d858b8cc332e51d89955bff82eb7

data/README.md

@@ -65,4 +65,16 @@ You can remove elements from the accumulator by providing the inclusion proof.
     
     acc.member?(proof)
     => false
+    
+### Holding the product of all elements
+
+This feature is experimental and has not been checked against large amounts of data.
+
+    acc = RSA::Accumulator.generate_rsa2048(hold_elements: true)
+    acc.add('a', 'b', 'c')
+    acc.add('d', 'e')
+    
+    # acc has product of all elements in acc#products, so you can get membership proof.
+    proof = acc.prove_membership('b')
+
     

data/lib/rsa/acc/version.rb

@@ -1,5 +1,5 @@
 module RSA
   module ACC
-    VERSION = "0.1.0"
+    VERSION = "0.2.0"
   end
 end

data/lib/rsa/accumulator.rb

@@ -16,30 +16,36 @@ module RSA
 
     attr_reader :n
     attr_accessor :value
-    attr_reader :g        # Initial value
+    attr_reader :g              # Initial value
+    attr_reader :hold_elements  # tha flag which indicate hold product of all elements.
+    attr_accessor :products     # (Optional) product of all elements in Accumulator
 
     # Generate accumulator using RSA2048 modulus.
     # @return [RSA::Accumulator]
-    def self.generate_rsa2048
-      new(RSA2048_MODULUS, RSA2048_UNKNOWN_ELEM)
+    def self.generate_rsa2048(hold_elements: false)
+      new(RSA2048_MODULUS, RSA2048_UNKNOWN_ELEM, hold_elements)
     end
 
     # Generate accumulator with random modulus.
     # @param [Integer] bit_length bit length of accumulator. Default: 3072 bits.
     # @return [RSA::Accumulator]
-    def self.generate_random(bit_length = 3072)
+    def self.generate_random(bit_length = 3072, hold_elements: false)
       n = OpenSSL::PKey::RSA.generate(bit_length).n.to_i
-      new(n, SecureRandom.random_number(n))
+      new(n, SecureRandom.random_number(n), hold_elements)
     end
 
     # Initialize accumulator
     # @param [Integer] n modulus
     # @param [Integer] value initial value
+    # @param [Boolean] hold_elements
     # @return [RSA::Accumulator]
-    def initialize(n, value)
+    def initialize(n, value, hold_elements)
       @n = n
       @value = value
       @g = value
+      @hold_elements = hold_elements
+      @products = 1 if hold_elements
+      puts "The feature which hold product of all elements is practical feature." if hold_elements
     end
 
     # Add element to accumulator and get inclusion proof.
@@ -48,7 +54,13 @@ module RSA
     def add(*elements)
       current_acc = value
       p = elements_to_prime(elements)
-      @value = value.pow(p, n)
+      self.value = value.pow(p, n)
+      if hold_elements
+        elements.each do |e|
+          p = hash_to_prime(e)
+          self.products *= p unless products.modulo(p) == 0
+        end
+      end
       RSA::ACC::MembershipProof.new(elements, current_acc, value, RSA::ACC::PoE.prove(current_acc, p, value, n))
     end
 
@@ -77,6 +89,19 @@ module RSA
           RSA::ACC::PoE.verify(proof.d, x, proof.gv_inv, proof.poe_proof, n)
     end
 
+    # Generate membership proof for +elements+.
+    # This method is only available if hold_elements is set to true when the accumulator is initialized.
+    # @param [Array[String]] elements The elements for which you want to generate an membership proof.
+    # @return [RSA::ACC::MembershipProof] a membership proof for +elements+. If +elements+ does not exist in accumulator, return nil.
+    # @raise RSA::ACC::Error.new This exception is raised when hold_elements is set to false.
+    def prove_membership(*elements)
+      raise RSA::ACC::Error.new 'This accumulator does not hold the product of the elements.' unless hold_elements
+      x = elements_to_prime(elements)
+      return nil unless products.modulo(x) == 0
+      witness = g.pow(products / x, n)
+      RSA::ACC::MembershipProof.new(elements, witness, value, RSA::ACC::PoE.prove(witness, x, value, n))
+    end
+
     # Generate non-membership proof using set of elements in current acc and non membership elements.
     # @param [Array[String]] members The entire set of elements contained within this accumulator.
     # @param [Array[String]] non_members Elements not included in this accumulator that you want to prove non-membership.
@@ -119,8 +144,8 @@ module RSA
           proof_product *= w[0]
         end
       end
-
-      @value = new_value
+      self.products = self.products / proof_product if hold_elements
+      self.value = new_value
       RSA::ACC::MembershipProof.new(proofs.map{|p|p.element}.flatten, value, current_value, RSA::ACC::PoE.prove(value, proof_product, current_value, n))
     end
 
@@ -130,8 +155,8 @@ module RSA
     def root_factor(*f)
       return [value] if f.size == 1
       half_n = f.size / 2
-      g_l = RSA::Accumulator.new(n, value.pow(f[0...half_n].map.inject(:*), n))
-      g_r = RSA::Accumulator.new(n, value.pow(f[half_n..-1].map.inject(:*), n))
+      g_l = RSA::Accumulator.new(n, value.pow(f[0...half_n].map.inject(:*), n), false)
+      g_r = RSA::Accumulator.new(n, value.pow(f[half_n..-1].map.inject(:*), n), false)
       l = g_r.root_factor(*f[0...half_n])
       r = g_l.root_factor(*f[half_n..-1])
       [l, r].flatten

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rsa-accumulator
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.2.0
 platform: ruby
 authors:
 - azuchi
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2020-06-23 00:00:00.000000000 Z
+date: 2020-07-14 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rbnacl
@@ -94,7 +94,7 @@ files:
 - lib/rsa/acc/proof.rb
 - lib/rsa/acc/version.rb
 - lib/rsa/accumulator.rb
-- rsa-accumulatorrb.gemspec
+- rsa-accumulator.gemspec
 homepage: https://github.com/chaintope/rsa-accumulatorrb
 licenses:
 - MIT