IACR Cryptology ePrint Archive, Volume 2007

Volume 2007, 2007

• Laura Hitt:
  Families of genus 2 curves with small embedding degree. 1
  
• Huang Lin, Zhenfu Cao:
  Cryptanalysis of An Oblivious Polynomial Evaluation Protocol Based On Polynomial Reconstruction Problem. 2
  
• Johann Großschädl, Alexander Szekely, Stefan Tillich:
  The Energy Cost of Cryptographic Key Establishment in Wireless Sensor Networks. 3
  
• Jue-Sam Chou, Yalin Chen, Chung-Ju Chan:
  Cryptanalysis of Hwang-Chang's a Time-Stamp Protocol for Digital Watermarking. 4
  
• Lan Nguyen:
  Privacy-Protecting Coupon System Revisited. 5
  
• Lan Nguyen:
  Efficient Dynamic k-Times Anonymous Authentication. 6
  
• Wei Gao, Xueli Wang, Guilin Wang, Fei Li:
  One-Round ID-Based Blind Signature Scheme without ROS Assumption. 7
  
• Dong Hoon Lee, Je Hong Park, Jae Woo Han:
  Security analysis of the variant of the self-shrinking generator proposed at ICISC 2006. 8
  
• Zhenfu Cao, Xiaolei Dong, Licheng Wang:
  New Public Key Cryptosystems Using Polynomials over Non-commutative Rings. 9
  
• David Freeman, Kristin Lauter:
  Computing endomorphism rings of Jacobians of genus 2 curves over finite fields. 10
  
• Jin Zhou, TingMao Chang, YaJuan Zhang, Yuefei Zhu:
  Universally Composable Key-evolving Signature. 11
  
• Atefeh Mashatan, Douglas R. Stinson:
  Interactive two-channel message authentication based on interactive-collision Resistant hash functions. 12
  
• Seiichi Matsuda, Naoki Kanayama, Florian Hess, Eiji Okamoto:
  Optimised versions of the Ate and Twisted Ate Pairings. 13
  
• Shai Halevi:
  Invertible Universal Hashing and the TET Encryption Mode. 14
  
• Aggelos Kiayias, Yiannis Tsiounis, Moti Yung:
  Group Encryption. 15
  
• Sean O'Neil, Benjamin Gittins, Howard A. Landman:
  VEST Ciphers. 16
  
• Bo Qin, Qianhong Wu, Willy Susilo, Yi Mu, Yumin Wang:
  Group Decryption. 17
  
• Sherman S. M. Chow, Kim-Kwang Raymond Choo:
  Strongly-Secure Identity-based Key Agreement and Anonymous Extension. 18
  
• Changshe Ma, Jian Weng, Dong Zheng:
  Fast Digital Signature Schemes as Secure as Diffie-Hellman Assumptions. 19
  
• Leonardo B. Oliveira, Diego F. Aranha, Eduardo Morais, Felipe Daguano, Julio López, Ricardo Dahab:
  TinyTate: Identity-Based Encryption for Sensor Networks. 20
  
• Alexander Maximov, Alex Biryukov:
  Two Trivial Attacks on Trivium. 21
  
• O. A. Logachev:
  On Perfectly Balanced Boolean Functions. 22
  
• Masayuki Abe, Yang Cui, Hideki Imai, Eike Kiltz:
  Efficient Hybrid Encryption from ID-Based Encryption. 23
  
• Gregory V. Bard, Nicolas Courtois, Chris Jefferson.:
  Efficient Methods for Conversion and Solution of Sparse Systems of Low-Degree Multivariate Polynomials over GF(2) via SAT-Solvers. 24
  
• Rafail Ostrovsky, Omkant Pandey, Amit Sahai:
  Private Locally Decodable Codes. 25
  
• Shengbao Wang, Zhenfu Cao, Maurizio Adriano Strangio, Lihua Wang:
  Cryptanalysis and Improvement of an Elliptic Curve Diffie-Hellman Key Agreement Protocol. 26
  
• Nachiketh R. Potlapally:
  Verifying Data Integrity with Few Queries to Untrusted Memory. 27
  
• Debrup Chakraborty, Palash Sarkar:
  HCH: A New Tweakable Enciphering Scheme Using the Hash-Counter-Hash Approach. 28
  
• Debrup Chakraborty, Palash Sarkar:
  A General Construction of Tweakable Block Ciphers and Different Modes of Operations. 29
  
• Yang Cui, Eiichiro Fujisaki, Goichiro Hanaoka, Hideki Imai, Rui Zhang:
  Formal Security Treatments for IBE-to-Signature Transformation: Relations among Security Notions. 30
  
• Mridul Nandi, Avradip Mandal:
  Improved Security Analysis of PMAC. 31
  
• Avradip Mandal, Mridul Nandi:
  An improved collision probability for CBC-MAC and PMAC. 32
  
• Eike Kiltz:
  From Selective-ID to Full Security: The Case of the Inversion-Based Boneh-Boyen IBE Scheme. 33
  
• An-Ping Li:
  A New Type of Cipher: DICING_CSB. 34
  
• Louis Goubin, Jean-Michel Masereel, Michaël Quisquater:
  Cryptanalysis of white box DES implementations. 35
  
• Eike Kiltz:
  Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman. 36
  
• Nicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis:
  Best Quadratic Approximations of Cubic Boolean Functions. 37
  
• Joo Yeon Cho, Josef Pieprzyk:
  Multiple Modular Additions and Crossword Puzzle Attack on NLSv2. 38
  
• Onur Aciiçmez, Shay Gueron, Jean-Pierre Seifert:
  New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures. 39
  
• Pradeep Kumar Mishra, Vassil S. Dimitrov:
  Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation. 40
  
• Boris Skoric, Stefan Katzenbeisser, Mehmet Utku Celik:
  Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes. 41
  
• Jiang Wu, Douglas R. Stinson:
  Authorship Proof for Textual Document. 42
  
• Orhun Kara:
  Reflection Attacks on Product Ciphers. 43
  
• Philip Hawkes, Cameron McDonald, Michael Paddon, Gregory G. Rose, Miriam Wiggers de Vries:
  Design and Primitive Specification for Shannon. 44
  
• Jean-Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
  A Coprocessor for the Final Exponentiation of the eta_T Pairing in Characteristic Three. 45
  
• Kaoru Kurosawa, Takeshi Koshiba:
  Direct Reduction of String (1, 2)-OT to Rabin's OT. 46
  
• Joonsang Baek, Willy Susilo, Jianying Zhou:
  New Constructions of Fuzzy Identity-Based Encryption. 47
  
• Daniel R. L. Brown, Kristian Gjøsteen:
  A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator. 48
  
• Jin Zhou, YaJuan Zhang, Yuefei Zhu:
  Security Arguments for a Class of ID-based Signatures. 49
  
• Vlastimil Klíma:
  Special block cipher family DN and new generation SNMAC-type hash function family HDN. 50
  
• Tri Van Le, Mike Burmester, Breno de Medeiros:
  Forward-secure RFID Authentication and Key Exchange. 51
  
• Di Ma, Gene Tsudik:
  Forward-Secure Sequential Aggregate Authentication. 52
  
• Manuel Barbosa, Andrew Moss, Dan Page:
  Compiler Assisted Elliptic Curve Cryptography. 53
  
• Souradyuti Paul:
  Cryptanalysis of Stream Ciphers Based on Arrays and Modular Addition. 54
  
• Andrey Bogdanov:
  Cryptanalysis of the KeeLoq block cipher. 55
  
• Somesh Jha, Stefan Katzenbeisser, Christian Schallhart, Helmut Veith, Stephen Chenney:
  Enforcing Semantic Integrity on Untrusted Clients in Networked Virtual Environments. 56
  
• David Freeman:
  Constructing pairing-friendly genus 2 curves over prime fields with ordinary Jacobians. 57
  
• Lilya Budaghyan:
  The simplest method for constructing APN polynomials EA-inequivalent to power functions. 58
  
