Sciweavers

JOC
2016
67views more  JOC 2016»
8 years 13 days ago
Signature Schemes Secure Against Hard-to-Invert Leakage
Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen...
JOC
2016
49views more  JOC 2016»
8 years 13 days ago
Automata Evaluation and Text Search Protocols with Simulation-Based Security
ded abstract of this paper was published in the proceedings of PKC 2010. Automata Evaluation and Text Search Protocols with Simulation Based Security Rosario Gennaro∗ Carmit Haza...
Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen
JOC
2016
48views more  JOC 2016»
8 years 13 days ago
Fast Cryptography in Genus 2
In this paper we highlight the benefits of using genus 2 curves in public-key cryptography. Compared to the standardized genus 1 curves, or elliptic curves, arithmetic on genus 2 ...
Joppe W. Bos, Craig Costello, Hüseyin Hisil, ...
JOC
2016
48views more  JOC 2016»
8 years 13 days ago
Secret-Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
JOC
2016
62views more  JOC 2016»
8 years 13 days ago
Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries
In the setting of secure two-party computation, two parties wish to securely compute a joint function of their private inputs, while revealing only the output. One of the primary ...
Yehuda Lindell
JOC
2016
52views more  JOC 2016»
8 years 13 days ago
Limits on the Usefulness of Random Oracles
In the random oracle model, parties are given oracle access to a random function (i.e., a uniformly chosen function from the set of all functions), and are assumed to have unbound...
Iftach Haitner, Eran Omri, Hila Zarosim