Abstract is missing.
- Quantum Position Verification in the Random Oracle ModelDominique Unruh. 1-18 [doi]
- Single-Shot Security for One-Time Memories in the Isolated Qubits ModelYi-Kai Liu. 19-36 [doi]
- How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGsYevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs. 37-54 [doi]
- Cryptography with Streaming AlgorithmsPeriklis A. Papakonstantinou, Guang Yang. 55-70 [doi]
- The Impossibility of Obfuscation with Auxiliary Input or a Universal SimulatorNir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen. 71-89 [doi]
- Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its ApplicationsTakashi Yamakawa, Shota Yamada 0001, Goichiro Hanaoka, Noboru Kunihiro. 90-107 [doi]
- On Virtual Grey Box Obfuscation for General CircuitsNir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth. 108-125 [doi]
- 12 367)Robert Granger, Thorsten Kleinjung, Jens Zumbrägel. 126-145 [doi]
- Leakage-Tolerant Computation with Input-Independent PreprocessingNir Bitansky, Dana Dachman-Soled, Huijia Lin. 146-163 [doi]
- Interactive Proofs under Continual Memory LeakagePrabhanjan Ananth, Vipul Goyal, Omkant Pandey. 164-182 [doi]
- Amplifying Privacy in Privacy AmplificationDivesh Aggarwal, Yevgeniy Dodis, Zahra Jafargholi, Eric Miles, Leonid Reyzin. 183-198 [doi]
- On the Communication Complexity of Secure ComputationDeepesh Data, Manoj Prabhakaran, Vinod M. Prabhakaran. 199-216 [doi]
- Optimal Non-perfect Uniform Secret Sharing SchemesOriol Farràs, Torben Hansen, Tarik Kaced, Carles Padró. 217-234 [doi]
- Proving the TLS Handshake Secure (As It Is)Karthikeyan Bhargavan, Cédric Fournet, Markulf Kohlweiss, Alfredo Pironti, Pierre-Yves Strub, Santiago Zanella Béguelin. 235-255 [doi]
- Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile EnvironmentJan Camenisch, Anja Lehmann, Anna Lysyanskaya, Gregory Neven. 256-275 [doi]
- Scalable Zero Knowledge via Cycles of Elliptic CurvesEli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza. 276-294 [doi]
- Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear SubspacesCharanjit S. Jutla, Arnab Roy. 295-312 [doi]
- Physical Zero-Knowledge Proofs of Physical PropertiesBen Fisch, Daniel Freund, Moni Naor. 313-336 [doi]
- Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed ComplexityRan Canetti, Abhishek Jain 0002, Omer Paneth. 337-350 [doi]
- Round-Efficient Black-Box Construction of Composable Multi-Party ComputationSusumu Kiyoshima. 351-368 [doi]
- Secure Multi-Party Computation with Identifiable AbortYuval Ishai, Rafail Ostrovsky, Vassilis Zikas. 369-386 [doi]
- Non-Interactive Secure Multiparty ComputationAmos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky. 387-404 [doi]
- Feasibility and Infeasibility of Secure Computation with Malicious PUFsDana Dachman-Soled, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, Dominique Schröder. 405-420 [doi]
- How to Use Bitcoin to Design Fair ProtocolsIddo Bentov, Ranjit Kumaresan. 421-439 [doi]
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XORVladimir Kolesnikov, Payman Mohassel, Mike Rosulek. 440-457 [doi]
- Amortizing Garbled CircuitsYan Huang, Jonathan Katz, Vladimir Kolesnikov, Ranjit Kumaresan, Alex J. Malozemoff. 458-475 [doi]
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch SettingsYehuda Lindell, Ben Riva. 476-494 [doi]
- Dishonest Majority Multi-Party Computation for Binary CircuitsEnrique Larraia, Emmanuela Orsini, Nigel P. Smart. 495-512 [doi]
- Efficient Three-Party Computation from Cut-and-ChooseSeung Geol Choi, Jonathan Katz, Alex J. Malozemoff, Vassilis Zikas. 513-530 [doi]