Access.java 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327
  1. package protocols;
  2. import java.math.BigInteger;
  3. import java.util.Arrays;
  4. import org.apache.commons.lang3.ArrayUtils;
  5. import communication.Communication;
  6. import crypto.Crypto;
  7. import exceptions.AccessException;
  8. import exceptions.NoSuchPartyException;
  9. import oram.Bucket;
  10. import oram.Forest;
  11. import oram.Metadata;
  12. import oram.Tree;
  13. import oram.Tuple;
  14. import util.StopWatch;
  15. import util.Util;
  16. public class Access extends Protocol {
  17. private StopWatch step0;
  18. private StopWatch step1;
  19. private StopWatch step2;
  20. private StopWatch step3;
  21. private StopWatch step4;
  22. private StopWatch step5;
  23. public Access(Communication con1, Communication con2) {
  24. super(con1, con2);
  25. step0 = new StopWatch();
  26. step1 = new StopWatch();
  27. step2 = new StopWatch();
  28. step3 = new StopWatch();
  29. step4 = new StopWatch();
  30. step5 = new StopWatch();
  31. }
  32. public OutAccess runE(PreData predata, Tree OTi, byte[] Ni, byte[] Nip1_pr) {
  33. step0.start();
  34. // step 0: get Li from C
  35. byte[] Li = new byte[0];
  36. if (OTi.getTreeIndex() > 0)
  37. Li = con2.read();
  38. step0.stop();
  39. step1.start();
  40. // step 1
  41. Bucket[] pathBuckets = OTi.getBucketsOnPath(new BigInteger(1, Li).longValue());
  42. Tuple[] pathTuples = Bucket.bucketsToTuples(pathBuckets);
  43. for (int i = 0; i < pathTuples.length; i++)
  44. pathTuples[i].setXor(predata.access_p[i]);
  45. Object[] objArray = Util.permute(pathTuples, predata.access_sigma);
  46. pathTuples = Arrays.copyOf(objArray, objArray.length, Tuple[].class);
  47. step1.stop();
  48. step3.start();
  49. // step 3
  50. byte[] y = null;
  51. if (OTi.getTreeIndex() == 0)
  52. y = pathTuples[0].getA();
  53. else if (OTi.getTreeIndex() < OTi.getH() - 1)
  54. y = Util.nextBytes(OTi.getABytes(), Crypto.sr);
  55. else
  56. y = new byte[OTi.getABytes()];
  57. if (OTi.getTreeIndex() > 0) {
  58. byte[][] a = new byte[pathTuples.length][];
  59. byte[][] m = new byte[pathTuples.length][];
  60. for (int i = 0; i < pathTuples.length; i++) {
  61. m[i] = Util.xor(pathTuples[i].getA(), y);
  62. a[i] = ArrayUtils.addAll(pathTuples[i].getF(), pathTuples[i].getN());
  63. for (int j = 0; j < Ni.length; j++)
  64. a[i][a[i].length - 1 - j] ^= Ni[Ni.length - 1 - j];
  65. }
  66. SSCOT sscot = new SSCOT(con1, con2);
  67. sscot.runE(predata, m, a);
  68. }
  69. step3.stop();
  70. step4.start();
  71. // step 4
  72. if (OTi.getTreeIndex() < OTi.getH() - 1) {
  73. int ySegBytes = y.length / OTi.getTwoTauPow();
  74. byte[][] y_array = new byte[OTi.getTwoTauPow()][];
  75. for (int i = 0; i < OTi.getTwoTauPow(); i++)
  76. y_array[i] = Arrays.copyOfRange(y, i * ySegBytes, (i + 1) * ySegBytes);
  77. SSIOT ssiot = new SSIOT(con1, con2);
  78. ssiot.runE(predata, y_array, Nip1_pr);
  79. }
  80. step4.stop();
  81. step5.start();
  82. // step 5
  83. Tuple Ti = null;
  84. if (OTi.getTreeIndex() == 0)
  85. Ti = pathTuples[0];
  86. else
  87. Ti = new Tuple(new byte[0], Ni, Li, y);
  88. step5.stop();
  89. OutAccess outaccess = new OutAccess(null, null, null, Ti, pathTuples);
  90. return outaccess;
  91. }
  92. public void runD(PreData predata, Tree OTi, byte[] Ni, byte[] Nip1_pr) {
  93. step0.start();
  94. // step 0: get Li from C
  95. byte[] Li = new byte[0];
  96. if (OTi.getTreeIndex() > 0)
  97. Li = con2.read();
  98. step0.stop();
  99. step1.start();
  100. // step 1
  101. Bucket[] pathBuckets = OTi.getBucketsOnPath(new BigInteger(1, Li).longValue());
  102. Tuple[] pathTuples = Bucket.bucketsToTuples(pathBuckets);
  103. for (int i = 0; i < pathTuples.length; i++)
  104. pathTuples[i].setXor(predata.access_p[i]);
  105. Object[] objArray = Util.permute(pathTuples, predata.access_sigma);
  106. pathTuples = Arrays.copyOf(objArray, objArray.length, Tuple[].class);
  107. step1.stop();
  108. step2.start();
  109. // step 2
  110. con2.write(pathTuples);
  111. con2.write(Ni);
  112. step2.stop();
  113. step3.start();
  114. // step 3
  115. if (OTi.getTreeIndex() > 0) {
  116. byte[][] b = new byte[pathTuples.length][];
  117. for (int i = 0; i < pathTuples.length; i++) {
  118. b[i] = ArrayUtils.addAll(pathTuples[i].getF(), pathTuples[i].getN());
  119. b[i][0] ^= 1;
  120. for (int j = 0; j < Ni.length; j++)
  121. b[i][b[i].length - 1 - j] ^= Ni[Ni.length - 1 - j];
  122. }
  123. SSCOT sscot = new SSCOT(con1, con2);
  124. sscot.runD(predata, b);
  125. }
  126. step3.stop();
  127. step4.start();
  128. // step 4
  129. if (OTi.getTreeIndex() < OTi.getH() - 1) {
  130. SSIOT ssiot = new SSIOT(con1, con2);
  131. ssiot.runD(predata, Nip1_pr);
  132. }
  133. step4.stop();
  134. }
  135. public OutAccess runC(Metadata md, int treeIndex, byte[] Li) {
  136. step0.start();
  137. // step 0: send Li to E and D
  138. if (treeIndex > 0) {
  139. con1.write(Li);
  140. con2.write(Li);
  141. }
  142. step0.stop();
  143. step2.start();
  144. // step 2
  145. Tuple[] pathTuples = con2.readObject();
  146. byte[] Ni = con2.read();
  147. step2.stop();
  148. step3.start();
  149. // step 3
  150. int j1 = 0;
  151. byte[] z = null;
  152. if (treeIndex == 0) {
  153. z = pathTuples[0].getA();
  154. } else {
  155. SSCOT sscot = new SSCOT(con1, con2);
  156. OutSSCOT je = sscot.runC();
  157. j1 = je.t;
  158. byte[] d = pathTuples[j1].getA();
  159. z = Util.xor(je.m_t, d);
  160. }
  161. step3.stop();
  162. step4.start();
  163. // step 4
  164. int j2 = 0;
  165. byte[] Lip1 = null;
  166. if (treeIndex < md.getNumTrees() - 1) {
  167. SSIOT ssiot = new SSIOT(con1, con2);
  168. OutSSIOT jy = ssiot.runC();
  169. // step 5
  170. j2 = jy.t;
  171. int lSegBytes = md.getABytesOfTree(treeIndex) / md.getTwoTauPow();
  172. byte[] z_j2 = Arrays.copyOfRange(z, j2 * lSegBytes, (j2 + 1) * lSegBytes);
  173. Lip1 = Util.xor(jy.m_t, z_j2);
  174. }
  175. step4.stop();
  176. step5.start();
  177. Tuple Ti = null;
  178. if (treeIndex == 0) {
  179. Ti = pathTuples[0];
  180. } else {
  181. Ti = new Tuple(new byte[] { 1 }, Ni, new byte[md.getLBytesOfTree(treeIndex)], z);
  182. pathTuples[j1].getF()[0] = (byte) (1 - pathTuples[j1].getF()[0]);
  183. Crypto.sr.nextBytes(pathTuples[j1].getN());
  184. Crypto.sr.nextBytes(pathTuples[j1].getL());
  185. Crypto.sr.nextBytes(pathTuples[j1].getA());
  186. }
  187. step5.stop();
  188. OutAccess outaccess = new OutAccess(Lip1, Ti, pathTuples, null, null);
  189. return outaccess;
  190. }
  191. @Override
  192. public void run(Party party, Metadata md, Forest forest) {
  193. int records = 5;
  194. int repeat = 5;
  195. int tau = md.getTau();
  196. int numTrees = md.getNumTrees();
  197. long numInsert = md.getNumInsertRecords();
  198. int addrBits = md.getAddrBits();
  199. StopWatch stopwatch = new StopWatch();
  200. sanityCheck();
  201. System.out.println();
  202. for (int i = 0; i < records; i++) {
  203. long N = Util.nextLong(numInsert, Crypto.sr);
  204. for (int j = 0; j < repeat; j++) {
  205. System.out.println("Test: " + i + " " + j);
  206. System.out.println("N=" + BigInteger.valueOf(N).toString(2));
  207. byte[] Li = new byte[0];
  208. for (int ti = 0; ti < numTrees; ti++) {
  209. long Ni_value = Util.getSubBits(N, addrBits, addrBits - md.getNBitsOfTree(ti));
  210. long Nip1_pr_value = Util.getSubBits(N, addrBits - md.getNBitsOfTree(ti),
  211. Math.max(addrBits - md.getNBitsOfTree(ti) - tau, 0));
  212. byte[] Ni = Util.longToBytes(Ni_value, md.getNBytesOfTree(ti));
  213. byte[] Nip1_pr = Util.longToBytes(Nip1_pr_value, (tau + 7) / 8);
  214. PreData predata = new PreData();
  215. PreAccess preaccess = new PreAccess(con1, con2);
  216. if (party == Party.Eddie) {
  217. Tree OTi = forest.getTree(ti);
  218. int numTuples = (OTi.getD() - 1) * OTi.getW() + OTi.getStashSize();
  219. preaccess.runE(predata, OTi, numTuples);
  220. byte[] sE_Ni = Util.nextBytes(Ni.length, Crypto.sr);
  221. byte[] sD_Ni = Util.xor(Ni, sE_Ni);
  222. con1.write(sD_Ni);
  223. byte[] sE_Nip1_pr = Util.nextBytes(Nip1_pr.length, Crypto.sr);
  224. byte[] sD_Nip1_pr = Util.xor(Nip1_pr, sE_Nip1_pr);
  225. con1.write(sD_Nip1_pr);
  226. stopwatch.start();
  227. runE(predata, OTi, sE_Ni, sE_Nip1_pr);
  228. stopwatch.stop();
  229. if (ti == numTrees - 1)
  230. con2.write(N);
  231. } else if (party == Party.Debbie) {
  232. Tree OTi = forest.getTree(ti);
  233. preaccess.runD(predata);
  234. byte[] sD_Ni = con1.read();
  235. byte[] sD_Nip1_pr = con1.read();
  236. stopwatch.start();
  237. runD(predata, OTi, sD_Ni, sD_Nip1_pr);
  238. stopwatch.stop();
  239. } else if (party == Party.Charlie) {
  240. preaccess.runC();
  241. System.out.println("L" + ti + "=" + new BigInteger(1, Li).toString(2));
  242. stopwatch.start();
  243. OutAccess outaccess = runC(md, ti, Li);
  244. stopwatch.stop();
  245. Li = outaccess.C_Lip1;
  246. if (ti == numTrees - 1) {
  247. N = con1.readObject();
  248. long data = new BigInteger(1, outaccess.C_Ti.getA()).longValue();
  249. if (N == data) {
  250. System.out.println("Access passed");
  251. System.out.println();
  252. } else {
  253. throw new AccessException("Access failed");
  254. }
  255. }
  256. } else {
  257. throw new NoSuchPartyException(party + "");
  258. }
  259. }
  260. }
  261. }
  262. System.out.println(stopwatch.toMS());
  263. System.out.println("step0\n" + step0.toMS());
  264. System.out.println("step1\n" + step1.toMS());
  265. System.out.println("step2\n" + step2.toMS());
  266. System.out.println("step3\n" + step3.toMS());
  267. System.out.println("step4\n" + step4.toMS());
  268. System.out.println("step5\n" + step5.toMS());
  269. }
  270. }