• Rafail Ostrovsky, William E. Skeith III:
  A Survey of Single Database PIR: Techniques and Applications. 59
  
• Yonatan Aumann, Yehuda Lindell:
  Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. 60
  
• Neil Costigan, Michael Scott:
  Accelerating SSL using the Vector processors in IBM's Cell Broadband Engine for Sony's Playstation 3. 61
  
• Nicolas Courtois, Gregory V. Bard, David Wagner:
  Algebraic and Slide Attacks on KeeLoq. 62
  
• Lilya Budaghyan, Claude Carlet, Gregor Leander:
  Constructing new APN functions from known ones. 63
  
• Rafail Ostrovsky, William E. Skeith III:
  Algebraic Lower Bounds for Computing on Encrypted Data. 64
  
• Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba:
  How to Derive Lower Bound on Oblivious Transfer Reduction. 65
  
• Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi Shimoyama:
  Low-Density Attack Revisited. 66
  
• Man Ho Au, Joseph K. Liu, Tsz Hon Yuen, Duncan S. Wong:
  Efficient Hierarchical Identity Based Signature in the Standard Model. 68
  
• Dennis Y. W. Liu, Duncan S. Wong, Xinyi Huang, Guilin Wang, Qiong Huang, Yi Mu, Willy Susilo:
  Nominative Signature: Application, Security Model and Construction. 69
  
• Alexander Maximov:
  Two Linear Distinguishing Attacks on VMPC and RC4A and Weakness of RC4 Family of Stream Ciphers (Corrected). 70
  
• Ahto Buldas, Sven Laur:
  Knowledge-Binding Commitments with Applications in Time-Stamping (Full Version). 71
  
• Namin Yu, Howard M. Heys:
  A Hybrid Approach to Concurrent Error Detection for a Compact ASIC Implementation of the Advanced Encryption Standard. 72
  
• Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III:
  Public Key Encryption that Allows PIR Queries. 73
  
• Hovav Shacham:
  A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants. 74
  
• Gautham Sekar, Souradyuti Paul, Bart Preneel:
  Weaknesses in the Pseudorandom Bit Generation Algorithms of the Stream Ciphers TPypy and TPy. 75
  
• Kaoru Kurosawa, Kazuhiro Suzuki:
  Almost Secure (1-Round, n-Channel) Message Transmission Scheme. 76
  
• Sugata Gangopadhyay:
  On bent functions with zero second derivatives. 77
  
• Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli Maurer, Vassilis Zikas:
  MPC vs. SFE: Perfect Security in a Unified Corruption Model. 78
  
• Kazuhiro Suzuki, Kaoru Kurosawa:
  How To Find Many Collisions of 3-Pass HAVAL. 79
  
• Sujing Zhou, Dongdai Lin:
  Weakly only Unforgeable Signature and Its Application in Group Signature. 80
  
• Maurizio Adriano Strangio:
  Revisiting an Efficient Elliptic Curve Key Agreement Protocol. 81
  
• Shaoquan Jiang:
  Deniable Authentication on the Internet. 82
  
• Brett Hemenway, Rafail Ostrovsky:
  Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code. 83
  
• Sanjit Chatterjee, Palash Sarkar:
  Constant Size Ciphertext HIBE in the Augmented Selective-ID Model and its Extensions. 84
  
• Hongbo Yu, Xiaoyun Wang:
  MultiCollision Attack on the Compression Functions of MD4 and 3-Pass HAVAL. 85
  
• Ivan Damgård, Rune Thorbek:
  Non-Interactive Proofs for Integer Multiplication. 86
  
• Jie Liu, Jianhua Li:
  Improvement on a Digital Signature Scheme without using One-way Hash and Message Redundancy. 87
  
• Domingo Gómez, Jaime Gutierrez, Álvar Ibeas:
  An Algorithm for Finding Small Roots of Multivariate Polynomials over the Integers. 88
  
• Ueli Maurer, Dominik Raub:
  Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. 89
  
• Chengqing Li, Shujun Li, Muhammad Asim, Juana Nunez, Gonzalo Álvarez, Guanrong Chen:
  On the security of an image encryption scheme. 90
  
• Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto:
  Arithmetic Operators for Pairing-Based Cryptography. 91
  
• Grzegorz Wojtenko:
  PRIME POINTS ON ELLIPTIC CURVES AND ITS IMPACT ON ECDLP. 92
  
• Claudio Soriente, Gene Tsudik, Ersin Uzun:
  HAPADEP: Human Asisted Pure Audio Device Pairing. 93
  
• Xavier Boyen:
  Mesh Signatures : How to Leak a Secret with Unwitting and Unwilling Participants. 94
  
• Qiong Huang, Duncan S. Wong:
  Generic Certificateless Encryption in the Standard Model. 95
  
• R. Wm. Gosper, Rich Schroeppel:
  Somos Sequence Near-Addition Formulas and Modular Theta Functions. 96
  
• Christian Robenhagen Ravnshøj:
  Large Cyclic Subgroups of Jacobians of Hyperelliptic Curves. 97
  
• Lilya Budaghyan, Claude Carlet:
  Classes of Quadratic APN Trinomials and Hexanomials and Related Structures. 98
  
• Jaime Gutierrez, Álvar Ibeas:
  Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits. 99
  
• Shengbao Wang, Zhenfu Cao:
  Practical Identity-Based Encryption (IBE) in Multiple PKG Environments and Its Applications. 100
  
• Yu Sasaki, Go Yamamoto, Kazumaro Aoki:
  Practical Password Recovery on an MD5 Challenge and Response. 101
  
• Ran Canetti, Ling Cheung, Nancy A. Lynch, Olivier Pereira:
  On the Role of Scheduling in Simulation-Based Security. 102
  
• Roberto Avanzi:
  Another Look at Square Roots and Traces (and Quadratic Equations) in Fields of Even Characteristic. 103
  
• Brecht Wyseur, Wil Michiels, Paul Gorissen, Bart Preneel:
  Cryptanalysis of White-Box DES Implementations with Arbitrary External Encodings. 104
  
• Nicholas A. Howgrave-Graham:
  Isodual Reduction of Lattices. 105
  
• Masao Kasahara:
  A generalization of Secret Sharing Scheme on the Basis of Recovering Algorithm, K-RA. 106
  
• Yasuyuki Murakami, Takeshi Nasako:
  Knapsack Public-Key Cryptosystem Using Chinese Remainder Theorem. 107
  
• Joo Yeon Cho, Josef Pieprzyk:
  An Improved Distinguisher for Dragon. 108
  
• Thomas Ristenpart, Phillip Rogaway:
  How to Enrich the Message Space of a Cipher. 109
  
• Woo Sug Kang:
  Construction of Pairing-Friendly Elliptic Curves. 110
  
• Qingsong Ye, Huaxiong Wang, Christophe Tartary:
  Privacy-Preserving Distributed Set Intersection. 111
  
• Koh-ichi Nagao:
  Decomposed Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field. 112
  
• Meng-Hui Lim, Sanggon Lee, Youngho Park, Hoonjae Lee:
  An Enhanced ID-based Deniable Authentication Protocol on Pairings. 113
  
• Guang Zeng, Wenbao Han, Kaicheng He:
  High Efficiency Feedback Shift Register: sigma-LFSR. 114
  
• Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
  Quadratic Almost Perfect Nonlinear Functions With Many Terms. 115
  
• Douglas R. Stinson, Jiang Wu:
  A Zero-Knowledge Identification and Key Agreement Protocol. 116
  
• Sihem Mesnager:
  Improving the lower bound on the higher order nonlinearity of Boolean functions with prescribed algebraic immunity. 117
  
• Shai Halevi, Yael Tauman Kalai:
  Smooth Projective Hashing and Two-Message Oblivious Transfer. 118
  
• Manoj Prabhakaran, Mike Rosulek:
  Rerandomizable RCCA Encryption. 119
  
