Sciweavers

INNOVATIONS
2016
43views more  INNOVATIONS 2016»
10 years 29 days ago
Secure Multiparty Computation with General Interaction Patterns
abstract of this work published in ITCS 2016 We present a unified framework for studying secure multi-party computation (MPC) with arbitrarily restricted interaction patterns. Ou...
Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kush...
INNOVATIONS
2016
35views more  INNOVATIONS 2016»
10 years 29 days ago
Permanent v. Determinant: An Exponential Lower Bound Assuming Symmetry
We initiate a study of determinantal representations with symmetry. We show that Grenet’s determinantal representation for the permanent is optimal among determinantal representa...
Joseph M. Landsberg, Nicolas Ressayre
INNOVATIONS
2016
47views more  INNOVATIONS 2016»
10 years 29 days ago
Is There an Oblivious RAM Lower Bound?
An Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (JACM 1996), is a (probabilistic) RAM that hides its access pattern, i.e. for every input the observed locations acc...
Elette Boyle, Moni Naor
INNOVATIONS
2016
40views more  INNOVATIONS 2016»
10 years 29 days ago
Rational Proofs with Multiple Provers
Interactive proofs model a world where a verifier delegates computation to an untrustworthy prover, verifying the prover’s claims before accepting them. These proofs have appli...
Jing Chen, Samuel McCauley, Shikha Singh 0002
INNOVATIONS
2016
54views more  INNOVATIONS 2016»
10 years 29 days ago
Fully Succinct Garbled RAM
Ran Canetti, Justin Holmgren