Abstract is missing.
- Is the Information Security King Naked?Basie von Solms. 1-7 [doi]
- Measurement Study on Malicious Web Servers in the .nz DomainChristian Seifert, Vipul Delwadia, Peter Komisarczuk, David Stirling, Ian Welch. 8-25 [doi]
- A Combinatorial Approach for an Anonymity MetricDang Vinh Pham, Dogan Kesdogan. 26-43 [doi]
- On Improving the Accuracy and Performance of Content-Based File Type IdentificationIrfan Ahmed, Kyung-suk Lhee, Hyunjung Shin, Manpyo Hong. 44-59 [doi]
- Attacking 9 and 10 Rounds of AES-256Ewan Fleischmann, Michael Gorski, Stefan Lucks. 60-72 [doi]
- Cryptographic Properties and Application of a Generalized Unbalanced Feistel Network StructureJiali Choy, Guanhan Chew, Khoongming Khoo, Huihui Yap. 73-89 [doi]
- Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHTOnur Özen, Kerem Varici, Cihangir Tezcan, Çelebi Kocair. 90-107 [doi]
- Improved Cryptanalysis of the Common Scrambling Algorithm Stream CipherLeonie Simpson, Matt Henricksen, Wun-She Yap. 108-121 [doi]
- Testing Stream Ciphers by Finding the Longest Substring of a Given DensitySerdar Boztas, Simon J. Puglisi, Andrew Turpin. 122-133 [doi]
- New Correlations of RC4 PRGA Using Nonzero-Bit DifferencesAtsuko Miyaji, Masahiro Sukegawa. 134-152 [doi]
- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain ExtendersMohammad Reza Reyhanitabar, Willy Susilo, Yi Mu. 153-170 [doi]
- Characterizing Padding Rules of MD Hash Functions Preserving Collision SecurityMridul Nandi. 171-184 [doi]
- Distinguishing Attack on the Secret-Prefix MAC Based on the 39-Step SHA-256Hongbo Yu, Xiaoyun Wang. 185-201 [doi]
- Inside the HypercubeJean-Philippe Aumasson, Eric Brier, Willi Meier, María Naya-Plasencia, Thomas Peyrin. 202-213 [doi]
- Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and OthersYu Sasaki, Kazumaro Aoki. 214-231 [doi]
- On the Weak Ideal Compression FunctionsAkira Numayama, Keisuke Tanaka. 232-248 [doi]
- Hardening the Network from the Friend WithinL. Jean Camp. 249 [doi]
- Reducing the Complexity in the Distributed Computation of Private RSA KeysPeter Lory. 250-263 [doi]
- Efficiency Bounds for Adversary Constructions in Black-Box ReductionsAhto Buldas, Aivo Jürgenson, Margus Niitsoo. 264-275 [doi]
- Building Key-Private Public-Key Encryption SchemesKenneth G. Paterson, Sriramkrishnan Srinivasan. 276-292 [doi]
- Multi-recipient Public-Key Encryption from Simulators in Security ProofsHarunaga Hiwatari, Keisuke Tanaka, Tomoyuki Asano, Koichi Sakumoto. 293-308 [doi]
- Fair Threshold Decryption with Semi-Trusted Third PartiesJeongdae Hong, Jinil Kim, Jihye Kim, Matthew K. Franklin, Kunsoo Park. 309-326 [doi]
- Conditional Proxy Broadcast Re-EncryptionCheng-Kang Chu, Jian Weng, Sherman S. M. Chow, Jianying Zhou, Robert H. Deng. 327-342 [doi]
- Security on Hybrid Encryption with the Tag-KEM/DEM FrameworkToshihide Matsuda, Ryo Nishimaki, Akira Numayama, Keisuke Tanaka. 343-359 [doi]
- A Highly Scalable RFID Authentication ProtocolJiang Wu, Douglas R. Stinson. 360-376 [doi]
- Strengthening the Security of Distributed Oblivious TransferK. Y. Cheong, Takeshi Koshiba, Shohei Nishiyama. 377-388 [doi]
- Towards Denial-of-Service-Resilient Key Agreement ProtocolsDouglas Stebila, Berkant Ustaoglu. 389-406 [doi]
- A Commitment-Consistent Proof of a ShuffleDouglas Wikström. 407-421 [doi]
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing CryptographyNadia El Mrabet, Christophe Nègre. 422-436 [doi]
- Random Order m-ary ExponentiationMichael Tunstall. 437-451 [doi]
- Jacobi Quartic Curves RevisitedHüseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, Ed Dawson. 452-468 [doi]