• Erik Tews, Ralf-Philipp Weinmann, Andrei Pyshkin:
  Breaking 104 bit WEP in less than 60 seconds. 120
  
• Alexander W. Dent, Benoît Libert, Kenneth G. Paterson:
  Certificateless Encryption Schemes Strongly Secure in the Standard Model. 121
  
• Qiang Tang:
  On the Security of three Versions of the WAI Protocol in Chinese WLAN Implementation Plan. 122
  
• Berkant Ustaoglu:
  Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS. 123
  
• Benjamin Gittins, Howard A. Landman:
  Rebuttal of overtaking VEST. 124
  
• Jean Paul Degabriele, Kenneth G. Paterson:
  Attacking the IPsec Standards in Encryption-only Configurations. 125
  
• Sujing Zhou, Dongdai Lin:
  An Interesting Member ID-based Group Signature. 126
  
• Vanesa Daza, Javier Herranz, Paz Morillo, Carla Ràfols:
  CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts. 127
  
• Bruno Blanchet:
  Computationally Sound Mechanized Proofs of Correspondence Assertions. 128
  
• Cameron McDonald, Chris Charnes, Josef Pieprzyk:
  An Algebraic Analysis of Trivium Ciphers based on the Boolean Satisfiability Problem. 129
  
• Yuan Tian, Zhi-Yu Chen, Yuee Jin, Feng Jin, Huihui Ma:
  Some Results on Anonymity in Hybrid Encryption. 130
  
• Mohammad Reza Reyhanitabar, Shuhong Wang, Reihaneh Safavi-Naini:
  Noninteractive Manual Channel Message Authentication Based On eTCR Hash Functions. 131
  
• Aggelos Kiayias, Hong-Sheng Zhou:
  Equivocal Blind Signatures and Adaptive UC-Security. 132
  
• Helger Lipmaa:
  New Communication-Efficient Oblivious Transfer Protocols Based on Pairings. 133
  
• Osman Kocar:
  Estimation of keys stored in CMOS cryptographic device after baking by using the charge shift. 134
  
• Jingwei Liu, Rong Sun, Weidong Kou, Xinmei Wang:
  Efficient ID-based Signature Without Trusted PKG. 135
  
• Jingwei Liu, Rong Sun, Weidong Kou, Xinmei Wang:
  Fair Exchange Signature Schemes. 136
  
• Jintai Ding, Bo-Yin Yang:
  Multivariates Polynomials for Hashing. 137
  
• Rongquan Feng, Hongfeng Wu:
  Efficient Pairing Computation on Curves. 138
  
• Amir Herzberg, Igal Yoffe:
  The Delivery and Evidences Layer. 139
  
• Aggelos Kiayias, Hong-Sheng Zhou:
  Hidden Identity-Based Signatures. 140
  
• Vivien Dubois, Pierre-Alain Fouque, Adi Shamir, Jacques Stern:
  Practical Cryptanalysis of SFLASH. 141
  
• Meng-Hui Lim, Sanggon Lee, Youngho Park, Hoonjae Lee:
  An Enhanced One-round Pairing-based Tripartite Authenticated Key Agreement Protocol. 142
  
• Ben Adida, Douglas Wikström:
  Offline/Online Mixing. 143
  
• T. Moh:
  Two New Examples of TTM. 144
  
• Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
  Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. 145
  
• Bessie C. Hu, Duncan S. Wong, Qiong Huang, Guomin Yang, Xiaotie Deng:
  Time Capsule Signature: Efficient and Provably Secure Constructions. 146
  
• Vladimir Shpilrain, Gabriel Zapata:
  Using decision problems in public key cryptography. 147
  
• Man Ho Au, Willy Susilo, Yi Mu:
  Practical Compact E-Cash. 148
  
• Ki Hyoung Ko, Jang-Won Lee, Tony Thomas:
  Towards Generating Secure Keys for Braid Cryptography. 149
  
• Christian Robenhagen Ravnshøj:
  Generators of Jacobians of Hyperelliptic Curves. 150
  
• Tal Moran, Moni Naor, Gil Segev:
  Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. 151
  
• Nicolas Courtois:
  CTC2 and Fast Algebraic Attacks on Block Ciphers Revisited. 152
  
• Aggelos Kiayias, Moti Yung:
  Cryptographic Hardness based on the Decoding of Reed-Solomon Codes. 153
  
• Danilo Gligoroski, Svein Johan Knapskog:
  Edon-R(256, 384, 512) - an Efficient Implementation of Edon-R} Family of Cryptographic Hash Functions. 154
  
• Jens Groth, Amit Sahai:
  Efficient Non-interactive Proof Systems for Bilinear Groups. 155
  
• Gergei Bana, Koji Hasebe, Mitsuhiro Okada:
  Computational Semantics for Basic Protocol Logic - A Stochastic Approach. 156
  
• David Madore:
  ConSum v0: An Experimental Cipher. 157
  
• Mridul Nandi:
  A Simple Security Analysis of Hash-CBC and a New Efficient One-Key Online Cipher. 158
  
• Dalia Khader:
  Attribute Based Group Signatures. 159
  
• Muxiang Zhang:
  Analysis of Collusion-Attack Free ID-Based Non-Interactive Key Sharing. 160
  
• Ling Cheung, Joseph A. Cooley, Roger I. Khazan, Calvin C. Newport:
  Collusion-Resistant Group Key Management Using Attribute-Based Encryption. 161
  
• Jens-Matthias Bohli, Jörn Müller-Quade, Stefan Röhrich:
  Bingo Voting: Secure and coercion-free voting using a trusted random number generator. 162
  
• Meng-Hui Lim, Sanggon Lee, Youngho Park, Sang-Jae Moon:
  Secure Deniable Authenticated Key Establishment for Internet Protocols. 163
  
• Onur Aciiçmez:
  Yet Another MicroArchitectural Attack: Exploiting I-cache. 164
  
• Arnab Roy, Anupam Datta, Ante Derek, John C. Mitchell:
  Inductive Proof Method for Computational Secrecy. 165
  
• Junghyun Nam:
  Enhancing Security of a Group Key Exchange Protocol for Users with Individual Passwords. 166
  
• Yi-Ru Liu, Wen-Guey Tzeng:
  Public Key Broadcast Encryption with Low Number of Keys and Constant Decryption Time (Version 2). 167
  
• Dominique Unruh:
  Random Oracles and Auxiliary Input. 168
  
• Michael Backes, Dominique Unruh:
  On the Security of Protocols with Logarithmic Communication Complexity. 169
  
• Stephane Lemieux, Adrian Tang:
  Clone Resistant Mutual Authentication for Low-Cost RFID Technology. 170
  
• Ran Canetti, Susan Hohenberger:
  Chosen-Ciphertext Secure Proxy Re-Encryption. 171
  
• Jan Camenisch, Susan Hohenberger, Michael Østergaard Pedersen:
  Batch Verification of Short Signatures. 172
  
• Xu An Wang, Xiaoyuan Yang, Yiliang Han:
  Provable Secure Generalized Signcryption. 173
  
• Cevahir Demirkiran, Enric Nart:
  Counting hyperelliptic curves that admit a Koblitz model. 174
  
• Christian Robenhagen Ravnshøj:
  Embedding Degree of Hyperelliptic Curves with Complex Multiplication. 175
  
• Elena Andreeva, Gregory Neven, Bart Preneel, Thomas Shrimpton:
  Seven-Property-Preserving Iterated Hashing: ROX. 176
  
• Dan Boneh, Craig Gentry, Michael Hamburg:
  Space-Efficient Identity Based Encryption Without Pairings. 177
  
• Dakshi Agrawal, Charanjit S. Jutla:
  Utility Sampling for Trust Metrics in PKI. 178
  
• Kwang Ho Kim, So In Kim, Ju Song Choe:
  New Fast Algorithms for Arithmetic on Elliptic Curves over Fields of Characteristic Three. 179
  
