IACR Cryptology ePrint Archive, Volume 2009

Volume 2009, 2009

• Brian Baldwin, Richard Moloney, Andrew Byrne, Gary McGuire, William P. Marnane:
  A Hardware Analysis of Twisted Edwards Curves for an Elliptic Curve Cryptosystem. 1
  
• Julien Brouchier, Nora Dabbous, Tom Kean, Carol Marsh, David Naccache:
  Thermocommunication. 2
  
• Long Hoang Nguyen, A. William Roscoe:
  Separating two roles of hashing in one-way message authentication. 3
  
• Palash Sarkar:
  On Stateless Schemes for Message Authentication Using Pseudorandom Functions. 4
  
• Wei Wang, Xiaoyun Wang, Guangwu Xu:
  Impossible Differential Cryptanalysis of Pelican, MT-MAC-AES and PC-MAC-AES. 5
  
• Vlastimil Klíma:
  Huge Multicollisions and Multipreimages of Hash Functions BLENDER-n. 6
  
• Jens Groth:
  Homomorphic Trapdoor Commitments to Group Elements. 7
  
• Roman Popovych:
  A note on Agrawal conjecture. 8
  
• Christoph Lucas, Dominik Raub, Ueli Maurer:
  Hybrid-Secure MPC: Trading Information-Theoretic Robustness for Computational Privacy. 9
  
• Zhibin Zhou, Dijiang Huang:
  Optimal Multicast Group Communication. 10
  
• D. Canright, Lejla Batina:
  A Very Compact "Perfectly Masked" S-Box for AES (corrected). 11
  
• D. Canright:
  Avoid Mask Re-use in Masked Galois Multipliers. 12
  
• Yehuda Lindell:
  Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1. 13
  
• Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson:
  Key Predistribution Techniques for Grid-Based Wireless Sensor Networks. 14
  
• S. S. Bedi, N. Rajesh Pillai:
  Cube Attacks on Trivium. 15
  
• Neil Costigan, Peter Schwabe:
  Fast elliptic-curve cryptography on the Cell Broadband Engine. 16
  
• Chunbo Ma, Jun Ao:
  Anonymous signature scheme. 17
  
• Prasanth Kumar Thandra, S. A. V. Satya Murty:
  Huge 2ndpreimages and collisions of khichidi-1. 18
  
• Matthew K. Franklin, Mark Gondree, Payman Mohassel:
  Communication-Efficient Private Protocols for Longest Common Subsequence. 19
  
• Jiali Choy, Khoongming Khoo, Chuan-Wen Loe:
  Applying Time-Memory-Data Trade-Off to Meet-in-the-Middle Attack. 20
  
• Julien Cathalo, David Naccache, Jean-Jacques Quisquater:
  Comparing With RSA. 21
  
• Roman Popovych:
  Correctness of Li Generalization of RSA Cryptosystem. 22
  
• Dennis Hofheinz, Dominique Unruh, Jörn Müller-Quade:
  Polynomial Runtime and Composability. 23
  
• Emmanuelle Dottax, Christophe Giraud, Matthieu Rivain, Yannick Sierra:
  On Second-Order Fault Analysis Resistance for CRT-RSA Implementations. 24
  
• Ee-Chien Chang, Chee Liang Lim, Jia Xu:
  Short Redactable Signatures Using Random Trees. 25
  
• Zhimin Li, Licheng Wang, Daofeng Li, Yixian Yang:
  Collision Attacks on NaSHA-384/512. 26
  
• Markus Rückert, Dominique Schröder:
  Security of Verifiably Encrypted Signatures. 27
  
• Susan Hohenberger, Brent Waters:
  Realizing Hash-and-Sign Signatures under Standard Assumptions. 28
  
• Marius Oliver Gheorghita:
  Nofish - A new stream cipher. 29
  
• Boris Skoric, Pim Tuyls:
  An efficient fuzzy extractor for limited noise. 30
  
• Yehuda Lindell:
  Adaptively Secure Two-Party Computation with Erasures. 31
  
• Shigeo Mitsunari:
  A Fast Implementation of eta_T Pairing in Characteristic Three on Intel Core 2 Duo Processor. 32
  
• Yaser Esmaeili Salehani, Amir Tabatabaei, Mohammad Reza Sohizadeh Abyaneh, Mehdi M. Hassanzadeh:
  NESHA-256, NEw 256-bit Secure Hash Algorithm (Extended Abstract). 33
  
• Smile Markovski, A. Mileva, V. Dimitrova, Danilo Gligoroski:
  On a Conditional Collision Attack on NaSHA-512. 34
  
• Xiaofeng Chen, Fangguo Zhang, Haibo Tian, Baodian Wei, Kwangjo Kim:
  Key-Exposure Free Chameleon Hashing and Signatures Based on Discrete Logarithm Systems. 35
  
• Carmit Hazay, Yehuda Lindell:
  Constructions of Truly Practical Secure Protocols using Standard Smartcards. 36
  
• M. Jason Hinek, Charles C. Y. Lam:
  Common Modulus Attacks on Small Private Exponent RSA and Some Fast Variants (in Practice). 37
  
• Bhupendra Singh, Lexy Alexander, Sanjay Burman:
  On Algebraic Relations of Serpent S-Boxes. 38
  
• Mihir Bellare, Shanshan Duan, Adriana Palacio:
  Key Insulation and Intrusion Resilience Over a Public Channel. 39
  
• Yusuke Naito, Kazuki Yoneyama, Lei Wang, Kazuo Ohta:
  How to Prove the Security of Practical Cryptosystems with Merkle-Damgård Hashing by Adopting Indifferentiability. 40
  
• Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs:
  Proofs of Retrievability via Hardness Amplification. 41
  
• Lilya Budaghyan, Claude Carlet:
  On CCZ-equivalence and its use in secondary constructions of bent functions. 42
  
• Karthik Chandrashekar Iyer, Aravinda Subramanya:
  Image Encryption by Pixel Property Separation. 43
  
• Dmitry Frumkin, Adi Shamir:
  Un-Trusted-HB: Security Vulnerabilities of Trusted-HB. 44
  
• Carmit Hazay, Yehuda Lindell:
  Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. 45
  
• Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng:
  Traceability Codes. 46
  
• Palash Sarkar:
  On Approximating Addition by Exclusive OR. 47
  
• Palash Sarkar:
  A Trade-Off Between Collision Probability and Key Size in Universal Hashing Using Polynomials. 48
  
• Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei Wei, Josef Pieprzyk:
  Extensions of the Cube Attack based on Low Degree Annihilators. 49
  
• Jan Camenisch, Aggelos Kiayias, Moti Yung:
  On the Portability of Generalized Schnorr Proofs. 50
  
• Mohammad Reza Reyhanitabar, Willy Susilo, Yi Mu:
  Enhanced Target Collision Resistant Hash Functions Revisited. 51
  
• S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan:
  ON THE SECURITY OF TWO RING SIGNCRYPTION SCHEMES. 52
  
• Lilya Budaghyan, Tor Helleseth:
  New commutative semifields defined by PN multinomials. 53
  
• Ewan Fleischmann, Michael Gorski, Stefan Lucks:
  On the Security of Tandem-DM. 54
  
• Ralf Küsters, Max Tuengerthal:
  Universally Composable Symmetric Encryption. 55
  
• David Kammler, Diandian Zhang, Peter Schwabe, Hanno Scharwächter, Markus Langenberg, Dominik Auras, Gerd Ascheid, Rainer Leupers, Rudolf Mathar, Heinrich Meyr:
  Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves. 56
  
• Gregory M. Zaverucha, Douglas R. Stinson:
  Anonymity in Shared Symmetric Key Primitives. 57
  
• Takakazu Satoh:
  On Generalization of Cheon's Algorithm. 58
  
• László Csirmaz:
  On the impossibility of graph secret sharing. 59
  
• Sanjit Chatterjee, Darrel Hankerson, Edward Knapp, Alfred Menezes:
  Comparing Two Pairing-Based Aggregate Signature Schemes. 60
  
• Shigeo Tsujii, Kohtaro Tadaki, Ryou Fujita, Masahito Gotaishi, Toshinobu Kaneko:
  Security Enhancement of Various MPKCs by 2-layer Nonlinear Piece In Hand Method. 61
  
• Subhamoy Maitra, Santanu Sarkar:
  On Deterministic Polynomial-Time Equivalence of Computing the CRT-RSA Secret Keys and Factoring. 62
  
• Lilya Budaghyan, Claude Carlet:
  CCZ-equivalence and Boolean functions. 63
  
• Céline Blondeau, Benoît Gérard:
  On the Data Complexity of Statistical Attacks Against Block Ciphers (full version). 64
  
• Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi:
  Foundations of Non-Malleable Hash and One-Way Functions. 65
  
• Jooyoung Lee, Je Hong Park:
  Adaptive Preimage Resistance and Permutation-based Hash Functions. 66
  
• Chuan-Kun Wu:
  On fractional correlation immunity of majority functions. 67
  
• Johann Barbier, Eric Filiol:
  Overview of Turbo-Code Reconstruction Techniques. 68
  
• Alptekin Küpçü, Anna Lysyanskaya:
  Optimistic Fair Exchange with Multiple Arbiters. 69
  
• Omran Ahmadi, Francisco Rodríguez-Henríquez:
  Low Complexity Cubing and Cube Root Computation over F_3^m in Polynomial Basis. 70
  
• László Csirmaz, Gábor Tardos:
  Secret sharing on trees: problem solved. 71
  
• Luis J. Dominguez Perez, Ezekiel J. Kachisa, Michael Scott:
  Implementing cryptographic pairings: a magma tutorial. 72
  
• Chun-Xiang Gu, Yan Guang, Yue-Fei Zhu:
  Automatic Approach of Provable Security and its Application for OAEP+. 73
  
• Kirill Morozov, George Savvides:
  Computational Oblivious Transfer and Interactive Hashing. 74
  
• Yusuke Naito, Kazuki Yoneyama, Lei Wang, Kazuo Ohta:
  Security of Practical Cryptosystems Using Merkle-Damgard Hash Function in the Ideal Cipher Model. 75
  
• Zhixiong Chen, Chenhuang Wu:
  Construction of large families of pseudorandom subsets using elliptic curves. 76
  
• Charles Bouillaguet, Orr Dunkelman, Pierre-Alain Fouque, Antoine Joux:
  On the Security of Iterated Hashing based on Forgery-resistant Compression Functions. 77
  
• Stefan Lucks, Andreas Schuler, Erik Tews, Ralf-Philipp Weinmann, Matthias Wenzel:
  Attacks on the DECT authentication mechanisms. 78
  
• David A. Basin, Cas J. F. Cremers:
  From Dolev-Yao to Strong Adaptive Corruption: Analyzing Security in the Presence of Compromising Adversaries. 79
  
