Last update:
Tue Nov 6 17:10:34 MST 2018
Zvika Brakerski and
Guy N. Rothblum Virtual Black-Box Obfuscation for All
Circuits via Generic Graded Encoding . . 1--25
Boaz Barak and
Nir Bitansky and
Ran Canetti and
Yael Tauman Kalai and
Omer Paneth and
Amit Sahai Obfuscation for Evasive Functions . . . 26--51
Elette Boyle and
Kai-Min Chung and
Rafael Pass On Extractability Obfuscation . . . . . 52--73
Sanjam Garg and
Craig Gentry and
Shai Halevi and
Mariana Raykova Two-Round Secure MPC from
Indistinguishability Obfuscation . . . . 74--94
Takahiro Matsuda and
Goichiro Hanaoka Chosen Ciphertext Security via Point
Obfuscation . . . . . . . . . . . . . . 95--120
Yuval Ishai and
Mor Weiss Probabilistically Checkable Proofs of
Proximity with Zero-Knowledge . . . . . 121--145
Omkant Pandey Achieving Constant Round
Leakage-Resilient Zero-Knowledge . . . . 146--166
Claudio Orlandi and
Rafail Ostrovsky and
Vanishree Rao and
Amit Sahai and
Ivan Visconti Statistical Concurrent Non-malleable
Zero Knowledge . . . . . . . . . . . . . 167--191
Kai-Min Chung and
Rafail Ostrovsky and
Rafael Pass and
Muthuramakrishnan Venkitasubramaniam \textellipsis $4$-Round Resettably-Sound Zero
Knowledge . . . . . . . . . . . . . . . 192--216
Dana Dachman-Soled and
Mohammad Mahmoody and
Tal Malkin Can Optimally-Fair Coin Tossing Be Based
on One-Way Functions? . . . . . . . . . 217--239
Mohammad Mahmoody and
Hemanta K. Maji and
Manoj Prabhakaran On the Power of Public-Key Encryption in
Secure Computation . . . . . . . . . . . 240--264
Takahiro Matsuda On the Impossibility of Basing
Public-Coin One-Way Permutations on
Trapdoor Permutations . . . . . . . . . 265--290
Gilad Asharov Towards Characterizing Complete Fairness
in Secure Two-Party Computation . . . . 291--316
Amos Beimel and
Yuval Ishai and
Ranjit Kumaresan and
Eyal Kushilevitz On the Cryptographic Complexity of the
Worst Functions . . . . . . . . . . . . 317--342
Susumu Kiyoshima and
Yoshifumi Manabe and
Tatsuaki Okamoto Constant-Round Black-Box Construction of
Composable Multi-Party Computation
Protocol . . . . . . . . . . . . . . . . 343--367
Carmit Hazay and
Arpita Patra One-Sided Adaptively Secure Two-Party
Computation . . . . . . . . . . . . . . 368--393
Amos Beimel and
Aner Ben-Efraim and
Carles Padró and
Ilya Tyomkin Multi-linear Secret-Sharing Schemes . . 394--418
Martin Hirt and
Ueli Maurer and
Pavel Raykov Broadcast Amplification . . . . . . . . 419--439
Mahdi Cheraghchi and
Venkatesan Guruswami Non-malleable Coding against Bit-Wise
and Split-State Tampering . . . . . . . 440--464
Sebastian Faust and
Pratyay Mukherjee and
Jesper Buus Nielsen and
Daniele Venturi Continuous Non-malleable Codes . . . . . 465--488
Ange Albertini and
Jean-Philippe Aumasson and
Maria Eichlseder and
Florian Mendel and
Martin Schläffer Malicious Hashing: Eve's Variant of
SHA-1 . . . . . . . . . . . . . . . . . 1--19