Sciweavers

INNOVATIONS
2016
35views more  INNOVATIONS 2016»
8 years 15 days ago
Time-Lock Puzzles from Randomized Encodings
Nir Bitansky, Shafi Goldwasser, Abhishek Jain 0002...
INNOVATIONS
2016
40views more  INNOVATIONS 2016»
8 years 15 days ago
Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds
In this paper we motivate the study of Boolean dispersers for quadratic varieties by showing that an explicit construction of such objects gives improved circuit lower bounds. An ...
Alexander Golovnev, Alexander S. Kulikov
INNOVATIONS
2016
36views more  INNOVATIONS 2016»
8 years 15 days ago
How To Bootstrap Anonymous Communication
We ask whether it is possible to anonymously communicate a large amount of data using only public (non-anonymous) communication together with a small anonymous channel. We think th...
Sune K. Jakobsen, Claudio Orlandi
INNOVATIONS
2016
56views more  INNOVATIONS 2016»
8 years 15 days ago
How to Incentivize Data-Driven Collaboration Among Competing Parties
The availability of vast amounts of data is changing how we can make medical discoveries, predict global market trends, save energy, and develop new educational strategies. In cer...
Pablo Daniel Azar, Shafi Goldwasser, Sunoo Park
INNOVATIONS
2016
43views more  INNOVATIONS 2016»
8 years 15 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»
8 years 15 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»
8 years 15 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»
8 years 15 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»
8 years 15 days ago
Fully Succinct Garbled RAM
Ran Canetti, Justin Holmgren
INNOVATIONS
2016
55views more  INNOVATIONS 2016»
8 years 15 days ago
Auction Revenue in the General Spiteful-Utility Model
It is well accepted that, in some auctions, a player’s “true utility”may depend not only on the price he pays and whether or not he wins the good, but also on various forms ...
Jing Chen, Silvio Micali