• Michael Backes, Dennis Hofheinz, Dominique Unruh:
  CoSP: A General Framework For Computational Soundness Proofs. 80
  
• Cong Wang, Qian Wang, Kui Ren, Wenjing Lou:
  Ensuring Data Storage Security in Cloud Computing. 81
  
• Douglas Stebila, Michele Mosca, Norbert Lütkenhaus:
  The Case for Quantum Key Distribution. 82
  
• Vladimir Bozovic, Daniel Socek, Rainer Steinwandt, Viktória I. Villányi:
  Multi-authority attribute based encryption with honest-but-curious central authority. 83
  
• Mihir Bellare, Thomas Ristenpart:
  Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme. 84
  
• Tao Feng, Xian Guo, Jianfeng Ma, Xinghua Li:
  UC-Secure Source Routing Protocol. 85
  
• P. N. J. Eagle, Steven D. Galbraith, John Ong:
  Point Compression for Koblitz Elliptic Curves. 86
  
• Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
  Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication Per Multiplication Gate. 87
  
• Brett Hemenway, Benoît Libert, Rafail Ostrovsky, Damien Vergnaud:
  Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. 88
  
• Boris Köpf, Markus Dürmuth:
  A Provably Secure And Efficient Countermeasure Against Timing Attacks. 89
  
• Alexander W. Dent:
  A Brief History of Provably-Secure Public-Key Encryption. 90
  
• Koichiro Noro, Kunikatsu Kobayashi:
  Knapsack Cryptosystem on Elliptic Curves. 91
  
• Jung Hee Cheon, Jeongdae Hong, Gene Tsudik:
  Reducing RFID Reader Load with the Meet-in-the-Middle Strategy. 92
  
• Peter Gazi, Ueli Maurer:
  Cascade Encryption Revisited. 93
  
• Sugata Gangopadhyay, Sumanta Sarkar, Ruchi Telang:
  On the Lower Bounds of the Second Order Nonlinearity of some Boolean Functions. 94
  
• Ernie Brickell, Jiangtao Li:
  Enhanced Privacy ID from Bilinear Pairing. 95
  
• Maria Isabel Gonzalez Vasco, Angel L. Pérez del Pozo, Pedro Taborda Duarte:
  A note on the security of MST3. 96
  
• Brian J. Matt:
  Identification of Multiple Invalid Signatures in Pairing-based Batched Signatures. 97
  
• Martin R. Albrecht, Craig Gentry, Shai Halevi, Jonathan Katz:
  Attacking Cryptographic Schemes Based on "Perturbation Polynomials". 98
  
• Hugue Blier, Alain Tapp:
  A Single Initialization Server for Multi-Party Cryptography. 99
  
• Gaetan Bisson, Andrew V. Sutherland:
  Computing the endomorphism ring of an ordinary elliptic curve over a finite field. 100
  
• Mihir Bellare, Scott Yilek:
  Encryption Schemes Secure under Selective Opening Attack. 101
  
• Raphael Overbeck:
  A Step Towards QC Blind Signatures. 102
  
• David Mandell Freeman, Takakazu Satoh:
  Constructing pairing-friendly hyperelliptic curves using Weil restriction. 103
  
• Dieter Schmidt:
  1024 - A High Security Software Oriented Block Cipher. 104
  
• Moni Naor, Gil Segev:
  Public-Key Cryptosystems Resilient to Key Leakage. 105
  
• Yu Sasaki:
  A Collision Attack on AURORA-512. 106
  
• Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya:
  Compact E-Cash and Simulatable VRFs Revisited. 107
  
• Santanu Sarkar, Subhamoy Maitra:
  Further Results on Implicit Factoring in Polynomial Time. 108
  
• Haina Zhang, Xiaoyun Wang:
  Cryptanalysis of Stream Cipher Grain Family. 109
  
• Haina Zhang, Xiaoyun Wang:
  On the Security of Stream Cipher CryptMT v3. 110
  
• Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger:
  Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. 111
  
• Yu Sasaki:
  A 2nd-Preimage Attack on AURORA-512. 112
  
• Niels Ferguson, Stefan Lucks:
  Attacks on AURORA-512 and the Double-Mix Merkle-Damgaard Transform. 113
  
• Anupam Pattanayak, B. Majhi:
  Weakness of Key Predistribution Scheme Proposed by J. Dong et al. 114
  
• S. Sree Vivek, S. Sharmila Deva Selvi, Deepanshu Shukla, C. Pandu Rangan:
  Scalable Compilers for Group Key Establishment : Two/Three Party to Group. 115
  
• Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
  Information Theoretically Secure Multi Party Set Intersection Re-Visited. 116
  
• Alexander Rostovtsev:
  Changing probabilities of differentials and linear sums via isomorphisms of ciphers. 117
  
• Jin Li, Kui Ren, Kwangjo Kim:
  A2BE: Accountable Attribute-Based Encryption for Abuse Free Access Control. 118
  
• Marcel Medwed:
  A Continuous Fault Countermeasure for AES Providing a Constant Error Detection Rate. 119
  
• Danilo Gligoroski, Rune Steinsmo Ødegård:
  On the Complexity of Khovratovich et.al's Preimage Attack on Edon-R. 120
  
• Martín A. Gagliotti Vigil, Ricardo Felipe Custódio, Nelson da Silva, Ricardo Moraes:
  Optimized Public Key Infrastructure - A PKI to Support Efficient Document's Signatures. 121
  
• Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, Francisco Rodríguez-Henríquez:
  Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers. 122
  
• N. A. Carella:
  On the Complexity of Integer Factorization. 123
  
• Annika Paus, Ahmad-Reza Sadeghi, Thomas Schneider:
  Practical Secure Evaluation of Semi-Private Functions. 124
  
• Yu Sasaki:
  A Full Key Recovery Attack on HMAC-AURORA-512. 125
  
• Siamak Fayyaz Shahandashti, Reihaneh Safavi-Naini:
  Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems. 126
  
• Itai Dinur, Adi Shamir:
  Side Channel Cube Attacks on Block Ciphers. 127
  
• Lu Xiao, Gregory G. Rose:
  Attacks on a Lightweight Cipher Based on a Multiple Recursive Generator. 128
  
• Emilia Käsper, Peter Schwabe:
  Faster and Timing-Attack Resistant AES-GCM. 129
  
• Yindong Chen, Peizhong Lu:
  Constructions of Even-variable Boolean Function with Optimum Algebraic Immunity. 130
  
• Anupam Pattanayak, B. Majhi:
  Key Predistribution Schemes in Distributed Wireless Sensor Network using Combinatorial Designs Revisited. 131
  
• Yanbin Pan, Yingpu Deng:
  A New Lattice for Implicit Factoring. 132
  
• Jonathan Katz:
  Signature Schemes with Bounded Leakage Resilience. 133
  
• Yindong Chen, Peizhong Lu:
  A First Order Recursive Construction of Boolean Function with Optimum Algebraic Immunity. 134
  
• Gaëtan Leurent:
  Practical Key Recovery Attack against Secret-prefix Edon-R. 135
  
• Yvonne Cliff, Colin Boyd, Juan Manuel González Nieto:
  How to Extract and Expand Randomness: A Summary and Explanation of Existing Results. 136
  
• Nicolas Courtois:
  The Dark Side of Security by Obscurity and Cloning MiFare Classic Rail and Building Passes Anywhere, Anytime. 137
  
• Jen-Chun Chang, Hsin-Lung Wu:
  A Hybrid RFID Protocol against Tracking Attacks. 138
  
• Chunbo Ma, Jun Ao:
  Certificateless Group Oriented Signature Secure Against Key Replacement Attack. 139
  
• Mohamed Abo El-Fotouh, Klaus Diepold:
  The Analysis of Galois Substitution Counter Mode (GSCM). 140
  
• Oriol Farràs, Carles Padró:
  Ideal Hierarchical Secret Sharing Schemes. 141
  
• Ronald Cramer, Dennis Hofheinz, Eike Kiltz:
  Chosen-ciphertext Secure Encryption from Hard Algebraic Set Systems. 142
  
• So-Young Park, Sang-Ho Lee, Joohan Lee:
  Multiple and Unlinkable Public Key Encryption without Certificates. 143
  
• S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan:
  On the security of Identity Based Ring Signcryption Schemes. 144
  
• Jooyoung Lee, Daesung Kwon:
  Security of Single-permutation-based Compression Functions. 145
  
• Georg Fuchsbauer, David Pointcheval, Damien Vergnaud:
  Transferable Constant-Size Fair E-Cash. 146
  
• Deukjo Hong, Woo-Hwan Kim, Bonwook Koo:
  Preimage Attack on ARIRANG. 147
  
• Yutaka Kawai, Kazuki Yoneyama, Kazuo Ohta:
  Secret Handshake: Strong Anonymity Definition and Construction. 148
  
• Mike Burmester, Breno de Medeiros, Jorge Munilla, Alberto Peinado:
  Secure EPC Gen2 compliant Radio Frequency Identification. 149
  
• Long H. Nguyen, A. W. Roscoe:
  Efficient group authentication protocols based on human interaction. 150
  
• Shaohua Zhang:
  Euclid's Algorithm, Guass' Elimination and Buchberger's Algorithm. 151
  
• Michael Sirivianos:
  FaceTrust: Assessing the Credibility of Online Personas via Social Networks. 152
  
• Long H. Nguyen, A. W. Roscoe:
  New combinatorial bounds for universal hash functions. 153
  
• Yasufumi Hashimoto:
  Algorithms to solve massively under-defined systems of multivariate quadratic equations. 154
  
• Christophe Arene, Tanja Lange, Michael Naehrig, Christophe Ritzenthaler:
  Faster Computation of the Tate Pairing. 155
  
• Anupam Pattanayak, B. Majhi:
  A Deterministic Approach of Merging of Blocks in Transversal Design based Key Predistribution. 156
  
• Peter Birkner, Nicolas Thériault:
  Efficient Halving for Genus 3 Curves over Binary Fields. 157
  
• Manoj Kumar:
  Security Analysis of a Proxy Signature Scheme over Braid Groups. 158
  
• Stefan Tillich:
  Hardware Implementation of the SHA-3 Candidate Skein. 159
  
• Joël Alwen, Yevgeniy Dodis, Daniel Wichs:
  Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model. 160
  
• Yuichi Komano, Hideo Shimizu, Shin-ichi Kawamura:
  Built-in Determined Sub-key Correlation Power Analysis. 161
  
• Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
  Certificateless Hybrid Signcryption. 162
  
• Björn Grohmann:
  A New Key-Agreement-Protocol. 163
  
• Jun Shao, Zhenfu Cao:
  CCA-Secure Proxy Re-Encryption without Pairings. 164
  
• Matthieu Rivain:
  Securing RSA against Fault Analysis by Double Addition Chain Exponentiation. 165
  
