Last update: Thu Apr 25 10:09:10 MDT 2024
Volume 7785, 2013Yevgeniy Dodis and Yu Yu Overcoming Weak Expectations . . . . . . 1--22 Stephan Krenn and Krzysztof Pietrzak and Akshay Wadia A Counterexample to the Chain Rule for Conditional HILL Entropy . . . . . . . . 23--39 Itay Berman and Iftach Haitner and Ilan Komargodski and Moni Naor Hardness Preserving Reductions via Cuckoo Hashing . . . . . . . . . . . . . 40--59 Vipul Goyal and Abhishek Jain and Rafail Ostrovsky and Silas Richelson and Ivan Visconti Concurrent Zero Knowledge in the Bounded Player Model . . . . . . . . . . . . . . 60--79 Ran Canetti and Huijia Lin and Omer Paneth Public-Coin Concurrent Zero-Knowledge in the Global Hash Model . . . . . . . . . 80--99 Melissa Chase and Markulf Kohlweiss and Anna Lysyanskaya and Sarah Meiklejohn Succinct Malleable NIZKs and an Application to Compact Shuffles . . . . 100--119 Craig Gentry Encrypted Messages from the Heights of Cryptomania . . . . . . . . . . . . . . 120--121 Xavier Boyen Attribute-Based Functional Encryption on Lattices . . . . . . . . . . . . . . . . 122--142 Zvika Brakerski When Homomorphism Becomes a Liability 143--161 Benny Applebaum Garbling XOR Gates ``For Free'' in the Standard Model . . . . . . . . . . . . . 162--181 Nir Bitansky and Dana Dachman-Soled and Sanjam Garg and Abhishek Jain and Yael Tauman Kalai \textellipsis Why ``Fiat--Shamir for Proofs'' Lacks a Proof . . . . . . . . . . . . . . . . . 182--201 Prabhanjan Ananth and Raghav Bhaskar and Vipul Goyal and Vanishree Rao On the (In)security of Fischlin's Paradigm . . . . . . . . . . . . . . . . 202--221 Charalampos Papamanthou and Elaine Shi and Roberto Tamassia Signatures of Correct Computation . . . 222--242 Gilad Asharov and Yehuda Lindell and Tal Rabin A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness . . . . . . . 243--262 R. Amzi Jeffs and Mike Rosulek Characterizing the Cryptographic Properties of Reactive $2$-Party Functionalities . . . . . . . . . . . . 263--280 Serge Fehr and Jonathan Katz and Fang Song and Hong-Sheng Zhou and Vassilis Zikas Feasibility and Completeness of Cryptographic Tasks in the Quantum World 281--296 Mohammad Mahmoody and David Xiao Languages with Efficient Zero-Knowledge PCPs are in SZK . . . . . . . . . . . . 297--314 Nir Bitansky and Alessandro Chiesa and Yuval Ishai and Omer Paneth and Rafail Ostrovsky Succinct Non-interactive Arguments via Linear Interactive Proofs . . . . . . . 315--333 Rafael Pass Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments . . . . . . . . . . . . . . 334--354 Tal Malkin Secure Computation for Big Data . . . . 355--355
Anonymous Front Matter . . . . . . . . . . . . . . ?? Marco Baldi and Marco Bianchi and Franco Chiaraluce and Joachim Rosenthal and Davide Schipani Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures . . . . . . . 1--15 Daniel J. Bernstein and Stacey Jeffery and Tanja Lange and Alexander Meurer Quantum Algorithms for the Subset-Sum Problem . . . . . . . . . . . . . . . . 16--33 Slim Bettaieb and Julien Schrek Improved Lattice-Based Threshold Ring Signature Scheme . . . . . . . . . . . . 34--51 Jintai Ding and Bo-Yin Yang Degree of Regularity for HFEv and HFEv- 52--66 Tim Güneysu and Tobias Oder and Thomas Pöppelmann and Peter Schwabe Software Speed Records for Lattice-Based Signatures . . . . . . . . . . . . . . . 67--82 Thijs Laarhoven and Michele Mosca and Joop van de Pol Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search . . 83--101 Grégory Landais and Jean-Pierre Tillich An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes . . . . . . . . . . 102--117 Hiroyuki Miura and Yasufumi Hashimoto and Tsuyoshi Takagi Extended Algorithm for Solving Underdefined Multivariate Quadratic Equations . . . . . . . . . . . . . . . 118--135 Michele Mosca and Douglas Stebila and Berkant Ustao\uglu Quantum Key Distribution in the Classical Authenticated Key Exchange Framework . . . . . . . . . . . . . . . 136--154 Xuyun Nie and Zhaohu Xu and Johannes Buchmann Cryptanalysis of Hash-Based Tamed Transformation and Minus Signature Scheme . . . . . . . . . . . . . . . . . 155--164 Ray Perlner and Daniel Smith-Tone A Classification of Differential Invariants for Multivariate Post-quantum Cryptosystems . . . . . . . . . . . . . 165--173 Edoardo Persichetti Secure and Anonymous Hybrid Encryption from Coding Theory . . . . . . . . . . . 174--187 Albrecht Petzoldt and Stanislav Bulygin and Johannes Buchmann Fast Verification for Improved Versions of the UOV and Rainbow Signature Schemes 188--202 Nicolas Sendrier and Dimitris E. Simos The Hardness of Code Equivalence over $ \mathbb {F}_q $ and Its Application to Code-Based Cryptography . . . . . . . . 203--216 Falko Strenzke Timing Attacks against the Syndrome Inversion in Code-Based Cryptosystems 217--230 Chengdong Tao and Adama Diene and Shaohua Tang and Jintai Ding Simple Matrix Scheme for Encryption . . 231--242 Takanori Yasuda and Tsuyoshi Takagi and Kouichi Sakurai Multivariate Signature Scheme Using Quadratic Forms . . . . . . . . . . . . 243--258 Anonymous Back Matter . . . . . . . . . . . . . . ??