Advances_in_Cryptology_-_EUROCRYPT_2016_Part_II

相似文件 换一批

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

Advances_in_Cryptology_-_EUROCRYPT_2016_35th_Annual_International_Conference_Part_II.pdf (19.37 MB, 需要: 10 个论坛币)

2018-6-30 16:12:35 上传

需要: 10 个论坛币  [购买]

The two-volume proceedings LNCS 9665 + 9666 constitutes the thoroughly refereed proceedings of the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2016, held in Vienna, Austria, in May 2016. The 62 full papers included in these volumes were carefully reviewed and selected from 274 submissions. The papers are organized in topical sections named: (pseudo)randomness; LPN/LWE; cryptanalysis; masking; fully homomorphic encryption; number theory; hash functions; multilinear maps; message authentification codes; attacks on SSL/TLS; real-world protocols; robust designs; lattice reduction; latticed-based schemes; zero-knowledge; pseudorandom functions; multi-party computation; separations; protocols; round complexity; commitments; lattices; leakage; in differentiability; obfuscation; and automated analysis, functional encryption, and non-malleable codes.

Contents – Part II

Lattice-Based Schemes

Zero-Knowledge Arguments for Lattice-Based Accumulators:

Logarithmic-Size Ring Signatures and Group Signatures

Without Trapdoors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

Benoît Libert, San Ling, Khoa Nguyen, and Huaxiong Wang

Adaptively Secure Identity-Based Encryption from Lattices

with Asymptotically Shorter Public Parameters . . . . . . . . . . . . . . . . . . . . . . 32

Shota Yamada

Zero-Knowledge I

Online/Offline OR Composition of Sigma Protocols . . . . . . . . . . . . . . . . . . 63

Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro,

Luisa Siniscalchi, and Ivan Visconti

Constant-Round Leakage-Resilient Zero-Knowledge

from Collision Resistance. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93

Susumu Kiyoshima

Pseudorandom Functions

Constrained Pseudorandom Functions for Unconstrained Inputs . . . . . . . . . . 124

Apoorvaa Deshpande, Venkata Koppula, and Brent Waters

Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN. . . 154

Yu Yu and John Steinberger

Multi-Party Computation I

Secure Computation from Elastic Noisy Channels. . . . . . . . . . . . . . . . . . . . 184

Dak*****a Khurana, Hemanta K. Maji, and Amit Sahai

All Complete Functionalities are Reversible . . . . . . . . . . . . . . . . . . . . . . . . 213

Dak*****a Khurana, Daniel Kraschewski, Hemanta K. Maji,

Manoj Prabhakaran, and Amit Sahai

Separations

On the Power of Hierarchical Identity-Based Encryption . . . . . . . . . . . . . . . 243

Mohammad Mahmoody and Ameer Mohammed

On the Impossibility of Tight Cryptographic Reductions . . . . . . . . . . . . . . . 273

Christoph Bader, Tibor Jager, Yong Li, and Sven Schäge

Zero-Knowledge II

On the Size of Pairing-Based Non-interactive Arguments. . . . . . . . . . . . . . . 305

Jens Groth

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the

Discrete Log Setting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327

Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth,

and Christophe Petit

Protocols

On the Complexity of Scrypt and Proofs of Space in the Parallel Random

Oracle Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 358

Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov,

Krzysztof Pietrzak, and Stefano Tessaro

Anonymous Traitor Tracing: How to Embed Arbitrary Information

in a Key . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 388

Ryo Nishimaki, Daniel Wichs, and Mark Zhandry

Round Complexity

Unconditionally Secure Computation with Reduced Interaction. . . . . . . . . . . 420

Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, and Adi Rosén

The Exact Round Complexity of Secure Computation . . . . . . . . . . . . . . . . . 448

Sanjam Garg, Pratyay Mukherjee, Omkant Pandey,

and Antigoni Polychroniadou

Commitments

On the Composition of Two-Prover Commitments, and Applications

to Multi-round Relativistic Commitments. . . . . . . . . . . . . . . . . . . . . . . . . . 477

Serge Fehr and Max Fillinger

Computationally Binding Quantum Commitments . . . . . . . . . . . . . . . . . . . . 497

Dominique Unruh

Lattices

Structural Lattice Reduction: Generalized Worst-Case to Average-Case

Reductions and Homomorphic Cryptosystems. . . . . . . . . . . . . . . . . . . . . . . 528

Nicolas Gama, Malika Izabachène, Phong Q. Nguyen, and Xiang Xie

Recovering Short Generators of Principal Ideals in Cyclotomic Rings . . . . . . 559

Ronald Cramer, Léo Ducas, Chris Peikert, and Oded Regev

Leakage

Circuit Compilers with Oe1=logenTT Leakage Rate . . . . . . . . . . . . . . . . . . . 586

Marcin Andrychowicz, Stefan Dziembowski, and Sebastian Faust

Randomness Complexity of Private Circuits for Multiplication . . . . . . . . . . . 616

Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue,

Emmanuel Prouff, Adrian Thillard, and Damien Vergnaud

Indifferentiability

10-Round Feistel is Indifferentiable from an Ideal Cipher. . . . . . . . . . . . . . . 649

Dana Dachman-Soled, Jonathan Katz, and Aishwarya Thiruvengadam

Indifferentiability of Confusion-Diffusion Networks. . . . . . . . . . . . . . . . . . . 679

Yevgeniy Dodis, Martijn Stam, John Steinberger, and Tianren Liu

Multi-Party Computation II

Fair and Robust Multi-party Computation Using a Global

Transaction Ledger . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 705

Aggelos Kiayias, Hong-Sheng Zhou, and Vassilis Zikas

Two Round Multiparty Computation via Multi-key FHE . . . . . . . . . . . . . . . 735

Pratyay Mukherjee and Daniel Wichs

Obfuscation

Post-zeroizing Obfuscation: New Mathematical Tools, and the Case

of Evasive Circuits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 764

Saikrishna Badrinarayanan, Eric Miles, Amit Sahai, and Mark Zhandry

New Negative Results on Differing-Inputs Obfuscation . . . . . . . . . . . . . . . . 792

Mihir Bellare, Igors Stepanovs, and Brent Waters

Automated Analysis, Functional Encryption, and Non-malleable Codes

Automated Unbounded Analysis of Cryptographic Constructions

in the Generic Group Model. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 822

Miguel Ambrona, Gilles Barthe, and Benedikt Schmidt

Multi-input Functional Encryption in the Private-Key Setting: Stronger

Security from Weaker Assumptions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 852

Zvika Brakerski, Ilan Komargodski, and Gil Segev

Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits . . . . . . . 881

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, and Tal Malkin

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 909

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏1 回帖

关键词：Advances ADVANCE advan VANCE NCES

感谢分享好资源！

谢谢分享

你好，楼主，Part I 打不开， 请帮忙看看，谢谢

黄云0429 发表于 2018-7-7 11:09
你好，楼主，Part I 打不开， 请帮忙看看，谢谢

刚看到 现在可以打开吗

黄云0429 发表于 2018-7-7 11:09
你好，楼主，Part I 打不开， 请帮忙看看，谢谢

如果还不行 可以留下邮箱

感谢分享

好的，我的邮箱是 marketing7@126.com, 多谢，哥们