• Valérie Nachef, Jacques Patarin:
  I shall love you up to the death. 166
  
• François Arnault, Thierry P. Berger, Cédric Lauradoux, Marine Minier, Benjamin Pousse:
  A new approach for FCSRs. 167
  
• Michael Halcrow, Niels Ferguson:
  A Second Pre-image Attack Against Elliptic Curve Only Hash (ECOH). 168
  
• Yupu Hu, Juntao Gao, Qing Liu:
  Floating Fault analysis of Trivium under Weaker Assumptions. 169
  
• Mohammad Reza Reyhanitabar, Willy Susilo, Yi Mu:
  Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders. 170
  
• Ivan Damgård, Gert Læssøe Mikkelsen:
  On the Theory and Practice of Personal Digital Signatures. 171
  
• Björn Grohmann:
  A new Protocol for 1-2 Oblivious Transfer. 172
  
• Patrick Longa, Catherine H. Gebotys:
  Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication. 173
  
• Dario Fiore, Rosario Gennaro:
  Making the Diffie-Hellman Protocol Identity-Based. 174
  
• Stefan Lucks, Erik Zenner, André Weimerskirch, Dirk Westhoff:
  Concrete Security for Entity Recognition: The Jane Doe Protocol (Full Paper). 175
  
• Yalin Chen, Chun-Hui Huang, Jue-Sam Chou:
  A novel multi-server authentication protocol. 176
  
• Yevgeniy Dodis, Thomas Ristenpart, Thomas Shrimpton:
  Salvaging Merkle-Damgard for Practical Applications. 177
  
• Jiali Choy, Guanhan Chew, Khoongming Khoo, Huihui Yap:
  Cryptographic Properties and Application of a Generalized Unbalanced Feistel Network Structure (Revised Version). 178
  
• Hongbo Yu, Xiaoyun Wang:
  Near-Collision Attack on the Compression Function of Dynamic SHA2. 179
  
• Haakon Ringberg, Benny Applebaum, Michael J. Freedman, Matthew Caesar, Jennifer Rexford:
  Collaborative, Privacy-Preserving Data Aggregation at Scale. 180
  
• Erik-Oliver Blass, Anil Kurmus, Refik Molva, Thorsten Strufe:
  PSP: Private and Secure Payment with RFID. 181
  
• Mohamed Abo El-Fotouh, Klaus Diepold:
  Extended Substitution Cipher Chaining mode (ESCC). 182
  
• Rune Thorbek:
  Proactive Linear Integer Secret Sharing. 183
  
• Jean-Philippe Aumasson, Orr Dunkelman, Sebastiaan Indesteege, Bart Preneel:
  Cryptanalysis of Dynamic SHA(2). 184
  
• Robert P. McEvoy, Michael Tunstall, Claire Whelan, Colin C. Murphy, William P. Marnane:
  All-or-Nothing Transforms as a Countermeasure to Differential Side-Channel Analysis. 185
  
• Nicolas Courtois, Gregory V. Bard, Shaun Van Ault:
  Statistics of Random Permutations and the Cryptanalysis of Periodic Block Ciphers. 186
  
• Rafael Misoczki, Paulo S. L. M. Barreto:
  Compact McEliece Keys from Goppa Codes. 187
  
• S. Sree Vivek, S. Sharmila Deva Selvi, S. Gopi Nath, C. Pandu Rangan:
  Breaking and Building of Group Inside Signature. 188
  
• Sherman S. M. Chow, Jian Weng, Yanjiang Yang, Robert H. Deng:
  Efficient Unidirectional Proxy Re-Encryption. 189
  
• Ayan Mahalanobis:
  The discrete logarithm problem in the group of non-singular circulant matrices. 190
  
• Joan Boyar, René Peralta:
  New logic minimization techniques with applications to cryptology. 191
  
• Manoj Kumar:
  Linkability of Blind Signature Schemes over Braid Groups. 192
  
• Sunder Lal, Prashant Kushwah:
  Generalization of Barreto et al ID based Signcryption Scheme. 193
  
• Mingwu Zhang, Yusheng Zhong, Pengcheng Li, Bo Yang:
  Analysis and Enhance of Anonymous Signcryption Scheme. 194
  
• Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov, Riccardo Lazzeretti, Ahmad-Reza Sadeghi, Thomas Schneider:
  Secure Evaluation of Private Linear Branching Programs with Medical Applications. 195
  
• Zhengjun Cao:
  Analysis of one quantum bit string commitment. 196
  
• Jian Guo, Krystian Matusiewicz, Lars R. Knudsen, San Ling, Huaxiong Wang:
  Practical pseudo-collisions for hash functions ARIRANG-224/384. 197
  
• Liqun Chen, Paul Morrissey, Nigel P. Smart:
  DAA: Fixing the pairing based protocols. 198
  
• Emmanuel Bresson, Anne Canteaut, Benoît Chevallier-Mames, Christophe Clavier, Thomas Fuhr, Aline Gouget, Thomas Icart, Jean-François Misarsky, María Naya-Plasencia, Pascal Paillier, Thomas Pornin, Jean-René Reinhard, Céline Thuillet, Marion Videau:
  Indifferentiability with Distinguishers: Why Shabal Does Not Require Ideal Ciphers. 199
  
• Rishab Nithyanand:
  A Survey on the Evolution of Cryptographic Protocols in ePassports. 200
  
• Mohamed Abo El-Fotouh, Klaus Diepold:
  Enhanced Cryptanalysis of Substitution Cipher Chaining mode (SCC-128). 201
  
• Alawi A. Al-saggaf, H. S. Acharya:
  A GENERALIZED FRAMEWORK FOR CRISP COMMITMENT SCHEMES. 202
  
• Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi, Ralf-Philipp Weinmann:
  Practical Cryptanalysis of ISO/IEC 9796-2 and EMV Signatures. 203
  
• Yuan Tian:
  GUC-Secure Join Operator in Distributed Relational Database. 204
  
• Maria Isabel Gonzalez Vasco, Angel L. Pérez del Pozo:
  Related Message Attacks to Public Key Encryption Schemes: Relations among Security Notions. 205
  
• Bernhard Jungk, Steffen Reith, Jürgen Apfelbeck:
  On Optimized FPGA Implementations of the SHA-3 Candidate Groestl. 206
  
• Mehrdad Nojoumian, Douglas R. Stinson, Morgan Grainger:
  Unconditionally Secure Social Secret Sharing Scheme. 207
  
• Rajesh P. Singh, B. K. Sarma, Anupam Saikia:
  PUBLIC KEY CRYPTOGRAPHY USING PERMUTATION P-POLYNOMIALS OVER FINITE FIELDS. 208
  
• Jia Xu:
  On Directed Transitive Signature. 209
  
• Guido Bertoni, Joan Daemen, Michael Peeters, Gilles Van Assche:
  Sufficient conditions for sound tree and sequential hashing modes. 210
  
• Endre Bangerter, Stefania Barzan, Stephan Krenn, Ahmad-Reza Sadeghi, Thomas Schneider, Joe-Kai Tsay:
  Bringing Zero-Knowledge Proofs of Knowledge to Practice. 211
  
• Mike Burmester, Jorge Munilla:
  A Flyweight RFID Authentication Protocol. 212
  
• Richard Moloney, Gary McGuire, Michael Markowitz:
  Elliptic Curves in Montgomery Form with B=1 and Their Low Order Torsion. 213
  
• Tal Moran, Moni Naor, Gil Segev:
  An Optimally Fair Coin Toss. 214
  
• Palash Sarkar:
  A Simple and Generic Construction of Authenticated Encryption With Associated Data. 215
  
• Palash Sarkar:
  Tweakable Enciphering Schemes Using Only the Encryption Function of a Block Cipher. 216
  
• Palash Sarkar:
  Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher. 217
  
• Jean-Philippe Aumasson, Itai Dinur, Luca Henzen, Willi Meier, Adi Shamir:
  Efficient FPGA Implementations of High-Dimensional Cube Testers on the Stream Cipher Grain-128. 218
  
• Georg Lippold, Colin Boyd, Juan Manuel González Nieto:
  Strongly Secure Certificateless Key Agreement. 219
  
• Jonathan Katz:
  Signature Schemes with Bounded Leakage Resilience. 220
  
• David Jao, Kayo Yoshida:
  Boneh-Boyen signatures and the Strong Diffie-Hellman problem. 221
  
• Willi Geiselmann, Kenneth Matheis, Rainer Steinwandt:
  PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware. 222
  
• Tao Xie, Dengguo Feng:
  How To Find Weak Input Differences For MD5 Collision Attacks. 223
  
• Keting Jia, Yvo Desmedt, Lidong Han, Xiaoyun Wang:
  Pseudo-Cryptanalysis of Luffa. 224
  
• Jooyoung Lee, Daesung Kwon:
  The Security of Abreast-DM in the Ideal Cipher Model. 225
  
• Thomas Icart:
  How to Hash into Elliptic Curves. 226
  
• Daniele Micciancio:
  Computational soundness, co-induction, and encryption cycles. 227
  
• Benedikt Gierlichs, Lejla Batina, Bart Preneel, Ingrid Verbauwhede:
  Revisiting Higher-Order DPA Attacks: Multivariate Mutual Information Analysis. 228
  
• Giacomo de Meulenaer, Christophe Petit, Jean-Jacques Quisquater:
  Hardware Implementations of a Variant of the Zémor-Tillich Hash Function: Can a Provably Secure Hash Function be very efficient ? 229
  
• Martin Hirt, Vassilis Zikas:
  Adaptively Secure Broadcast. 230
  
• Elke De Mulder, Benedikt Gierlichs, Bart Preneel, Ingrid Verbauwhede:
  Practical DPA Attacks on MDPL. 231
  
• Björn Fay:
  MeshHash2. 232
  
• Paula Bustillo, Domingo Gómez, Jaime Gutierrez, Álvar Ibeas:
  A strategy for recovering roots of bivariate polynomials modulo a prime. 233
  
• Rune Steinsmo Ødegård, Danilo Gligoroski:
  On the Randomness and Regularity of Reduced EDON-R Compression Function. 234
  
• S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan:
  Breaking and Fixing of an Identity Based Multi-Signcryption Scheme. 235
  
• Fumiyuki Momose, Jinhui Chao:
  Elliptic curves with weak coverings over cubic extensions of finite fields with odd characteristics. 236
  
• Zhengjun Cao:
  Remarks on One Arbitrated Quantum-signature Scheme. 237
  
• Ji Li, Liangyu Xu:
  Attacks on Round-Reduced BLAKE. 238
  
• Julien Bringer, Hervé Chabanne, Jean-Luc Danger:
  Protecting the NOEKEON Cipher Against SCARE Attacks in FPGAs by using Dynamic Implementations. 239
  
• Gregory M. Zaverucha, Douglas R. Stinson:
  Group Testing and Batch Verification. 240
  