• Jue-Sam Chou, Yalin Chen, Tsung-Heng Chen:
  A Novel Secure Session Key Generation using two-level architecture For Cluster-Based Ad Hoc Networks Based On ID-Based Bilinear Paring. 180
  
• Kwang Ho Kim, So In Kim:
  A New Method for Speeding Up Arithmetic on Elliptic Curves over Binary Fields. 181
  
• Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum:
  Optimistic Fair Exchange in a Multi-user Setting. 182
  
• Ling Cheung, Calvin C. Newport:
  Provably Secure Ciphertext Policy ABE. 183
  
• Chunbo Ma, Jun Ao, Jianhua Li:
  Provable password-based tripartite key agreement protocol. 184
  
• Deukjo Hong, Donghoon Chang, Jaechul Sung, Sangjin Lee, Seokhie Hong, Jesang Lee, Dukjae Moon, Sungtaek Chee:
  New FORK-256. 185
  
• Jens Groth:
  Fully Anonymous Group Signatures without Random Oracles. 186
  
• Andrew Moss, Dan Page, Nigel P. Smart:
  Executing Modular Exponentiation on a Graphics Accelerator. 187
  
• Kim-Kwang Raymond Choo:
  A Proof of Revised Yahalom Protocol in the Bellare and Rogaway (1993) Model. 188
  
• Meng-Hui Lim, Sanggon Lee:
  An Improved One-Round ID-Based Tripartite Authenticated Key Agreement Protocol. 189
  
• Tian Yuan:
  Some General Results on Chosen-ciphertext Anonymity in Public-key Encryption. 190
  
• Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao, Bin Zhu:
  Deniable Internet Key-Exchange. 191
  
• Michael Scott:
  Optimal Irreducible Polynomials for GF(2^m) Arithmetic. 192
  
• Sunder Lal, Vandani Verma:
  Some Identity Based Strong Bi-Designated Verifier Signature Schemes. 193
  
• Ernie Brickell, Jiangtao Li:
  Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities. 194
  
• Ling Cheung, Sayan Mitra, Olivier Pereira:
  Verifying Statistical Zero Knowledge with Approximate Implementations. 195
  
• Rafael Castro, Ricardo Dahab:
  An Efficient Certificateless Signature Scheme. 196
  
• Mihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre:
  On-Line Ciphers and the Hash-CBC Constructions. 197
  
• Benedikt Gierlichs, Lejla Batina, Pim Tuyls:
  Mutual Information Analysis - A Universal Differential Side-Channel Attack. 198
  
• David Nowak:
  A Framework for Game-Based Security Proofs. 199
  
• Philip Atzemoglou, Tal Malkin:
  ProSiBIR: Proactive Signer-Base Intrusion Resilient Signatures. 200
  
• Hovav Shacham:
  The BBG HIBE Has Limited Delegation. 201
  
• Giuseppe Ateniese, Randal C. Burns, Reza Curtmola, Joseph Herring, Lea Kissner, Zachary N. J. Peterson, Dawn Song:
  Provable Data Possession at Untrusted Stores. 202
  
• Xin Jiang, Jintai Ding, Lei Hu:
  Kipnis-Shamir's Attack on HFE Revisited. 203
  
• Shu Yun Lim, Chuan Chin Pu, Hyotaek Lim, Hoon Jae Lee:
  Dragon-MAC: Securing Wireless Sensor Networks with Authenticated Encryption. 204
  
• Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik:
  A kilobit special number field sieve factorization. 205
  
• Pierre-Alain Fouque, Gaëtan Leurent, Phong Q. Nguyen:
  Automatic Search of Differential Path in MD4. 206
  
• Claude Carlet, Khoongming Khoo, Chu-Wee Lim, Chuan-Wen Loe:
  On an Improved Correlation Analysis of Stream Ciphers Using Muti-Output Boolean Functions and the Related Generalized Notion of Nonlinearity. 207
  
• Goutam Paul, Subhamoy Maitra:
  RC4 State Information at Any Stage Reveals the Secret Key. 208
  
• Liqun Chen, Qiang Tang:
  Bilateral Unknown Key-Share Attacks in Key Agreement Protocols. 209
  
• Xianhui Lu, Xuejia Lai, Dake He, Guomin Li:
  Efficient chosen ciphertext secure PKE scheme with short ciphertext. 210
  
• Chunbo Ma, Jun Ao, Jianhua Li:
  Scalable Storage Scheme from Forward Key Rotation. 211
  
• Andrey Khalyavin:
  The constructing of 3-resilient Boolean functions of 9 variables with nonlinearity 240. 212
  
• Sujing Zhou, Dongdai Lin:
  Unlinkable Randomizable Signature and Its Application in Group Signature. 213
  
• Eligijus Sakalauskas, Kestutis Luksys:
  Matrix Power S-Box Construction. 214
  
• Jesper Buus Nielsen:
  Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free. 215
  
• Pawel Pszona, Grzegorz Stachowiak:
  Unlinkable Divisible Digital Cash without Trusted Third Party. 216
  
• Ryuichi Sakai, Jun Furukawa:
  Identity-Based Broadcast Encryption. 217
  
• Eli Biham, Orr Dunkelman:
  Differential Cryptanalysis in Stream Ciphers. 218
  
• Liufei Wu, Yuqing Zhang, Fengjiao Wang:
  A New Provably Secure Authentication and Key Agreement Protocol for SIP Using ECC. 219
  
• Fengjiao Wang, Yuqing Zhang:
  A New Provably Secure Authentication and Key Agreement Mechanism for SIP Using Certificateless Public-key Cryptography. 220
  
• Michel Abdalla, Eike Kiltz, Gregory Neven:
  Generalized Key Delegation for Hierarchical Identity-Based Encryption. 221
  
• François-Xavier Standaert, Eric Peeters, Cédric Archambeau, Jean-Jacques Quisquater:
  Towards Security Limits in Side-Channel Attacks. 222
  
• John Black, Martin Cochran, Thomas Shrimpton:
  On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions. 223
  
• Jue-Sam Chou, Guey-Chuen Lee, Chung-Ju Chan:
  A Novel Mutual Authentication Scheme Based on Quadratic Residues for RFID Systems. 224
  
• Shengli Liu, Xiaofeng Chen, Fangguo Zhang:
  On the Forgeability of Wang-Tang-Li's ID-Based Restrictive Partially Blind Signature. 225
  
• Douglas R. Stinson:
  Generalized mix functions and orthogonal equitable rectangles. 226
  
• Darakhshan J. Mir, Poorvi L. Vora:
  Related-Key Statistical Cryptanalysis. 227
  
• Miaoqing Huang, Kris Gaj, Soonhak Kwon, Tarek A. El-Ghazawi:
  An Optimized Hardware Architecture of Montgomery Multiplication Algorithm. 228
  
• Ueli Maurer, Stefano Tessaro:
  Domain Extension of Public Random Functions: Beyond the Birthday Barrier. 229
  
• Gautham Sekar, Souradyuti Paul, Bart Preneel:
  New Weaknesses in the Keystream Generation Algorithms of the Stream Ciphers TPy and Py. 230
  
• Paul Bunn, Rafail Ostrovsky:
  Secure Two-Party k-Means Clustering. 231
  
• Xianhui Lu, Xuejia Lai, Dake He:
  A new paradigm of chosen ciphertext secure public key encryption scheme. 232
  
• Michael Backes, Markus Dürmuth, Ralf Küsters:
  On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. 233
  
• Alexandra Boldyreva, Virendra Kumar:
  Provable-Security Analysis of Authenticated Encryption in Kerberos. 234
  
• Matthew Green, Susan Hohenberger:
  Blind Identity-Based Encryption and Simulatable Oblivious Transfer. 235
  
• Sherman S. M. Chow, Wun-She Yap:
  Certificateless Ring Signatures. 236
  
• Marek Klonowski, Miroslaw Kutylowski, Michal Ren, Katarzyna Rybarczyk:
  Forward-secure Key Evolution in Wireless Sensor Networks. 237
  
