You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Sarah Jamie Lewis
||4 years ago|
|LICENSE||4 years ago|
|README.md||4 years ago|
|trostle-parrish.go||4 years ago|
|trostle-parrish_test.go||4 years ago|
Trostle-Parrish: A somewhat homomorphic cryptosystem
TrostleParrish implements a somewhat-homomorphic cryptosystem outlined by  and . Designed for efficient encryption in a PIR scheme.
Note that Trostle-Parrish has been broken  this library is for educational purposes only.
-  Trostle, Jonathan, and Andy Parrish. "Efficient computationally private information retrieval from anonymity or trapdoor groups." International Conference on Information Security. Springer, Berlin, Heidelberg, 2010.
-  Mayberry, Travis, Erik-Oliver Blass, and Agnes Hui Chan. "PIRMAP: Efficient private information retrieval for MapReduce." International Conference on Financial Cryptography and Data Security. Springer, Berlin, Heidelberg, 2013.
-  Lepoint, Tancrède, and Mehdi Tibouchi. "Cryptanalysis of a (somewhat) additively homomorphic encryption scheme used in pir." International Conference on Financial Cryptography and Data Security. Springer, Berlin, Heidelberg, 2015.