• Alex Biryukov, Dmitry Khovratovich, Ivica Nikolic:
  Distinguisher and Related-Key Attack on the Full AES-256 (Extended Version). 241
  
• Alex Biryukov, Dmitry Khovratovich, Ivica Nikolic:
  Examples of differential multicollisions for 13 and 14 rounds of AES-256. 242
  
• Craig Costello, Hüseyin Hisil, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong:
  Faster Pairings on Special Weierstrass Curves. 243
  
• Boris Skoric, Stefan Katzenbeisser, Hans Georg Schaathun, Mehmet Utku Celik:
  Tardos Fingerprinting Codes in the Combined Digit Model. 244
  
• Naoki Ogura, Shigenori Uchiyama:
  Cryptanalysis of the Birational Permutation Signature Scheme over a Non-commutative Ring. 245
  
• György Csaba, Xueming Ju, Qingqing Chen, Wolfgang Porod, Jürgen Schmidhuber, Ulf Schlichtmann, Paolo Lugli, Ulrich Rührmair:
  On-Chip Electric Waves: An Analog Circuit Approach to Physical Uncloneable Functions. 246
  
• Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi:
  On the Necessary and Sufficient Assumptions for UC Computation. 247
  
• Simon R. Blackburn, Carlos Cid, Ciaran Mullan:
  Cryptanalysis of the MST_3 Public Key Cryptosystem. 248
  
• Daniele Micciancio:
  Pseudo-randomness and partial information in symbolic security analysis. 249
  
• Mehreen Afzal, Ashraf Masood:
  Modifications in the Design of Trivium to Increase its Security Level. 250
  
• Mihir Bellare, Thomas Ristenpart, Phillip Rogaway, Till Stegers:
  Format-Preserving Encryption. 251
  
• Igor Semaev:
  Sparse Boolean equations and circuit lattices. 252
  
• Cas J. F. Cremers:
  Formally and Practically Relating the CK, CK-HMQV, and eCK Security Models for Authenticated Key Exchange. 253
  
• Zhengjun Cao:
  Improvement of One Quantum Encryption Scheme. 254
  
• Ulrich Rührmair:
  SIMPL Systems: On a Public Key Variant of Physical Unclonable Functions. 255
  
• Zhiqiang Liu, Dawu Gu, Jing Zhang:
  Multiple Linear Cryptanalysis of Reduced-Round SMS4 Block Cipher. 256
  
• Ulf T. Mattsson:
  FORMAT CONTROLLING ENCRYPTION USING DATATYPE PRESERVING ENCRYPTION. 257
  
• Romain Cosset:
  Factorization with Genus 2 Curves. 258
  
• Cameron McDonald, Philip Hawkes, Josef Pieprzyk:
  Differential Path for SHA-1 with complexity $O(2^{52})$. 259
  
• Kota Ideguchi, Toru Owada, Hirotaka Yoshida:
  A Study on RAM Requirements of Various SHA-3 Candidates on Low-cost 8-bit CPUs. 260
  
• Ewan Fleischmann, Michael Gorski, Stefan Lucks:
  Security of Cyclic Double Block Length Hash Functions including Abreast-DM. 261
  
• Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
  Computationally Secure Two-Round Authenticated Message Exchange. 262
  
• Kaoru Kurosawa:
  General Error Decodable Secret Sharing Scheme and Its Application. 263
  
• Shigeo Tsujii, Kohtaro Tadaki, Masahito Gotaishi, Ryou Fujita, Masao Kasahara:
  Proposal of PPS Multivariate Public Key Cryptosystems. 264
  
• Yiyuan Luo, Zheng Gong, Ming Duan, Bo Zhu, Xuejia Lai:
  Revisiting the Indifferentiability of PGV Hash Functions. 265
  
• Yiyuan Luo, Xuejia Lai, Zheng Gong, Zhongming Wu:
  Pseudorandomness Analysis of the Lai-Massey Scheme. 266
  
• Stéphanie Delaune, Steve Kremer, Olivier Pereira:
  Simulation based security in the applied pi calculus. 267
  
• Mehrdad Nojoumian, Douglas R. Stinson:
  Dealer-Free Dynamic Secret Sharing Schemes with Unconditional Security. 268
  
• Thomas Roche, Cédric Tavernier:
  Side-channel attacks based on linear approximations. 269
  
• Rafael Tonicelli, Rafael Dowsley, Goichiro Hanaoka, Hideki Imai, Jörn Müller-Quade, Akira Otsuka, Anderson C. A. Nascimento:
  Information-Theoretically Secure Oblivious Polynomial Evaluation in the Commodity-Based Model. 270
  
• Rafael Dowsley, Goichiro Hanaoka, Hideki Imai, Anderson C. A. Nascimento:
  Reducing the Ciphertext Size of Dolev-Dwork-Naor like Public Key Cryptosystems. 271
  
• Ziran Tu, Yingpu Deng:
  A Conjecture on Binary String and Its Applications on Constructing Boolean Functions of Optimal Algebraic Immunity. 272
  
• Rafael Dowsley, Jörn Müller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai, Anderson C. A. Nascimento:
  Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data. 273
  
• Xigen Yao:
  A Collision-resistance Hash Function DIHA2. 274
  
• Thomas Dullien:
  Algebraic Attacks specialized to F₂ (Diplomarbeit). 275
  
• Jean-Luc Beuchat, Emmanuel López-Trejo, Luis Martínez-Ramos, Shigeo Mitsunari, Francisco Rodríguez-Henríquez:
  Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves. 276
  
• Ulrich Rührmair, Jan Sölter, Frank Sehnke:
  On the Foundations of Physical Unclonable Functions. 277
  
• Ulrich Rührmair, Qingqing Chen, Paolo Lugli, Ulf Schlichtmann, Martin Stutzmann, György Csaba:
  Towards Electrical, Integrated Implementations of SIMPL Systems. 278
  
• Mathieu Renauld, François-Xavier Standaert:
  Algebraic Side-Channel Attacks. 279
  
• Giuseppe Ateniese, Paolo Gasti:
  Universally Anonymous IBE based on the Quadratic Residuosity Assumption. 280
  
• Qian Wang, Cong Wang, Jin Li, Kui Ren, Wenjing Lou:
  Enabling Public Verifiability and Data Dynamics for Storage Security. 281
  
• Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy N. Rothblum:
  Leakage-Resilient Signatures. 282
  
• Susan Hohenberger, Brent Waters:
  Short and Stateless Signatures from the RSA Assumption. 283
  
• Jin Li, Kui Ren, Bo Zhu, Zhiguo Wan:
  Privacy-aware Attribute-based Encryption with User Accountability. 284
  
• Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa:
  Efficient Public Key Encryption Based on Ideal Lattices. 285
  
• Paulo Mateus, Serge Vaudenay:
  On Privacy Losses in the Trusted Agent Model (Abstract). 286
  
• Valérie Nachef:
  Generic Attacks on Alternating Unbalanced Feistel Schemes. 287
  
• Jiang Wu, Berkant Ustaoglu:
  Efficient Key Exchange with Tight Security Reduction. 288
  
• Erik Zenner:
  Analysis of the End-by-Hop Protocol for Secure Aggregation in Sensor Networks. 289
  
• S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, S. Kalaivani, C. Pandu Rangan:
  Security Analysis of Aggregate signature and Batch verification signature schemes. 290
  
• M. Choudary Gorantla, Colin Boyd, Juan Manuel González Nieto:
  Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols. 291
  
• Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, Peter Schwabe:
  Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB. 292
  
• Jin Li, Qian Wang, Cong Wang, Kui Ren:
  Enhancing Attribute-based Encryption with Attribute Hierarchy. 293
  
• Roman Schlegel, Duncan S. Wong:
  Low Latency High Bandwidth Anonymous Overlay Network with Anonymous Routing. 294
  
• Shucheng Yu, Kui Ren, Wenjing Lou, Jin Li:
  Defending Against Key Abuse Attacks in KP-ABE Enabled Broadcast Systems. 295
  
• Oleg A. Logachev, A. A. Salnikov, Stanislav Smyshlyaev, V. V. Yashchenko:
  Perfectly Balanced Functions in Symbolic Dynamics. 296
  
• Subhabrata Sen, Rudradev Sengupta, Subhamoy Maitra, Goutam Paul, Shashwat Raizada:
  A New Improved Distinguisher for HC-128. 297
  
• S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan:
  Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction Without Pairing. 298
  
• Mathieu Baudet, David Lubicz, Julien Micolod, André Tassiaux:
  On the security of oscillator-based random number generators. 299
  
• M. Choudary Gorantla, Colin Boyd, Juan Manuel González Nieto:
  Universally Composable Contributory Group Key Exchange. 300
  
• Yuyin Yu, Mingsheng Wang:
  A Probabilistic Secret Sharing Scheme for a Compartmented Access Structure. 301
  
• María Naya-Plasencia, Andrea Röck, Jean-Philippe Aumasson, Yann Laigle-Chapuy, Gaëtan Leurent, Willi Meier, Thomas Peyrin:
  Cryptanalysis of ESSENCE. 302
  
• Evgeny A. Verbitskiy, Pim Tuyls, Chibuzo Obi, Berry Schoenmakers, Boris Skoric:
  Key extraction from general non-discrete signals. 303
  
• Koray Karabina:
  Factor-4 and 6 Compression of Cyclotomic Subgroups. 304
  
• Antoine Joux, Stefan Lucks:
  Improved generic algorithms for 3-collisions. 305
  
• Alina Oprea, Kevin D. Bowers:
  Authentic Time-Stamps for Archival Storage. 306
  
• Vishal Saraswat, Aaram Yun:
  Anonymous Signatures Revisited. 307
  
• S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan:
  A note on the Certificateless Multi-receiver Signcryption Scheme. 308
  
• Jean-Sébastien Coron, Antoine Joux, Ilya Kizhvatov, David Naccache, Pascal Paillier:
  Fault Attacks on RSA Signatures with Partially Unknown Messages. 309
  
• Chong Hee Kim, Gildas Avoine:
  RFID distance bounding protocol with mixed challenges to prevent relay attacks. 310
  
• G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
  Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security. 311
  
• Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, Ed Dawson:
  Jacobi Quartic Curves Revisited. 312
  
• Nigel P. Smart, Bogdan Warinschi:
  Identity Based Group Signatures from Hierarchical Identity-Based Encryption. 313
  
• Benny Pinkas, Thomas Schneider, Nigel P. Smart, Stephen C. Williams:
  Secure Two-Party Computation is Practical. 314
  
• Nigel P. Smart:
  Breaking RSA-based PIN Encryption with thirty ciphertext validity queries. 315
  
• Jayaprakash Kar, Banshidhar Majhi:
  An Efficient Password Security of Key Exchange Protocol based on ECDLP. 316
  