• Stuart Haber:
  Long-lived digital integrity using short-lived hash functions. 238
  
• William R. Speirs, Ian Molloy:
  Making Large Hash Functions From Small Compression Functions. 239
  
• George I. Davida, Jeremy A. Hansen:
  A Four-Component Framework for Designing and Analyzing Cryptographic Hash Algorithms. 240
  
• Dalia Khader:
  Attribute Based Group Signature with Revocation. 241
  
• Khoongming Khoo, Guanhan Chew, Guang Gong, Hian-Kiat Lee:
  Time-Memory-Data Trade-off Attack on Stream Ciphers based on Maiorana-McFarland Functions. 242
  
• Ari Juels, Burton S. Kaliski Jr.:
  PORs: Proofs of Retrievability for Large Files. 243
  
• Martin Hlavác, Tomás Rosa:
  A Note on the Relay Attacks on e-passports: The Case of Czech e-passports. 244
  
• Mikhail J. Atallah, Marina Blanton, Keith B. Frikken:
  Incorporating Temporal Capabilities in Existing Key Management Schemes. 245
  
• Claudio Soriente, Gene Tsudik, Ersin Uzun:
  BEDA: Button-Enabled Device Pairing. 246
  
• Changan Zhao, Fangguo Zhang, Jiwu Huang:
  A Note on the Ate Pairing. 247
  
• Warren D. Smith:
  1. AES seems weak. 2. Linear time secure cryptography. 248
  
• Serge Fehr, Christian Schaffner:
  Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker. 249
  
• Hongzhen Du, Qiaoyan Wen:
  Efficient and Provably-Secure Certificateless Short Signature Scheme from Bilinear Pairings. 250
  
• Véronique Cortier, Ralf Küsters, Bogdan Warinschi:
  A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols. 251
  
• Roberto Araujo, Ricardo Felipe Custódio, Jeroen van de Graaf:
  A Verifiable Voting Protocol based on Farnel. 252
  
• Karl Rubin, Alice Silverberg:
  Choosing the correct elliptic curve in the CM method. 253
  
• Jun Shao, Zhenfu Cao, Licheng Wang, Xiaohui Liang:
  Fully Secure Proxy Re-Encryption without Random Oracles. 254
  
• S. Narayan:
  Efficient Identity Based Signature in Standard Model. 255
  
• Steven D. Galbraith, Florian Hess, Frederik Vercauteren:
  Aspects of Pairing Inversion. 256
  
• Dai-Rui Lin, Chih-I Wang:
  A Forward-Secure Signature with Backward-Secure Detection. 257
  
• Ulrich Kaiser:
  UICE: A High-Performance Cryptographic Module for SoC and RFID Applications. 258
  
• Ziran Tu, Yingpu Deng:
  Algebraic Immunity Hierarchy of Boolean Functions. 259
  
• Dennis Y. W. Liu, Qiong Huang, Duncan S. Wong:
  An Efficient One-move Nominative Signature Scheme. 260
  
• Subhamoy Maitra, Goutam Paul:
  New Form of Permutation Bias and Secret Key Leakage in Keystream Bytes of RC4. 261
  
• Yong Ho Hwang, Joseph K. Liu, Sherman S. M. Chow:
  Certificateless Public Key Encryption Secure against Malicious KGC Attacks in the Standard Model. 262
  
• Johannes Buchmann, Martin Döring, Richard Lindner:
  Efficiency Improvement for NTRU. 263
  
• Thomas Ristenpart, Scott Yilek:
  The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks. 264
  
• Jonathan Katz:
  Which Languages Have 4-Round Zero-Knowledge Proofs? 265
  
• Wei Han, Dong Zheng, Kefei Chen:
  Filling the Gap between Voters and Cryptography in e-Voting. 266
  
• Erel Geron, Avishai Wool:
  CRUST: Cryptographic Remote Untrusted Storage without Public Keys. 267
  
• Erik Dahmen, Katsuyuki Okeya, Daniel Schepers:
  Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography. 268
  
• Jeroen van de Graaf:
  Voting with Unconditional Privacy by Merging Prêt-à-Voter and PunchScan. 269
  
• David Chaum, Jeroen van de Graaf, Peter Y. A. Ryan, Poorvi L. Vora:
  Secret Ballot Elections with Unconditional Integrity. 270
  
• Mihir Bellare, Thomas Ristenpart:
  Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms. 271
  
• Willi Geiselmann, Rainer Steinwandt:
  Cryptanalysis of a Hash Function Proposed at ICISC 2006. 272
  
• Mihir Bellare, Sarah Shoup:
  Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir without Random Oracles. 273
  
• Chunbo Ma, Jun Ao, Jianhua Li:
  Group-based Proxy Re-encryption scheme. 274
  
