sketch of JointFeldmanProtocol

DKG
tzlil.gon 2016-02-05 13:36:55 +02:00
parent 635165ef8e
commit 0a8d4abe72
3 changed files with 12 additions and 6 deletions

View File

@ -58,6 +58,13 @@ public class SecretSharing {
return new Polynomial.Point(BigInteger.valueOf(i), polynomial, q);
}
/**
* use for test only
*/
public Polynomial.Point getShareForTest(int i){
return getShare(i);
}
/**
* @param shares - subset of the original shares
*

View File

@ -33,12 +33,12 @@ public class SecretSharingTest {
secrets = new BigInteger[tests];
for (int i = 0; i < secretSharingArray.length; i++){
secrets[i] = group.sample(random);
secretSharingArray[i] = new SecretSharing(p,t,n,secrets[i],random);
secretSharingArray[i] = new SecretSharing(t,n,secrets[i],random,p);
}
}
public void oneTest(SecretSharing secretSharing, BigInteger secret) throws Exception {
int t = secretSharing.getThreshold();
int t = secretSharing.getT();
int n = secretSharing.getN();
Polynomial.Point[] shares = new Polynomial.Point[t + 1];
List<Integer> indexes = new ArrayList<Integer>(n);

View File

@ -20,7 +20,7 @@ public class VerifiableSecretSharingTest {
int tests = 1 << 10;
Random random;
@Before
//@Before
public void settings(){
BigInteger p = BigInteger.valueOf(2903);
BigInteger q = p.subtract(BigInteger.ONE).divide(BigInteger.valueOf(2));
@ -45,7 +45,7 @@ public class VerifiableSecretSharingTest {
BigInteger[] commitments = verifiableSecretSharing.getCommitments();
BigInteger[] verifications = new BigInteger[n];
for (int i = 1 ; i <= shares.length; i ++){
shares[i - 1] = verifiableSecretSharing.getShare(i);
shares[i - 1] = verifiableSecretSharing.getShareForTest(i);
verifications[i - 1] = VerifiableSecretSharing.verify(i,commitments,zpstar);
}
BigInteger expected;
@ -56,11 +56,10 @@ public class VerifiableSecretSharingTest {
}
@Test
//@Test
public void secretSharingTest() throws Exception {
for (int i = 0 ; i < verifiableSecretSharingArray.length; i ++){
oneTest(verifiableSecretSharingArray[i]);
}
}
}