• Alex Biryukov, Dmitry Khovratovich:
  Related-key Cryptanalysis of the Full AES-192 and AES-256. 317
  
• Robert Erra, Christophe Grenier:
  The Fermat factorization method revisited. 318
  
• Xiaofeng Chen, Haibo Tian, Fangguo Zhang:
  Comments and Improvements on Chameleon Hashing Without Key Exposure Based on Factoring. 319
  
• Georg Fuchsbauer:
  Automorphic Signatures in Bilinear Groups and an Application to Round-Optimal Blind Signatures. 320
  
• Palash Sarkar:
  Tweakable Enciphering Schemes From Stream Ciphers With IV. 321
  
• Reynald Affeldt, David Nowak, Kiyoshi Yamada:
  Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS. 322
  
• Eric Brier, David Naccache, Mehdi Tibouchi:
  Factoring Unbalanced Moduli with Known Bits. 323
  
• Qiong Huang, Duncan S. Wong, Willy Susilo:
  Group-Oriented Fair Exchange of Signatures. 324
  
• Mridul Nandi:
  Characterizing Padding Rules of MD Hash Functions Preserving Collision Security. 325
  
• Gregory V. Bard:
  The Application of Polynomials over the Field of Two Elements to a Problem in Intellectual Property. 326
  
• Kaoru Kurosawa, Ryo Nojima:
  Simple Adaptive Oblivious Transfer Without Random Oracle. 327
  
• Boris Skoric, Marc X. Makkes:
  Flowchart description of security primitives for Controlled Physical Unclonable Functions. 328
  
• Mehreen Afzal, Ashraf Masood:
  Efficient Approximation of Higher Order Boolean function in a Low Order Function. 329
  
• Ehsan Malekian, Ali Zakerolhosseini, Atefeh Mashatan:
  NTRU, quaternion algebra, public key cryptography. 330
  
• Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan Warinschi:
  Security Notions and Generic Constructions for Client Puzzles. 331
  
• Ton van Deursen, Sasa Radomirovic:
  Untraceable RFID protocols are not trivially composable: Attacks on the revision of EC-RAC. 332
  
• Yupu Hu, Fengrong Zhang, Yiwei Zhang:
  Hard Fault Analysis of Trivium. 333
  
• Ewan Fleischmann, Michael Gorski, Stefan Lucks:
  Attacking Reduced Rounds of the ARIA Block Cipher. 334
  
• Ewan Fleischmann, Michael Gorski, Stefan Lucks:
  Related-Key Rectangle Attack of the Full 80-Round HAS-160 Encryption Mode. 335
  
• Mihir Bellare, Shanshan Duan:
  Partial Signatures and their Applications. 336
  
• Yanbin Pan, Yingpu Deng, Yupeng Jiang, Ziran Tu:
  A New Lattice-Based Cryptosystem Mixed with a Knapsack. 337
  
• Jue-Sam Chou, Chun-Hui Huang, Cheng-Chung Ding:
  Security weaknesses in two multi-server password based authentication protocols. 338
  
• Jue-Sam Chou, Yalin Chen, Ming-Hsun Cho, Hung-Min Sun:
  A Novel ID-based Electronic Cash System from Pairings. 339
  
• Eric Brier, Jean-Sébastien Coron, Thomas Icart, David Madore, Hugues Randriam, Mehdi Tibouchi:
  Efficient Indifferentiable Hashing into Ordinary Elliptic Curves. 340
  
• François-Xavier Standaert, Olivier Pereira, Yu Yu, Jean-Jacques Quisquater, Moti Yung, Elisabeth Oswald:
  Leakage Resilient Cryptography in Practice. 341
  
• Brian Baldwin, Andrew Byrne, Mark Hamilton, Neil Hanley, Robert P. McEvoy, Weibo Pan, William P. Marnane:
  FPGA Implementations of SHA-3 Candidates: CubeHash, Grøstl, Lane, Shabal and Spectral Hash. 342
  
• Kenneth Koon-Ho Wong, Gregory V. Bard, Robert H. Lewis:
  Partitioning Multivariate Polynomial Equations via Vertex Separators for Algebraic Cryptanalysis and Mathematical Applications. 343
  
• Xi Zhang, Min-Rong Chen, Xia Li:
  Comments on Shao-Cao's Unidirectional Proxy Re-Encryption Scheme from PKC 2009. 344
  
• Sunder Lal, Prashant Kushwah:
  Anonymous ID Based Signcryption Scheme for Multiple Receivers. 345
  
• Wenling Wu, Lei Zhang, Liting Zhang, Wentao Zhang:
  Security Analysis of the GF-NLFSR Structure and Four-Cell Block Cipher. 346
  
• Douglas Wikström:
  An Efficient Concurrent Repetition Theorem. 347
  
• Huang-Ta Huang, Jue-Sam Chou:
  A provably secure really source hiding designated verifier signature scheme based on random oracle model. 348
  
• Stefan Tillich, Martin Feldhofer, Wolfgang Issovits, Thomas Kern, Hermann Kureck, Michael Mühlberghuber, Georg Neubauer, Andreas Reiter, Armin Köfler, Mathias Mayrhofer:
  Compact Hardware Implementations of the SHA-3 Candidates ARIRANG, BLAKE, Gröstl, and Skein. 349
  
• Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan:
  Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles. 350
  
• David Cash, Dennis Hofheinz, Eike Kiltz:
  How to Delegate a Lattice Basis. 351
  
• Berndt M. Gammel, Stefan Mangard:
  On the Duality of Probing and Fault Attacks. 352
  
• Berkant Ustaoglu:
  Comparing SessionStateReveal and EphemeralKeyReveal for Diffie-Hellman protocols (extended version). 353
  
• Xin-jie Zhao, Tao Wang, Yuanyuan Zheng:
  Cache Timing Attacks on Camellia Block Cipher. 354
  
• Aniket Kate, Ian Goldberg:
  Asynchronous Distributed Private-Key Generators for Identity-Based Cryptography. 355
  
• Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin:
  A Domain Extender for the Ideal Cipher. 356
  
• Zhongming Wu, Xuejia Lai, Bo Zhu, Yiyuan Luo:
  Impossible Differential Cryptanalysis of FOX. 357
  
• Juan A. Garay, Vladimir Kolesnikov, Rae McLellan:
  MAC Precomputation with Applications to Secure Memory. 358
  
• Chris Peikert:
  Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography). 359
  
• Ruilin Li, Bing Sun, Chao Li:
  Distinguishing Attacks on a Kind of Generalized Unbalanced Feistel Network. 360
  
• Manoj Kumar:
  On the Security of a Proxy Blind Signature Scheme over Braid Groups. 361
  
• Laila El Aimani:
  Toward a Generic Construction of Convertible Undeniable Signatures from Pairing-Based Signatures. 362
  
• Dimitrios Poulakis:
  Some Lattices Attacks on DSA and ECDSA. 363
  
• Nishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky:
  Position Based Cryptography. 364
  
• Abhishek Parakh, Subhash Kak:
  Space Efficient Secret Sharing: A Recursive Approach. 365
  
• Yehuda Lindell, Hila Zarosim:
  Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. 366
  
• Qiong Huang, Willy Susilo, Duncan S. Wong:
  Non-delegatable Identity-based Designated Verifier Signature. 367
  
• Klaas Ole Kürtz, Henning Schnoor, Thomas Wilke:
  A Simulation-Based Treatment of Authenticated Message Exchange. 368
  
• Boris Skoric:
  Quantum readout of Physical Unclonable Functions: Remote authentication without trusted readers and authenticated Quantum Key Exchange without initial shared secrets. 369
  
• Nadia El Mrabet, Nicolas Guillermin, Sorina Ionica:
  A study of pairing computation for elliptic curves with embedding degree 15. 370
  
• Rakeshbabu Bobba, Himanshu Khurana, Manoj Prabhakaran:
  Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption. 371
  
• Rosario Gennaro, Shai Halevi:
  More on Key Wrapping. 372
  
• Gilad Asharov, Yehuda Lindell:
  Utility Dependence in Correct and Fair Rational Secret Sharing. 373
  
• Alex Biryukov, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich, Adi Shamir:
  Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds. 374
  
• Masao Kasahara:
  Forgotten Secret Recovering Scheme and Fuzzy Vault Scheme Constructed Based on Systematic Error-Correcting Codes. 375
  
• Markus Grassl, Ivana Ilic, Spyros S. Magliveras, Rainer Steinwandt:
  Cryptanalysis of the Tillich-Zémor hash function. 376
  
• Benoît Chevallier-Mames, Marc Joye:
  Chosen-Ciphertext Secure RSA-type Cryptosystems. 377
  
• Peter Novotney, Niels Ferguson:
  Detectable correlations in Edon-R. 378
  
• Sebastian Faust, Leonid Reyzin, Eran Tromer:
  Protecting Circuits from Computationally-Bounded Leakage. 379
  
• Carlo Blundo, Angelo De Caro, Giuseppe Persiano:
  Untraceable Tags based on Mild Assumptions. 380
  
• Habeeb Syed:
  A short Note on Discrete Log Problem in F_p. 381
  
• Eric Brier, Shahram Khazaei, Willi Meier, Thomas Peyrin:
  Linearization Framework for Collision Attacks: Application to CubeHash and MD6. 382
  
• Manoj Kumar:
  A Registration Scheme to Allocate a Unique Identification Number. 383
  
• Orr Dunkelman, Tor E. Bjørstad:
  Practical Attacks on NESHA-256. 384
  
• Brent Waters:
  Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions. 385
  
• Ehsan Malekian, Ali Zakerolhosseini, Atefeh Mashatan:
  QTRU: A Lattice Attack Resistant Version of NTRU. 386
  
• Rishab Nithyanand:
  Securing Plastic Money Using an RFID Based Protocol Stack. 387
  
• Kerem Kaskaloglu, Ferruh Özbudak:
  A Simple Secret Sharing Scheme for Hierarchical Threshold Access Structures. 388
  
• Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery:
  On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography. 389
  
• Jens Groth:
  Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments. 390
  
• Rikke Bendlin, Ivan Damgård:
  Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. 391
  
• Ralf Küsters, Max Tuengerthal:
  Computational Soundness for Key Exchange Protocols with Symmetric Encryption. 392
  
• Rajesh P. Singh, Soumen Maity:
  Permutation Polynomials modulo $p^n$}. 393
  
• Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata:
  Provably Secure Convertible Undeniable Signatures with Unambiguity. 394
  
• Helger Lipmaa:
  First CPIR Protocol with Data-Dependent Computation. 395
  
• Ueli Maurer, Stefano Tessaro:
  Computational Indistinguishability Amplification: Tight Product Theorems for System Composition. 396
  
• Joo Yeon Cho:
  Linear Cryptanalysis of Reduced-Round PRESENT. 397
  
• Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, Francisco Rodríguez-Henríquez:
  Fast Architectures for the eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves. 398
  