• Zhixiong Chen, Guozhen Xiao:
  `Good' Pseudo-Random Binary Sequences from Elliptic Curves. 275
  
• Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng:
  Prolific Codes with the Identifiable Parent Property. 276
  
• Praveen Gauravaram, John Kelsey:
  Cryptanalysis of a class of cryptographic hash functions. 277
  
• Eli Biham, Orr Dunkelman:
  A Framework for Iterative Hash Functions - HAIFA. 278
  
• Chris Peikert, Brent Waters:
  Lossy Trapdoor Functions and Their Applications. 279
  
• Igor Semaev:
  On solving sparse algebraic equations over finite fields II. 280
  
• Grzegorz Wojtenko:
  A Pollard-like pseudorandom number generator over EC. 281
  
• Johannes Blömer, Volker Krummel:
  Analysis of countermeasures against access driven cache attacks on AES. 282
  
• Mark Manulis, Jörg Schwenk:
  Provably Secure Framework for Information Aggregation is Sensor Networks. 283
  
• Håvard Raddum, Igor Semaev:
  Solving MRHS linear equations. 285
  
• Daniel J. Bernstein, Tanja Lange:
  Faster addition and doubling on elliptic curves. 286
  
• Kevin Henry, Douglas R. Stinson, Jiayuan Sui:
  The Effectiveness of Receipt-Based Attacks on ThreeBallot. 287
  
• Dennis Hofheinz, Eike Kiltz:
  Secure Hybrid Encryption from Weakened Key Encapsulation. 288
  
• Michael Backes, Matteo Maffei, Dominique Unruh:
  Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol. 289
  
• Sumanta Sarkar, Subhamoy Maitra:
  Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on Odd Number of Variables. 290
  
• James Birkett, Alexander W. Dent:
  Relations Among Notions of Plaintext Awareness. 291
  
• Mridul Nandi:
  Improved security analysis of OMAC. 292
  
• Eun Sun Yoo, Koutarou Suzuki, Myung-Hwan Kim:
  Fully Resilient Traitor Tracing Scheme using Key Update. 293
  
• Julien Bringer, Hervé Chabanne, Thomas Icart:
  Improved Privacy of the Tree-Based Hash protocols using Physically Unclonable Function. 294
  
• Markku-Juhani O. Saarinen:
  Linearization Attacks Against Syndrome Based Hashes. 295
  
• Dooho Choi, Dong-Guk Han, Howon Kim:
  Construction of Efficient and Secure Pairing Algorithm and its Application. 296
  
• László Csirmaz:
  Secret sharing on infinite graphs. 297
  
• David A. McGrew, Scott R. Fluhrer:
  The Security of the Extended Codebook (XCB) Mode of Operation. 298
  
• Michael Scott, Piotr Szczechowiak:
  Optimizing Multiprecision Multiplication for Public Key Cryptography. 299
  
• Renji Tao:
  A Note on Automata-based Dynamic Convolutional Cryptosystems. 300
  
• Yuri L. Borissov, Moon Ho Lee, Svetla Nikova:
  On Asymptotic Behavior of the Ratio Between the Numbers of Binary Primitive and Irreducible Polynomials. 301
  
• Hidenori Kuwakado, Masakatu Morii:
  Compression Functions Suitable for the Multi-Property-Preserving Transform. 302
  
• Manoj Kumar:
  A Forward Secure Remote User Authentication Scheme. 303
  
• Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha:
  A Bound on the Size of Separating Hash Families. 304
  
• Goutam Paul, Subhamoy Maitra, Rohit Srivastava:
  On Non-Randomness of the Permutation after RC4 Key Scheduling. 305
  
• Thanh-Ha Le, Quoc-Thinh Nguyen-Vuong, Cécile Canovas, Jessy Clédière:
  Novel Approaches for Improving the Power Consumption Models in Correlation Analysis. 306
  
• Oleg A. Logachev:
  Locally Invertible Boolean Mappings. 307
  
• Selçuk Kavut, Melek Diker Yücel:
  Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions - 9 variable Boolean Functions with Nonlinearity 242. 308
  
• Subhamoy Maitra:
  Balanced Boolean Function on 13-variables having Nonlinearity strictly greater than the Bent Concatenation Bound. 309
  
• Kwang Ho Kim:
  A Note on Point Multiplication on Supersingular Elliptic Curves over Ternary Fields. 310
  
• Jean-Luc Beuchat, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto:
  A Refined Algorithm for the eta_T Pairing Calculation in Characteristic Three. 311
  
• Hyun-A Park, Bum Han Kim, Dong Hoon Lee, Yon Dohn Chung, Justin Zhan:
  Secure Similarity Search. 312
  
• Shengbao Wang, Zhenfu Cao, ZhaoHui Cheng, Kim-Kwang Raymond Choo:
  Perfect Forward Secure Identity-Based Authenticated Key Agreement Protocol in the Escrow Mode. 313
  
• Gilles Barthe, Benjamin Grégoire, Romain Janvier, Santiago Zanella Béguelin:
  Formal Certification of Code-Based Cryptographic Proofs. 314
  
• Shai Halevi, Hugo Krawczyk:
  Security under Key-Dependent Inputs. 315
  
• Sunder Lal, Priyam Sharma:
  Security Proof for Shengbao Wang's Identity-Based Encryption Scheme. 316
  
• Palash Sarkar:
  Improving Upon the TET Mode of Operation. 317
  
• Michael Neve, Kris Tiri:
  On the complexity of side-channel attacks on AES-256 - methodology and quantitative results on cache attacks. 318
  
• Guomin Yang, Duncan S. Wong, Qiong Huang, Xiaotie Deng:
  A New Security Definition for Public Key Encryption Schemes and Its Applications. 319
  
• Zhengjun Cao:
  On the Big Gap Between |p| and |q| in DSA. 320
  
• Selçuk Kavut, Melek Diker Yücel:
  Balanced Boolean Functions with Nonlinearity > 2^n-1 - 2^(n-1)/2. 321
  
• Jintai Ding, Richard Lindner:
  Identifying Ideal Lattices. 322
  
• Rafail Ostrovsky, Amit Sahai, Brent Waters:
  Attribute-Based Encryption with Non-Monotonic Access Structures. 323
  
• Mike Burmester, Breno de Medeiros:
  Towards provable security for route discovery protocols in mobile ad hoc networks. 324
  
• Rosario Gennaro:
  Faster and Shorter Password-Authenticated Key Exchange. 325
  
• Jun Shao, Zhenfu Cao, Licheng Wang, Rongxing Lu:
  Efficient Password-based Authenticated Key Exchange without Public Information. 326
  
• Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
  Secure Identification and QKD in the Bounded-Quantum-Storage Model. 327
  
• Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, Christian Schaffner:
  A Tight High-Order Entropic Quantum Uncertainty Relation With Applications. 328
  
• David Lubicz, Thomas Sirvent:
  A Tunable Broadcast Encryption Scheme. 329
  
• Yossi Oren:
  Remote Power Analysis of RFID Tags. 330
  
• Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
  Isolated Proofs of Knowledge and Isolated Zero Knowledge. 331
  
• Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
  Universally Composable Multiparty Computation with Partially Isolated Parties. 332
  
• Dennis Hofheinz, Dominique Unruh:
  Towards Key-Dependent Message Security in the Standard Model. 333
  
• Nishanth Chandran, Vipul Goyal, Amit Sahai:
  New Constructions for UC Secure Computation using Tamper-proof Hardware. 334
  
• Sergei Evdokimov, Oliver Günther:
  Encryption Techniques for Secure Database Outsourcing. 335
  
• Onur Aciiçmez, Werner Schindler:
  A Major Vulnerability in RSA Implementations due to MicroArchitectural Analysis Threat. 336
  
• Walter Bamberger, Oliver Welter, Stephan Spitz, Michael Marhöfer:
  Mobile Phones as Secure Gateways for Message-Based Ubiquitous Communication (Revised). 337
  
• Wei Dai, Ted Krovetz:
  VHASH Security. 338
  
• Chengqing Li, Guanrong Chen:
  On the security of a class of image encryption schemes. 339
  
• Motoi Yoshitomi, Tsuyoshi Takagi, Shinsaku Kiyomoto, Toshiaki Tanaka:
  Efficient Implementation of the Pairing on Mobilephones using BREW. 340
  
• Matthew K. Franklin, Mark Gondree, Payman Mohassel:
  Multi-Party Indirect Indexing and Applications. 341
  
• Fengjiao Wang, Yuqing Zhang:
  A New Security Model for Cross-Realm C2C-PAKE Protocol. 342
  
• Laura Hitt:
  Updated standards for validating elliptic curves. 343
  
• Liufei Wu, Yuqing Zhang, Fengjiao Wang:
  Security Analysis of WAPI Authentication and Key Exchange Protocol. 344
  
• Wilson Kan:
  Analysis of Underlying Assumptions in NIST DRBGs. 345
  
• Shailesh Vaya:
  Secure multi-party computation on incomplete networks. 346
  
• Aaram Yun, Je Hong Park, Jooyoung Lee:
  Lai-Massey Scheme and Quasi-Feistel Networks. 347
  
• Chris Peikert, Vinod Vaikuntanathan, Brent Waters:
  A Framework for Efficient and Composable Oblivious Transfer. 348
  
• Manoj Prabhakaran, Rui Xue:
  Statistically Hiding Sets. 349
  
• David Goldenberg, Susan Hohenberger, Moses Liskov, Elizabeth Crump Schwartz, Hakan Seyalioglu:
  On Tweaking Luby-Rackoff Blockciphers. 350
  
• Iftach Haitner, Jonathan J. Hoch, Gil Segev:
  A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. 351
  
• Somitra Kumar Sanadhya, Palash Sarkar:
  New Local Collisions for the SHA-2 Hash Family. 352
  
• Chris Studholme, Ian F. Blake:
  Multiparty Computation to Generate Secret Permutations. 353
  
• Cheng-Kang Chu, Wen-Guey Tzeng:
  Identity-Committable Signatures and Their Extension to Group-Oriented Ring Signatures. 354
  
• László Csirmaz:
  Secret sharing on the infinite ladder. 355
  
• Christophe Petit, François-Xavier Standaert, Olivier Pereira, Tal Malkin, Moti Yung:
  A Block Cipher based PRNG Secure Against Side-Channel Key Recovery. 356
  
• Michael Braun, Anton Kargl:
  A Note on Signature Standards. 357
  
• Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan:
  Improving the Round Complexity of VSS in Point-to-Point Networks. 358
  
• Stefan Dziembowski, Krzysztof Pietrzak:
  Intrusion-Resilient Secret Sharing. 359
  
• Andy Rupp, Gregor Leander, Endre Bangerter, Ahmad-Reza Sadeghi, Alexander W. Dent:
  Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems. 360
  
• Toshihiko Matsuo:
  Proxy Re-encryption Systems for Identity-based Encryption. 361
  
• Mohamed Abo El-Fotouh, Klaus Diepold:
  Statistical Testing for Disk Encryption Modes of Operations. 362
  
• Lukasz Chmielewski, Jaap-Henk Hoepman:
  Fuzzy Private Matching (Extended Abstract). 363
  
• Doug Kuhlman, Ryan Moriarty, Tony Braskich, Steve Emeott, Mahesh V. Tripunitara:
  A Proof of Security of a Mesh Security Architecture. 364
  
• Christian Robenhagen Ravnshøj:
  Pairings on Jacobians of Hyperelliptic Curves. 365
  
• Jintai Ding, Bo-Yin Yang, Chen-Mou Cheng, Chia-Hsin Owen Chen, Vivien Dubois:
  Breaking the Symmetry: a Way to Resist the New Differential Attack. 366
  
• Jintai Ding, John Wagner:
  Cryptanalysis of Rational Multivariate Public Key Cryptosystems. 367
  
• Vipul Goyal:
  Reducing Trust in the PKG in Identity Based Cryptosystems. 368
  
• Vipul Goyal, Jonathan Katz:
  Universally Composable Multi-Party Computation with an Unreliable Common Reference String. 369
  
• Claude Carlet, Xiangyong Zeng, Chunlei Li, Lei Hu:
  Further Properties of Several Classes of Boolean Functions with Optimum Algebraic Immunity. 370
  
• Chunbo Ma, Jun Ao, Jianhua Li:
  Group-oriented encryption secure against collude attack. 371
  
• Zhengjun Cao:
  On the Authentication of One Popular Signcryption Scheme. 372
  
• Markku-Juhani O. Saarinen:
  A Meet-in-the-Middle Collision Attack Against the New FORK-256. 373
  
• Mathias Herrmann, Alexander May:
  On Factoring Arbitrary Integers with Known Bits. 374
  
• Gregory Hirshman:
  Further Musings on the Wang et al. MD5 Collision: Improvements and Corrections on the Work of Hawkes, Paddon, and Rose. 375
  
• Zhengjun Cao:
  An Efficient Range-Bounded Commitment Scheme. 376
  
• Rongquan Feng, Hongfeng Wu:
  Fast Point Multiplication on Elliptic Curves of Even Order. 377
  
• Sean O'Neil:
  Algebraic Structure Defectoscopy. 378
  
• Xiangyong Zeng, Lei Hu, Yang Yang, Wenfeng Jiang:
  On The Inequivalence Of Ness-Helleseth APN Functions. 379
  
• François Arnault, Thierry P. Berger, Cédric Lauradoux, Marine Minier:
  X-FCSR: a new software oriented stream cipher based upon FCSRs. 380
  
• Xuyun Nie, Xin Jiang, Lei Hu, Jintai Ding:
  Cryptanalysis of Two New Instances of TTM Cryptosystem. 381
  
• Kazukuni Kobara, Kirill Morozov, Raphael Overbeck:
  Oblivious Transfer via McEliece's PKC and Permuted Kernels. 382
  
• Meng-Hui Lim, Sanggon Lee, Hoonjae Lee:
  Cryptanalysis on Improved Chou et al.'s ID-Based Deniable Authentication Protocol. 383
  
• Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya:
  Non-Interactive Anonymous Credentials. 384
  
• Danilo Gligoroski:
  On the insecurity of interchanged use of OFB and CBC modes of operation. 385
  
• Tsz Hon Yuen, Man Ho Au, Joseph K. Liu, Willy Susilo:
  (Convertible) Undeniable Signatures without Random Oracles. 386
  
• John A. Clark, Juan E. Tapiador:
  Analysis of Local Optima in Block Ciphers. 387
  
• Peter Gazi, Martin Stanek:
  On Ciphertext Undetectability. 388
  
• Dragos Florin Ciocan, Salil P. Vadhan:
  Interactive and Noninteractive Zero Knowledge Coincide in the Help Model. 389
  
• Augusto Jun Devegili, Michael Scott, Ricardo Dahab:
  Implementing Cryptographic Pairings over Barreto-Naehrig Curves. 390
  
• Reza Ebrahimi Atani, Shahabaddin Ebrahimi Atani, Sattar Mirzakuchaki:
  A novel public key crypto system based on semi-modules over quotient semi-rings. 391
  
• Jonathan T. Trostle, Andy Parrish:
  Efficient Computationally Private Information Retrieval From Anonymity or Trapdoor Groups. 392
  
• Haining Fan, Jiaguang Sun, Ming Gu, Kwok-Yan Lam:
  Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms. 393
  
• Juan A. Garay, Rafail Ostrovsky:
  Almost-everywhere Secure Computation. 394
  
• Charles Bouillaguet, Pierre-Alain Fouque, Adi Shamir, Sébastien Zimmer:
  Second Preimage Attacks on Dithered Hash Functions. 395
  
• Jun Shao, Zhenfu Cao, Licheng Wang, Xiaohui Liang:
  Proxy Re-Signature Schemes without Random Oracles. 396
  
• Chengqing Li, Shujun Li, Muhammad Asim, Juana Nunez, Gonzalo Álvarez, Guanrong Chen:
  On the security defects of an image encryption scheme. 397
  
• Li Kang, Xiaohu Tang, Xianhui Lu, Jia Fan:
  A Short Signature Scheme in the Standard Model. 398
  
• Carl M. Ellison:
  Ceremony Design and Analysis. 399
  
• Sunder Lal, Priyam Sharma:
  Remarks on IBE Scheme of Wang and Cao. 400
  
• Neal Koblitz:
  Another Look at Automated Theorem-Proving. 401
  
• Mike Burmester, Breno de Medeiros, Rossana Motta:
  Robust, Anonymous RFID Authentication with Constant Key-Lookup. 402
  
• Danilo Gligoroski, Svein Johan Knapskog:
  Turbo SHA-2. 403
  
• Jonathan Katz, Amit Sahai, Brent Waters:
  Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. 404
  
• Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang, Jintai Ding:
  Secure PRNGs from Specialized Polynomial Maps over Any F_q. 405
  
• Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira:
  Modeling Computational Security in Long-Lived Systems. 406
  
• Mike Burmester, Breno de Medeiros, Rossana Motta:
  Provably Secure Grouping-proofs for RFID tags. 407
  
• Meiqin Wang:
  Differential Cryptanalysis of PRESENT. 408
  
• Thomas Shrimpton, Martijn Stam:
  Building a Collision-Resistant Compression Function from Non-Compressing Primitives. 409
  
• Daniel J. Bernstein, Tanja Lange:
  Inverted Edwards coordinates. 410
  
• Meng-Hui Lim, Sanggon Lee, Hoonjae Lee:
  Cryptanalysis on Improved One-round Lin-Li's Tripartite Key Agreement Protocol. 411
  
• Gideon Samid:
  Proposing a Master One-Way Function. 412
  
• Michael Vielhaber:
  Breaking ONE.FIVIUM by AIDA an Algebraic IV Differential Attack. 413
  
• Daniel J. Bernstein, Peter Birkner, Tanja Lange, Christiane Peters:
  Optimizing double-base elliptic-curve single-scalar multiplication. 414
  
• Meng-Hui Lim, Sanggon Lee, Hoonjae Lee:
  Cryptanalytic Flaws in Oh et al.'s ID-Based Authenticated Key Agreement Protocol. 415
  
• Donghoon Chang, Mridul Nandi, Jesang Lee, Jaechul Sung, Seokhie Hong:
  Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function. 416
  
• Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, Tsuyoshi Takagi:
  Algorithms and Arithmetic Operators for Computing the eta_T Pairing in Characteristic Three. 417
  
• Amit K. Awasthi:
  An Improved Remote User Authentication Scheme with Smart Cards using Bilinear Pairings. 418
  
• Leo Dorrendorf, Zvi Gutterman, Benny Pinkas:
  Cryptanalysis of the Random Number Generator of the Windows Operating System. 419
  
• Jiayuan Sui, Douglas R. Stinson:
  A Critical Analysis and Improvement of AACS Drive-Host Authentication. 420
  
• André Chailloux, Iordanis Kerenidis:
  The role of help in Classical and Quantum Zero-Knowledge. 421
  
• Man Ho Au, Siu-Ming Yiu:
  Structural Identity-Based Encryption. 422
  
• Laila El Aimani, Joachim von zur Gathen:
  Finding Low Weight Polynomial Multiples Using Lattices. 423
  
• Antoine Joux, David Naccache, Emmanuel Thomé:
  When e-th Roots Become Easier Than Factoring. 424
  
• Koray Karabina, Edlyn Teske:
  On prime-order elliptic curves with embedding degrees k=3, 4 and 6. 425
  
• Christine Abegail Antonio, Satoru Tanaka, Ken Nakamula:
  Implementing Cryptographic Pairings over Curves of Embedding Degrees 8 and 10. 426
  
• Sumanta Sarkar, Subhamoy Maitra:
  Idempotents in the Neighbourhood of Patterson-Wiedemann Functions having Walsh Spectra Zeros. 427
  
• Benjamin A. Smith:
  Isogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves. 428
  
• Michael Naehrig, Paulo S. L. M. Barreto, Peter Schwabe:
  On compressible pairings and their computation. 429
  
• Scott Contini, Krystian Matusiewicz, Josef Pieprzyk, Ron Steinfeld, Jian Guo, San Ling, Huaxiong Wang:
  Cryptanalysis of LASH. 430
  
• Tzer-jen Wei:
  Notions of Efficiency in Simulation Paradigm. 431
  
• Craig Gentry, Chris Peikert, Vinod Vaikuntanathan:
  Trapdoors for Hard Lattices and New Cryptographic Constructions. 432
  
• Fabien Coelho:
  An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol based on Merkle Trees. 433
  
• Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wang:
  Computing the Ate Pairing on Elliptic Curves with Embedding Degree k=9. 434
  
• Daniel R. L. Brown:
  Irreducibility to the One-More Evaluation Problems: More May Be Less. 435
  
• Gautham Sekar, Souradyuti Paul, Bart Preneel:
  New Attacks on the Stream Cipher TPy6 and Design of New Ciphers the TPy6-A and the TPy6-B. 436
  
• Cuauhtemoc Mancillas-López, Debrup Chakraborty, Francisco Rodríguez-Henríquez:
  Reconfigurable Hardware Implementations of Tweakable Enciphering Schemes. 437
  
• Alexandra Boldyreva, Craig Gentry, Adam O'Neill, Dae Hyun Yum:
  Ordered Multisignatures and Identity-Based Sequential Aggregate Signatures, with Applications to Secure Routing. 438
  
• Nam-Su Jho, Myung-Hwan Kim, Dowon Hong, Byung-Gil Lee:
  Multiparty Key Agreement Using Bilinear Map. 439
  
• Sunder Lal, K. K. Goyal:
  An Improved Remote User Authentication Scheme using Bilinear Pairings. 440
  
• Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, Ed Dawson:
  Faster Group Operations on Elliptic Curves. 441
  
• Neal Koblitz, Alfred Menezes:
  Another Look at Non-Standard Discrete Log and Diffie-Hellman Problems. 442
  
• M. Abdelaziz Elaabid, Sylvain Guilley, Philippe Hoogvorst:
  Template Attacks with a Power Model. 443
  
• Mikhail Lobanov:
  Tight bounds between algebraic immunity and nonlinearities of high orders. 444
  
• Gerold Grnauer:
  Proposal of a new efficient public key system for encryption and digital signatures. 445
  
• Carlos Aguilar Melchor, Philippe Gaborit:
  A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol. 446
  
• Xianhui Lu, Xuejia Lai, Dake He, Guomin Li:
  Weak adaptive chosen ciphertext secure hybrid encryption scheme. 447
  
• Sergiy Pometun:
  Generalized Correlation and Higher Order Nonlinearity for Probabilistic Algebraic Attacks Description. 448
  
• Jacques Patarin, Valérie Nachef, Côme Berbain:
  Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. 449
  
• Xiaohui Liang, Zhenfu Cao, Jun Shao, Huang Lin:
  Short Group Signature without Random Oracles. 450
  
• Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
  Precise Concurrent Zero Knowledge. 451
  
• Ezekiel J. Kachisa, Edward F. Schaefer, Michael Scott:
  Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field. 452
  
• Kenneth G. Paterson, Sriramkrishnan Srinivasan:
  On the Relations Between Non-Interactive Key Distribution, Identity-Based Encryption and Trapdoor Discrete Log Groups. 453
  
• Rafael Castro, Ricardo Dahab:
  Efficient Certificateless Signatures Suitable for Aggregation. 454
  
• Daniel J. Bernstein, Tanja Lange:
  Analysis and optimization of elliptic-curve single-scalar multiplication. 455
  
• Ning Ding, Dawu Gu:
  Precise Zero-Knowledge in Concurrent Setting. 456
  
• Christine Abegail Antonio, Satoru Tanaka, Ken Nakamula:
  Comparing Implementation Efficiency of Ordinary and Squared Pairings. 457
  
• Nenad Dedic, Danny Harnik, Leonid Reyzin:
  Saving Private Randomness in One-Way Functions and Pseudorandom Generators. 458
  
• Man Ho Au, Willy Susilo, Yi Mu:
  Practical Anonymous Divisible E-Cash From Bounded Accumulators. 459
  
• Timothy Atkinson, Marius Silaghi:
  Guarantees for Customers of Incentive Anonymizing Networks. 460
  
• Qiang Tang, Dongyao Ji:
  Verifiable Attribute-based Encryption. 461
  
• Siamak Fayyaz Shahandashti, Reihaneh Safavi-Naini:
  Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures. 462
  
• Gen Takahashi, Fumitaka Hoshino, Tetsutaro Kobayashi:
  Efficient GF(3m) Multiplication Algorithm for eta T Pairing. 463
  
• Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
  Secure Computation Without Authentication. 464
  
• Zheng Gong, Xuejia Lai, Kefei Chen:
  A Synthetic Indifferentiability Analysis of Some Block-Cipher-Based Hash Functions. 465
  
• Wei Wang, Xiaoyun Wang:
  Improved Impossible Differential Cryptanalysis of CLEFIA. 466
  
• André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan:
  Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. 467
  
• Xianhui Lu, Xuejia Lai, Dake He, Guomin Li:
  On the hash function of ODH assumption. 468
  
• Xun Yi, Raylin Tso, Eiji Okamoto:
  ID-Based Group Password-Authenticated Key Exchange. 469
  
• Bodo Möller, Andy Rupp:
  Faster Multi-Exponentiation through Caching: Accelerating (EC)DSA Signature Verification. 470
  
• Erik Tews:
  Attacks on the WEP protocol. 471
  
• Jean-Philippe Aumasson, Simon Fischer, Shahram Khazaei, Willi Meier, Christian Rechberger:
  New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba. 472
  
• Tatsuaki Okamoto:
  Authenticated Key Exchange and Key Encapsulation Without Random Oracles. 473
  
• Martin Cochran:
  Notes on the Wang et al. 2⁶³ SHA-1 Differential Path. 474
  
• Ran Canetti:
  Obtaining Universally Composable Security: Towards the Bare Bones of Trust. 475
  
• ZiJie Xu:
  Dynamic SHA. 476
  
• Andrey Bogdanov, Andrei Pyshkin:
  Algebraic Side-Channel Collision Attacks on AES. 477
  
• Dafna Kidron, Yehuda Lindell:
  Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs. 478
  
• Jiang Wu, Douglas R. Stinson:
  An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption. 479
  
• Junko Takahashi, Toshinori Fukunaga:
  Differential Fault Analysis on the AES Key Schedule. 480
  
• Xianhui Lu, Xuejia Lai, Dake He:
  MAC-free variant of KD04. 481
  
• Leonardo B. Oliveira, Michael Scott, Julio López, Ricardo Dahab:
  TinyPBC: Pairings for Authenticated Identity-Based Non-Interactive Key Distribution in Sensor Networks. 482