sarah
/
TrostleParrish
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
A somewhat-homomorphic (insecure) cryptosystem
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.
3 Commits
1 Branch
0 Tags
60 KiB
 
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'master'
${ noResults }
Go to file
Sarah Jamie Lewis 754bd814b6
Update 'README.md' 		4 years ago
LICENSE Initial Commit 4 years ago
README.md Update 'README.md' 4 years ago
trostle-parrish.go Initial Commit 4 years ago
trostle-parrish_test.go Initial Commit 4 years ago

README.md

Trostle-Parrish: A somewhat homomorphic cryptosystem

TrostleParrish implements a somewhat-homomorphic cryptosystem outlined by [1] and [2]. Designed for efficient encryption in a PIR scheme.

Note that Trostle-Parrish has been broken [3] this library is for educational purposes only.

  • [1] Trostle, Jonathan, and Andy Parrish. "Efficient computationally private information retrieval from anonymity or trapdoor groups." International Conference on Information Security. Springer, Berlin, Heidelberg, 2010.
  • [2] 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.
  • [3] 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.