• Francesco Davì, Stefan Dziembowski, Daniele Venturi:
  Leakage-Resilient Storage. 399
  
• Xiaofeng Chen, Fangguo Zhang, Haibo Tian, Kwangjo Kim:
  Identity-Based Chameleon Hash Scheme Without Key Exposure. 400
  
• Mark Gondree, Payman Mohassel:
  Longest Common Subsequence as Private Search. 401
  
• Michael Vielhaber:
  AIDA Breaks BIVIUM (A&B) in 1 Minute Dual Core CPU Time. 402
  
• Laila El Aimani:
  On Generic Constructions of Designated Confirmer Signatures (The "Encryption of a Signature" Paradigm Revisited). 403
  
• Woo Sug Kang, Ki Taek Kim:
  Pairing-Friendly Elliptic Curves With Various Discriminants. 404
  
• Valérie Nachef, Jacques Patarin, Joana Treger:
  Generic Attacks on Misty Schemes -5 rounds is not enough-. 405
  
• Jacob C. N. Schuldt, Kanta Matsuura:
  On-line Non-transferable Signatures Revisited. 406
  
• Benjamin Bloom, Alan Kaminsky:
  Single Block Attacks and Statistical Tests on CubeHash. 407
  
• Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Claude Bajard:
  A Secure and Efficient Authenticated Diffie - Hellman Protocol. 408
  
• Abhishek Parakh, Subhash Kak:
  A Tree Based Recursive Scheme for Space Efficient Secret Sharing. 409
  
• S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich:
  Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. 410
  
• Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Schneider:
  Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima. 411
  
• Nathan Keller, Stephen D. Miller:
  Distinguishing Attacks on Stream Ciphers Based on Arrays of Pseudo-random Words. 412
  
• Jiang Wu, Douglas R. Stinson:
  Three Improved Algorithms for Multi-path Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission. 413
  
• Matthieu Finiasz, Nicolas Sendrier:
  Security Bounds for the Design of Code-based Cryptosystems. 414
  
• Ethan Heilman:
  Attacks Against Permute-Transform-Xor Compression Functions and Spectral Hash. 415
  
• Carsten Elsner, Martin Schmidt:
  KronCrypt - A New Symmetric Cryptosystem Based on Kronecker's Approximation Theorem. 416
  
• Harry Wiggins, Philip Hawkes, Gregory G. Rose, Cameron McDonald:
  More Di fferential Paths of TIB3. 417
  
• Mihir Bellare, Dennis Hofheinz, Eike Kiltz:
  Subtleties in the Definition of IND-CCA: When and How Should Challenge-Decryption be Disallowed? 418
  
• Jean-Sébastien Coron, Ilya Kizhvatov:
  An Efficient Method for Random Delay Generation in Embedded Software. 419
  
• Matthieu Rivain, Emmanuel Prouff, Julien Doget:
  Higher-order Masking and Shuffling for Software Implementations of Block Ciphers. 420
  
• Tsz Hon Yuen, Willy Susilo, Yi Mu:
  How to Construct Identity-Based Signatures without the Key Escrow Problem. 421
  
• Yossef Oren, Avishai Wool:
  Attacks on {RFID}-Based Electronic Voting Systems. 422
  
• Atsushi Fujioka, Koutarou Suzuki, Berkant Ustaoglu:
  Utilizing postponed ephemeral and pseudo-static keys in tripartite and identity-based key agreement protocols. 423
  
• Yaser Baseri, Amir S. Mortazavi, Maryam Rajabzadeh Asaar, Mohsen Pourpouneh, Javad Mohajeri:
  Double Voter Perceptible Blind Signature Based Electronic Voting Protocol. 424
  
• Vahid Jahandideh, Amir S. Mortazavi, Yaser Baseri, Javad Mohajeri:
  Cryptanalysis and Security Enhancement on the Generation of Mu-Varadharajan Electronic Voting Protocol. 425
  
• Daniel Pasaila, Vlad Alexa, Sorin Iftene:
  Cheating Detection and Cheater Identification in CRT-based Secret Sharing Schemes. 426
  
• Stephen R. Tate, Roopa Vishwanathan:
  Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols using Trusted Computing Technology. 427
  
• Jürg Wullschleger:
  Efficiently from Semi-honest to Malicious OT via OLFE. 428
  
• Ning Ding, Dawu Gu:
  Precise Time and Space Simulatable Zero-Knowledge. 429
  
• Kenneth G. Paterson, Douglas Stebila:
  One-time-password-authenticated key exchange. 430
  
• Yun Tian, Gongliang Chen, Jianhua Li:
  On the Design of Trivium. 431
  
• Huiyan Chen, Zichen Li, Yong Fang:
  Practical Distributed Key Generation Scheme. 432
  
• Arpita Patra, C. Pandu Rangan:
  Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience. 433
  
• Matthias Fitzi, Dominik Raub:
  Tight Bounds for Protocols with Hybrid Security. 434
  
• Laila El Aimani:
  Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm. 435
  
• M. Choudary Gorantla, Colin Boyd, Juan Manuel González Nieto:
  On the Connection between Signcryption and One-pass Key Establishment. 436
  
• Shengbao Wang:
  On the Relations Between Diffie-Hellman and ID-Based Key Agreement from Pairings. 437
  
• Jean-Philippe Aumasson, Çagdas Çalik, Willi Meier, Onur Özen, Raphael C.-W. Phan, Kerem Varici:
  Improved Cryptanalysis of Skein. 438
  
• Tzer-jen Wei, Lih-Chung Wang:
  A Fast Mental Poker Protocol. 439
  
• Albrecht Petzoldt, Johannes Buchmann:
  A Multivariate Signature Scheme with an almost cyclic public key. 440
  
• Jayaprakash Kar, Banshidhar Majhi:
  An Efficient Two-Party Identity-Based Key Exchange Protocol based on ECDLP. 441
  
• Rishab Nithyanand, Karthik Raman:
  Fuzzy Privacy Preserving Peer-to-Peer Reputation Management. 442
  
• Krystian Matusiewicz, María Naya-Plasencia, Ivica Nikolic, Yu Sasaki, Martin Schläffer:
  Rebound Attack on the Full LANE Compression Function. 443
  
• Zhijun Li, Guang Gong, Zhiguang Qin:
  Secure and Efficient HB-CM Entity Authentication Protocol. 444
  
• Andrew V. Sutherland:
  Computing Hilbert class polynomials with the Chinese Remainder Theorem. 445
  
• Ehsan Malekian, Ali Zakerolhosseini:
  Ntr¹u-like Public Key Cryptosystems beyond Dedekind Domain Up to Alternative Algebra. 446
  
• Sunil Pandey, Praveen Kaushik, S. C. Shrivastava:
  ROSSLER NONLINEAR DYNAMICAL MACHINE FOR CRYPTOGRAPHY APPLICATIONS. 447
  
• Ning Ding, Dawu Gu, Bart Preneel:
  Precise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds. 448
  
• Stefan Mangard, Elisabeth Oswald, François-Xavier Standaert:
  One for All - All for One: Unifying Standard DPA Attacks. 449
  
• Ali Aydin Selçuk, Kerem Kaskaloglu, Ferruh Özbudak:
  On Hierarchical Threshold Secret Sharing. 450
  
• Georg Lippold, Colin Boyd, Juan Manuel González Nieto:
  Efficient Certificateless KEM in the Standard Model. 451
  
• Christian Wieschebrink:
  Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes. 452
  
• Vlastimil Klíma, Petr Susil:
  A Note on Linear Approximations of BLUE MIDNIGHT WISH Cryptographic Hash Function. 453
  
• Jacob C. N. Schuldt, Kanta Matsuura:
  An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification. 454
  
• Fagen Li, Masaaki Shirase, Tsuyoshi Takagi:
  Identity-Based Hybrid Signcryption. 455
  
• Kimmo Halunen, Juha Kortelainen, Tuomas Kortelainen:
  An Automata-Theoretic Interpretation of Iterated Hash Functions - Application to Multicollisions. 456
  
• Nozomu Nishihara, Ryuichi Harasawa, Yutaka Sueyoshi, Aichi Kudo:
  A remark on the computation of cube roots in finite fields. 457
  
• Yun Wei, Guo-Hua Xiong, Xing-Kai Zhang, Wansu Bao:
  Security Analysis and Design of Proxy Signature Schemes over Braid Groups. 458
  
• Carmit Hazay, Yehuda Lindell:
  Efficient Oblivious Polynomial Evaluation with Simulation-Based Security. 459
  
• E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson:
  Asymptotic enumeration of correlation-immune boolean functions. 460
  
• Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh:
  A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC). 461
  
• S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Rangan:
  Certificateless KEM and Hybrid Signcryption Schemes Revisited. 462
  
• Benoît Gérard, Jean-Pierre Tillich:
  On Linear Cryptanalysis with Many Linear Approximations. 463
  
• Yong Wang, Huangdeng Wang:
  On Key Authentic Degree of Cryptosystem. 464
  
• Rishab Nithyanand, Gene Tsudik, Ersin Uzun:
  Readers Behaving Badly: Reader Revocation in PKI-Based RFID Systems. 465
  
• Daniel V. Bailey, Brian Baldwin, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Gauthier Van Damme, Giacomo de Meulenaer, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel:
  The Certicom Challenges ECC2-X. 466
  
• Yu Yu:
  The LPN Problem with Auxiliary Input. 467
  
• Julien Bringer, Hervé Chabanne, Thomas Icart:
  Password Based Key Exchange with Hidden Elliptic Curve Public Parameters. 468
  
• Rafik Chaabouni, Helger Lipmaa, Abhi Shelat:
  Additive Combinatorics and Discrete Logarithm Based Range Protocols. 469
  
• Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
  On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. 470
  
• Ryuichi Harasawa, Yutaka Sueyoshi, Aichi Kudo, Liang Cui:
  Improving the Berlekamp algorithm for binomials xⁿ-a. 471
  
• Madeline González Muñiz, Rainer Steinwandt:
  Cryptanalysis of a Message Recognition Protocol by Mashatan and Stinson. 472
  
• Kevin J. Compton, Brian Timm, Joel VanLaven:
  A Simple Power Analysis Attack on the Serpent Key Schedule. 473
  
• Scott Yilek:
  Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine. 474
  
• Koray Karabina:
  Double-Exponentiation in Factor-4 Groups and its Applications. 475
  
• Shujun Li, Hassan Jameel Asghar, Josef Pieprzyk, Ahmad-Reza Sadeghi, Roland Schmitz, Huaxiong Wang:
  On the Security of PAS (Predicate-based Authentication Service). 476
  
• Jian Guo, Krystian Matusiewicz:
  Preimages for Step-Reduced SHA-2. 477
  
• Søren Thomsen:
  Pseudo-cryptanalysis of the Original Blue Midnight Wish. 478
  
