119
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
We present a new constant round additively homomorphic commitment scheme with (amortized) computational and communication complexity linear in the size of the string committed to. ...
122
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
We provide constructions of multilinear groups equipped with natural hard problems from indistinguishability obfuscation, homomorphic encryption, and NIZKs. This complements known...
101
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
An order-revealing encryption scheme gives a public procedure by which two ciphertexts can be compared to reveal the ordering of their underlying plaintexts. We show how to use or...