Sciweavers

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. ...

Tore Kasper Frederiksen, Thomas P. Jakobsen, Jespe...

claim paper

Read More »

115

click to vote

TCC
2016
Springer

64views Cryptology» more TCC 2016»

Point-Function Obfuscation: A Framework and Generic Constructions

10 years 17 days ago

Download eprint.iacr.org

Mihir Bellare, Igors Stepanovs

claim paper

Read More »

111

Voted

TCC
2016
Springer

64views Cryptology» more TCC 2016»

Contention in Cryptoland: Obfuscation, Leakage and UCE

10 years 17 days ago

Download eprint.iacr.org

Mihir Bellare, Igors Stepanovs, Stefano Tessaro

claim paper

Read More »

124

Voted

TCC
2016
Springer

61views Cryptology» more TCC 2016»

Homomorphic Evaluation Requires Depth

10 years 17 days ago

Download eprint.iacr.org

We show that homomorphic evaluation of any non-trivial functionality of suﬃciently many inputs with respect to any CPA secure homomorphic encryption scheme cannot be implemented ...

Andrej Bogdanov, Chin Ho Lee

claim paper

Read More »

All Subjects

Algorithms

Applied Computing

Artificial Intelligence

Computational Geometry