• Yu Sasaki, Lei Wang, Kazumaro Aoki:
  Preimage Attacks on 41-Step SHA-256 and 46-Step SHA-512. 479
  
• Sanjit Chatterjee, Alfred Menezes:
  On Cryptographic Protocols Employing Asymmetric Pairings - The Role of Psi Revisited. 480
  
• Erik-Oliver Blass, Kaoutar Elkhiyaoui, Refik Molva:
  PPS: Privacy Preserving Statistics using RFID Tags. 481
  
• Allison B. Lewko, Brent Waters:
  New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts. 482
  
• Jean-Charles Faugère, Ludovic Perret:
  On the Security of UOV. 483
  
• Meiqin Wang, Xiaoyun Wang, Keting Jia, Wei Wang:
  New Pseudo-Near-Collision Attack on Reduced-Round of Hamsi-256. 484
  
• Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai:
  Black-Box Circular-Secure Encryption Beyond Affine Functions. 485
  
• Allison B. Lewko, Brent Waters:
  Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants. 486
  
• Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
  Error Decodable Secret Sharing and One-Round Perfectly Secure Message Transmission for General Adversary Structures. 487
  
• Rajesh P. Singh, Anupam Saikia, B. K. Sarma:
  Little Dragon Two: An efficient Multivariate Public Key Cryptosystem. 488
  
• Jiali Choy, Huihui Yap:
  Impossible Boomerang Attack for Block Cipher Structures. 489
  
• Sang-Gon Lee:
  Cryptanalysis of Multiple-Server Password-Authenticated Key. 490
  
• Emiliano De Cristofaro, Gene Tsudik:
  Practical Private Set Intersection Protocols with Linear Computational and Bandwidth Complexity. 491
  
• Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
  Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. 492
  
• Zhengjun Cao:
  Remarks on Some Quantum Cryptographic Schemes. 493
  
• Masayuki Abe, Miyako Ohkubo:
  A Framework for Universally Composable Non-Committing Blind Signatures. 494
  
• Qingfeng Cheng, Chuangui Ma:
  Security Weakness in Two Authenticated Key Exchange Protocols. 495
  
• Ye Zhang, Nikos Mamoulis, David W. Cheung, Siu-Ming Yiu, W. K. Wong:
  Anonymous Fuzzy Identity-based Encryption for Similarity Search. 496
  
• Piotr Mroczkowski, Janusz Szmidt:
  Cube Attack on Courtois Toy Cipher. 497
  
• Chunbo Ma, Jun Ao:
  NTRU based group oriented signature. 498
  
• Chifumi Sato, Takeshi Okamoto, Eiji Okamoto:
  Underlying Assumptions and Designated Verifier Signatures. 499
  
• Nils Reimers:
  Key Recovery Attack on QuiSci. 500
  
• Joppe W. Bos, Dag Arne Osvik, Deian Stefan:
  Fast Implementations of AES on Various Platforms. 501
  
• Ruchi Gode, Sugata Gangopadhyay:
  On second order nonlinearities of cubic monomial Boolean functions. 502
  
• Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi:
  Fault Attacks Against EMV Signatures. 503
  
• Yongge Wang:
  Insecure "Provable Secure Network Coding". 504
  
• Hai Huang, Zhenfu Cao:
  Authenticated Key Exchange Protocols with Enhanced Freshness Properties. 505
  
• Mohammad Reza Reyhanitabar, Willy Susilo, Yi Mu:
  An Investigation of the Enhanced Target Collision Resistance Property for Hash Functions. 506
  
• Ahmad-Reza Sadeghi, Thomas Schneider, Immo Wehrenberg:
  Efficient Privacy-Preserving Face Recognition. 507
  
• Severin Winkler, Jürg Wullschleger:
  On the Efficiency of Classical and Quantum Oblivious Transfer Reductions. 508
  
• Valerie Gauthier Umana, Gregor Leander:
  Practical Key Recovery Attacks On Two McEliece Variants. 509
  
• Stefan Tillich, Martin Feldhofer, Mario Kirschbaum, Thomas Plos, Jörn-Marc Schmidt, Alexander Szekely:
  High-Speed Hardware Implementations of BLAKE, Blue Midnight Wish, CubeHash, ECHO, Fugue, Gröstl, Hamsi, JH, Keccak, Luffa, Shabal, SHAvite-3, SIMD, and Skein. 510
  
• Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai:
  Bounded Key-Dependent Message Security. 511
  
• Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs:
  Public-Key Encryption in the Bounded-Retrieval Model. 512
  
