Abstract is missing.
- How to Compute on Encrypted DataVinod Vaikuntanathan. 1-15 [doi]
- From Multiple Encryption to Knapsacks - Efficient Dissection of Composite ProblemsOrr Dunkelman. 16 [doi]
- Using the Cloud to Determine Key StrengthsThorsten Kleinjung, Arjen K. Lenstra, Dan Page, Nigel P. Smart. 17-39 [doi]
- A Unified Characterization of Completeness and Triviality for Secure Function EvaluationHemanta K. Maji, Manoj Prabhakaran, Mike Rosulek. 40-59 [doi]
- On the Non-malleability of the Fiat-Shamir TransformSebastian Faust, Markulf Kohlweiss, Giorgia Azzurra Marson, Daniele Venturi. 60-79 [doi]
- Another Look at Symmetric Incoherent Optimal Eavesdropping against BB84Arpita Maitra, Goutam Paul. 80-99 [doi]
- On-Line/Off-Line Leakage Resilient Secure Computation ProtocolsChaya Ganesh, Vipul Goyal, Satyanarayana V. Lokam. 100-119 [doi]
- Leakage Squeezing of Order TwoClaude Carlet, Jean-Luc Danger, Sylvain Guilley, Houssem Maghrebi. 120-139 [doi]
- ROSETTA for Single Trace AnalysisChristophe Clavier, Benoit Feix, Georges Gagnerot, Christophe Giraud, Mylène Roussellet, Vincent Verneuil. 140-155 [doi]
- Collision Attack on the Hamsi-256 Compression FunctionMario Lamberger, Florian Mendel, Vincent Rijmen. 156-171 [doi]
- Generalized Iterated Hash Fuctions Revisited: New Complexity Bounds for Multicollision AttacksTuomas Kortelainen, Ari Vesanen, Juha Kortelainen. 172-190 [doi]
- A Differential Fault Attack on the Grain Family under Reasonable AssumptionsSubhadeep Banik, Subhamoy Maitra, Santanu Sarkar. 191-208 [doi]
- Cryptanalysis of Pseudo-random Generators Based on Vectorial FCSRsThierry P. Berger, Marine Minier. 209-224 [doi]
- Faster Chosen-Key Distinguishers on Reduced-Round AESPatrick Derbez, Pierre-Alain Fouque, Jérémy Jean. 225-243 [doi]
- The Higher-Order Meet-in-the-Middle Attack and Its Application to the Camellia Block CipherJiqiang Lu, Yongzhuang Wei, Jongsung Kim, Enes Pasalic. 244-264 [doi]
- Double-SP Is Weaker Than Single-SP: Rebound Attacks on Feistel Ciphers with Several RoundsYu Sasaki. 265-282 [doi]
- Automatic Search of Truncated Impossible Differentials for Word-Oriented Block CiphersShengbao Wu, Mingsheng Wang. 283-302 [doi]
- High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous SystemJung-Woo Kim, Jungjoo Seo, Jin Hong 0001, Kunsoo Park, Sung-Ryul Kim. 303-316 [doi]
- Computing Small Discrete Logarithms FasterDaniel J. Bernstein, Tanja Lange. 317-338 [doi]
- Embedded Syndrome-Based HashingIngo von Maurich, Tim Güneysu. 339-357 [doi]
- Compact Hardware Implementations of the Block Ciphers mCrypton, NOEKEON, and SEAThomas Plos, Christoph Dobraunig, Markus Hofinger, Alexander Oprisnik, Christoph Wiesmeier, Johannes Wiesmeier. 358-377 [doi]
- Efficient Arithmetic on Elliptic Curves in Characteristic 2David Kohel. 378-398 [doi]
- A New Model of Binary Elliptic CurvesHongfeng Wu, Chunming Tang, Rongquan Feng. 399-411 [doi]
- Analysis of Optimum Pairing Products at High Security LevelsXusheng Zhang, Dongdai Lin. 412-430 [doi]
- Constructing Pairing-Friendly Genus 2 Curves with Split JacobianRobert Drylo. 431-453 [doi]
- Faster Batch Forgery IdentificationDaniel J. Bernstein, Jeroen Doumen, Tanja Lange, Jan-Jaap Oosterwijk. 454-473 [doi]
- Implementing CFSGregory Landais, Nicolas Sendrier. 474-488 [doi]
- SipHash: A Fast Short-Input PRFJean-Philippe Aumasson, Daniel J. Bernstein. 489-508 [doi]
- A Novel Permutation-Based Hash Mode of Operation FP and the Hash Function SAMOSASouradyuti Paul, Ekawat Homsirikamol, Kris Gaj. 509-527 [doi]
- Resistance against Adaptive Plaintext-Ciphertext Iterated DistinguishersAsli Bay, Atefeh Mashatan, Serge Vaudenay. 528-544 [doi]
- Sufficient Conditions on Padding Schemes of Sponge Construction and Sponge-Based Authenticated-Encryption SchemeDonghoon Chang. 545-563 [doi]