• David Xiao:
  (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks. 513
  
• M. Choudary Gorantla, Colin Boyd, Juan Manuel González Nieto, Mark Manulis:
  Generic One Round Group Key Exchange in the Standard Model. 514
  
• Hai Huang, Zhenfu Cao:
  Blake-Wilson, Johnson and Menezes Protocol Revisited. 515
  
• Axel Poschmann:
  Lightweight Cryptography - Cryptographic Engineering for a Pervasive World. 516
  
• Qiong Huang, Duncan S. Wong:
  New Constructions of Convertible Undeniable Signature Schemes without Random Oracles. 517
  
• Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo:
  Efficient Strong Designated Verifier Signature Schemes without Random Oracles or Delegatability. 518
  
• Juan A. Garay, Clint Givens, Rafail Ostrovsky:
  Secure Message Transmission with Small Public Discussion. 519
  
• Dominique Unruh, Jörn Müller-Quade:
  Universally Composable Incoercibility. 520
  
• Hung-Min Sun, Yalin Chen, Jue-Sam Chou:
  An Efficient Secure Oblivious Transfer. 521
  
• Daniel Shumow:
  Isogenies of Elliptic Curves: A Computational Approach. 522
  
• Benjamin Justus, Daniel Loebenberger:
  Differential Addition in generalized Edwards Coordinates. 523
  
• Petros Mol, Scott Yilek:
  Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions. 524
  
• Somindu C. Ramanna, Palash Sarkar:
  On Quantifying the Resistance of Concrete Hash Functions to Generic Multi-Collision Attacks. 525
  
• Jiazhe Chen, Keting Jia:
  Improved Related-Key Boomerang Attacks on Round-Reduced Threefish-512. 526
  
• Seiko Arita:
  An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme. 527
  
• Alexey Chilikov, Oleg Taraskin:
  New Fault Attack on Elliptic Curve Scalar Multiplication. 528
  
• Jan Camenisch, Maria Dubovitskaya, Gregory Neven:
  Oblivious Transfer with Access Control. 529
  
• Xigen Yao:
  A New Proposal Against the Main of Generic Attacks. 530
  
• Henri Gilbert, Thomas Peyrin:
  Super-Sbox Cryptanalysis: Improved Attacks for AES-like permutations. 531
  
• Sanjam Garg, Abishek Kumarasubramanian, Amit Sahai, Brent Waters:
  Building Efficient Fully Collusion-Resilient Traitor Tracing and Revocation Schemes. 532
  
• Dan Boneh, Karl Rubin, Alice Silverberg:
  Finding composite order ordinary elliptic curves using the Cocks-Pinch method. 533
  
• S. Wu:
  Weaknesses and improvement of three-party authenticated key exchange protocol using elliptic curve cryptography. 534
  
• S. Wu:
  Weakness of a three-party password-based authenticated key exchange protocol. 535
  
• S. Wu:
  Practical remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem. 536
  
• Jingguo Bi, Lidong Han, Xianmeng Meng:
  Cryptanalysis of two knapsack public-key cryptosystems. 537
  
• Johann Großschädl, Elisabeth Oswald, Dan Page, Michael Tunstall:
  Side-Channel Analysis of Cryptographic Software via Early-Terminating Multiplications. 538
  
• Yupeng Jiang, Yingpu Deng, Yanbin Pan:
  Covering Radius of Two-dimensional Lattices. 539
  
• David Mandell Freeman:
  Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups. 540
  
• Daniel V. Bailey, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Hsieh-Chung Chen, Chen-Mou Cheng, Gauthier Van Damme, Giacomo de Meulenaer, Luis J. Dominguez Perez, Junfeng Fan, Tim Güneysu, Frank K. Gürkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Ruben Niederhagen, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel, Anthony Van Herrewege, Bo-Yin Yang:
  Breaking ECC2K-130. 541
  
• Olivier Billet, Jacques Patarin, Yannick Seurin:
  Analysis of Intermediate Field Systems. 542
  
• Gildas Avoine, Muhammed Ali Bingöl, Süleyman Kardas, Cédric Lauradoux, Benjamin Martin:
  A Formal Framework for Cryptanalyzing RFID Distance Bounding Protocols. 543
  
• Patrick Solé, Natalia Tokareva:
  Connections between Quaternary and Binary Bent Functions. 544
  
• Ileana Buhan, Jeroen Doumen, Pieter H. Hartel:
  Fuzzy extractors for continuous distributions. 545
  
• Masao Kasahara:
  Construction of A New Class of Linear Multivariate Public Key Cryptosystem, K(I)SE(1)PKC. 546
  
• Rosario Gennaro, Craig Gentry, Bryan Parno:
  Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. 547
  
• Stéphane Ballet, Robert Rolland:
  A NOTE ON YAO'S THEOREM ABOUT PSEUDORANDOM GENERATORS. 548
  
• Koji Nuida:
  Making Collusion-Secure Codes (More) Robust against Bit Erasure. 549
  
• Yusuke Naito, Lei Wang, Kazuo Ohta:
  How to Construct Cryptosystems and Hash Functions in Weakened Random Oracle Models. 550
  
• Hongbo Zou:
  A Novel Design Method of Stream Ciphers Based on Table-Element Permutation. 551
  
• Jinmin Zhong, Xuejia Lai:
  Preimage Attacks on Reduced DHA-256. 552
  
• Maria Isabel Gonzalez Vasco, Angel L. Pérez del Pozo, Pedro Taborda Duarte:
  Cryptanalysis of a key exchange scheme based on block matrices. 553
  
• Thomas W. Cusick, Yuan Li, Pantelimon Stanica:
  On a Combinatorial Conjecture. 554
  
• Zhigang Gao, Dengguo Feng:
  An enhanced password authenticated key agreement protocol for wireless mobile network. 555
  
• Naomi Benger, Michael Scott:
  Constructing Tower Extensions for the implementation of Pairing-Based Cryptography. 556
  
• Yacov Yacobi:
  Towards a Theory of Trust Based Collaborative Search. 557
  
• Mariusz H. Jakubowski, Ramarathnam Venkatesan, Yacov Yacobi:
  Quantifying Trust. 558
  
• Yuechuan Wei, Bing Sun, Chao Li:
  New Integral Distinguisher for Rijndael-256. 559
  
• Manoj Kumar:
  On the Security Vulnerabilities of a Hash Based Strong Password Authentication Scheme. 560
  
• Yalin Chen, Jue-Sam Chou, Chun-Hui Huang:
  Improvements on two password-based authentication protocols. 561
  
• Stefan Dziembowski:
  How to pair with a human. 562
  
• Dabin Zheng, Xiangyong Zeng, Lei Hu:
  A Family of $p$-ary Binomial Bent Functions. 563
  
• Mingqiang Wang, Puwen Wei, Haifeng Zhang, Yuliang Zheng:
  Optimal pairing revisited. 564
  
• Robert Granger, Michael Scott:
  Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. 565
  
• Licheng Wang, Lihua Wang, Zhenfu Cao, Eiji Okamoto, Jun Shao:
  New Cryptosystems From CSP-Based Self-Distributive Systems. 566
  
• Daniel Smith-Tone:
  Properties of the Discrete Differential with Cryptographic Applications. 567
  
• Qingfeng Cheng, Chuangui Ma:
  Ephemeral key compromise attack on the IB-KA protocol. 568
  
• Rosario Gennaro, Jonathan Katz, Hugo Krawczyk, Tal Rabin:
  Secure Network Coding Over the Integers. 569
  
• Adriana C. B. Pinto, Rafael Dowsley, Kirill Morozov, Anderson C. A. Nascimento:
  Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model. 570
  
• Nigel P. Smart, Frederik Vercauteren:
  Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. 571
  
• Alexander W. Dent:
  On the Equivalence of Two Models for Key-Dependent-Message Encryption. 572
  
• Leibo Li, Mingqiang Wang, Zhanjiang Xia:
  New Addition Operation and Its Application for Scalar Multiplication on Hessian Curves over Prime Fields. 573
  
• Jeroen van de Graaf:
  Voting with unconditional privacy: CFSY for booth voting. 574
  
• Michael Tunstall, Debdeep Mukhopadhyay:
  Differential Fault Analysis of the Advanced Encryption Standard using a Single Fault. 575
  
• Vadim Lyubashevsky, Adriana Palacio, Gil Segev:
  Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. 576
  
• Claude Carlet:
  On the nonlinearity profile of the Dillon function. 577
  
• Wenjian Xie, Zhang Zhang:
  Efficient and Provably Secure Certificateless Signcryption from Bilinear Maps. 578
  
• Cong Wang, Sherman S. M. Chow, Qian Wang, Kui Ren, Wenjing Lou:
  Privacy-Preserving Public Auditing for Secure Cloud Storage. 579
  
• Daniel J. Bernstein, Tanja Lange:
  A complete set of addition laws for incomplete Edwards curves. 580
  
• Dhiman Saha, Debdeep Mukhopadhyay, Dipanwita Roy Chowdhury:
  A Diagonal Fault Attack on the Advanced Encryption Standard. 581
  
• Ralf Küsters, Tomasz Truderung, Andreas Vogt:
  A Game-Based Definition of Coercion-Resistance and its Applications. 582
  
• Charles Bouillaguet, Jean-Charles Faugère, Pierre-Alain Fouque, Ludovic Perret:
  Differential-Algebraic Algorithms for the Isomorphism of Polynomials Problem. 583
  
• Yu Liu, Kaijie Wu, Ramesh Karri:
  Scan-based Attacks on Linear Feedback Shift Register Based Stream Ciphers. 584
  
• Xin-jie Zhao, Tao Wang:
  An Improved Differential Fault Attack on Camellia. 585
  
• Rongquan Feng, Hongfeng Wu:
  A mean value formula for elliptic curves. 586
  
• Rajesh P. Singh, Anupam Saikia, B. K. Sarma:
  Poly-Dragon: An efficient Multivariate Public Key Cryptosystem. 587
  
• Alexander W. Dent, Marc Fischlin, Mark Manulis, Martijn Stam, Dominique Schröder:
  Confidential Signatures and Deterministic Signcryption. 588
  
• Christiane Peters:
  Information-set decoding for linear codes over Fq. 589
  
• David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev:
  More Constructions of Lossy and Correlation-Secure Trapdoor Functions. 590
  
• Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Schneider:
  Embedded SFE: Offloading Server and Network using Hardware Tokens. 591
  
• Ivan Damgård, Martin Geisler, Jesper Buus Nielsen:
  From Passive to Covert Security at Low Cost. 592
  
• Jin Li, Qian Wang, Cong Wang, Ning Cao, Kui Ren, Wenjing Lou:
  Enabling Efficient Fuzzy Keyword Search over Encrypted Data in Cloud Computing. 593
  
• Carmit Hazay, Kobbi Nissim:
  Efficient Set Operations in the Presence of Malicious Adversaries. 594
  
• Endre Bangerter, Jan Camenisch, Stephan Krenn:
  Efficiency Limitations for Sigma-Protocols for Group Homomorphisms. 595
  
• Jintai Ding, Vivien Dubois, Bo-Yin Yang, Chia-Hsin Owen Chen, Chen-Mou Cheng:
  Could SFLASH be repaired? 596
  
• Rongquan Feng, Menglong Nie, Hongfeng Wu:
  Twisted Jacobi Intersections Curves. 597
  
• Liqun Chen, Dan Page, Nigel P. Smart:
  On the Design and Implementation of an Efficient DAA Scheme. 598
  
• Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi:
  Groth-Sahai proofs revisited. 599
  
• Dario Fiore, Rosario Gennaro, Nigel P. Smart:
  Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement. 600
  
• Jens Hermans, Michael Schneider, Johannes Buchmann, Frederik Vercauteren, Bart Preneel:
  Parallel Shortest Lattice Vector Enumeration on Graphics Cards. 601
  
• Nils Ole Tippenhauer, Kasper Bonne Rasmussen, Srdjan Capkun:
  Secure Ranging With Message Temporal Integrity. 602
  
• Brian Baldwin, William P. Marnane:
  An FPGA Technologies Area Examination of the SHA-3 Hash Candidate Implementations. 603
  
• Eleanor Birrell, Salil P. Vadhan:
  Composition of Zero-Knowledge Proofs with Efficient Provers. 604
  
• Xavier Pujol, Damien Stehlé:
  Solving the Shortest Lattice Vector Problem in Time 2^2.465n. 605
  
• Claude Carlet:
  On a weakness of the Tu-Deng function and its repair. 606
  
• Ghassan Karame, Srdjan Capkun:
  Efficient Client Puzzles based on Repeated-Squaring. 607
  
• Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs:
  Non-Malleable Codes. 608
  
• Dang Nguyen Duc, Kwangjo Kim:
  Grouping-Proof Protocol for RFID Tags: Security Definition and Scalable Construction. 609
  
• Dang Nguyen Duc, Kwangjo Kim:
  Security Analysis of A Remote User Authentication Protocol by Liao and Wang. 610
  
• Lan Luo, Qionghai Dai, Zhiguang Qin, Chunxiang Xu:
  Golden Fish: An Intelligent Stream Cipher Fuse Memory Modules. 611
  
• Philippe Camacho:
  On the Impossibility of Batch Update for Cryptographic Accumulators. 612
  
• Tsutomu Iijima, Fumiyuki Momose, Jinhui Chao:
  Classification of Elliptic/hyperelliptic Curves with Weak Coverings against GHS Attack without Isogeny Condition. 613
  
• Ivan Damgård, Marcel Keller:
  Secure Multiparty AES (full paper). 614
  
• Craig Costello, Tanja Lange, Michael Naehrig:
  Faster Pairing Computations on Curves with High-Degree Twists. 615
  
• Marten van Dijk, Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
  Fully Homomorphic Encryption over the Integers. 616
  
• B. Umaprasada Rao, P. Vasudeva Reddy, T. Gowri:
  An efficient ID- based directed signature scheme from bilinear pairings. 617
  
• ZiJie Xu, Ke Xu:
  Data-Depend Hash Algorithm. 618
  
• Charles Bouillaguet, Pierre-Alain Fouque, Antoine Joux, Joana Treger:
  A Family of Weak Keys in HFE (and the Corresponding Practical Key-Recovery). 619
  
• Daniel R. L. Brown, Matthew J. Campagna, Scott A. Vanstone:
  Security of ECQV-Certified ECDSA Against Passive Adversaries. 620
  
• Tibor Jager, Jörg Schwenk:
  On the Analysis of Cryptographic Assumptions in the Generic Ring Model. 621
  
• Yun Wei, Guo-Hua Xiong, Wan-Su Bao, Xing-Kai Zhang:
  A Strong Blind Signature Scheme over Braid Groups. 622
  
• Masaaki Shirase:
  Universally Constructing 12-th Degree Extension Field for Ate Pairing. 623
  
• Jens Bender, Marc Fischlin, Dennis Kügler:
  Security Analysis of the PACE Key-Agreement Protocol. 624
  
• Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos:
  Cryptographic Accumulators for Authenticated Hash Tables. 625
  
• Santanu Sarkar, Subhamoy Maitra:
  Approximate Integer Common Divisor Problem relates to Implicit Factorization. 626
  
• Yiyuan Luo, Zhongming Wu, Xuejia Lai, Guang Gong:
  A Unified Method for Finding Impossible Differentials of Block Cipher Structures. 627
  
• Aniket Kate, Ian Goldberg:
  Using Sphinx to Improve Onion Routing Circuit Construction. 628
  
• Sergey Morozov, Abhranil Maiti, Patrick Schaumont:
  A Comparative Analysis of Delay Based PUF Implementations on FPGA. 629
  
• Eyal Kushilevitz, Yehuda Lindell, Tal Rabin:
  Information-Theoretically Secure Protocols and Security Under Composition. 630
  
• DaeHun Nyang, Mun-Kyu Lee:
  Improvement of Das's Two-Factor Authentication Protocol in Wireless Sensor Networks. 631
  
• Qiushi Yang, Yvo Desmedt:
  Cryptanalysis of Secure Message Transmission Protocols with Feedback. 632
  
• Michael J. Collins:
  Traitor-Tracing on Binary Strings. 633
  
• Charles Bouillaguet, Orr Dunkelman, Gaëtan Leurent, Pierre-Alain Fouque:
  Attacks on Hash Functions based on Generalized Feistel - Application to Reduced-Round Lesamnta and SHAvite-3_{512}. 634
  
• Kazukuni Kobara:
  Flexible Quasi-Dyadic Code-Based Public-Key Encryption and Signature. 635
  
• Haining Fan, Ming Gu, Jiaguang Sun, Kwok-Yan Lam:
  Obtaining More Karatsuba-Like Formulae over The Binary Field. 636
  
• Xiao-Shan Gao, Zhenyu Huang:
  Efficient Characteristic Set Algorithms for Equation Solving in Finite Fields and Application in Analysis of Stream Ciphers. 637
  
• Wei Yu, Kunpeng Wang, Bao Li:
  Reducing Elliptic Curve Logarithm to Logarithm in a Finite Field F_q for Some Orders. 638