Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1214.94003].
Indexed articles:
Joux, Antoine, A tutorial on high performance computing applied to cryptanalysis. (Invited talk abstract), 1-7 [Zbl 1290.94096]
Menezes, Alfred, Another look at provable security. (Abstract), 8 [Zbl 1279.94101]
Joux, Antoine; Vitse, Vanessa, Cover and decomposition index calculus on elliptic curves made practical. Application to a previously unreachable curve over \(\mathbb{F}_{p^6}\), 9-26 [Zbl 1290.94097]
Faugère, Jean-Charles; Perret, Ludovic; Petit, Christophe; Renault, Guénaël, Improving the complexity of index calculus algorithms in elliptic curves over binary fields, 27-44 [Zbl 1290.94070]
Bogdanov, Andrey; Knudsen, Lars R.; Leander, Gregor; Standaert, Francois-Xavier; Steinberger, John; Tischhauser, Elmar, Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract), 45-62 [Zbl 1290.94044]
Gaži, Peter; Tessaro, Stefano, Efficient and optimally secure key-length extension for block ciphers via randomized cascading, 63-80 [Zbl 1290.94076]
Groce, Adam; Katz, Jonathan, Fair computation with rational players, 81-98 [Zbl 1290.94150]
Garg, Sanjam; Goyal, Vipul; Jain, Abhishek; Sahai, Amit, Concurrently secure computation in constant rounds, 99-116 [Zbl 1297.94069]
Yuen, Tsz Hon; Chow, Sherman S. M.; Zhang, Ye; Yiu, Siu Ming, Identity-based encryption resilient to continual auxiliary leakage, 117-134 [Zbl 1297.94114]
Unruh, Dominique, Quantum proofs of knowledge, 135-152 [Zbl 1298.81059]
Scafuro, Alessandra; Visconti, Ivan, On round-optimal zero knowledge in the bare public-key model, 153-171 [Zbl 1297.94101]
Kopp, Gene S.; Wiltshire-Gordon, John D., Robust coin flipping, 172-194 [Zbl 1297.94082]
Cevallos, Alfonso; Fehr, Serge; Ostrovsky, Rafail; Rabani, Yuval, Unconditionally-secure robust secret sharing with compact shares, 195-208 [Zbl 1297.94116]
Hofheinz, Dennis, All-but-many lossy trapdoor functions, 209-227 [Zbl 1279.94086]
Bellare, Mihir; Kiltz, Eike; Peikert, Chris; Waters, Brent, Identity-based (lossy) trapdoor functions and applications, 228-245 [Zbl 1297.94047]
Wee, Hoeteck, Dual projective hashing and its applications – lossy trapdoor functions and more, 246-262 [Zbl 1297.94109]
Bayer, Stephanie; Groth, Jens, Efficient zero-knowledge argument for correctness of a shuffle, 263-280 [Zbl 1297.94045]
Chase, Melissa; Kohlweiss, Markulf; Lysyanskaya, Anna; Meiklejohn, Sarah, Malleable proof systems and applications, 281-300 [Zbl 1297.94057]
Abe, Masayuki; Haralambiev, Kristiyan; Ohkubo, Miyako, Group to group commitments do not shrink, 301-317 [Zbl 1297.94039]
Lewko, Allison, Tools for simulating features of composite order bilinear groups in the prime order setting, 318-335 [Zbl 1297.94086]
Dunkelman, Orr; Keller, Nathan; Shamir, Adi, Minimalism in cryptography: the Even-Mansour scheme revisited, 336-354 [Zbl 1297.94065]
Dodis, Yevgeniy; Kiltz, Eike; Pietrzak, Krzysztof; Wichs, Daniel, Message authentication, revisited, 355-374 [Zbl 1297.94117]
Pandey, Omkant; Rouselakis, Yannis, Property preserving symmetric encryption, 375-391 [Zbl 1297.94097]
Khovratovich, Dmitry; Leurent, Gaëtan; Rechberger, Christian, Narrow-bicliques: cryptanalysis of full IDEA, 392-410 [Zbl 1297.94079]
Sasaki, Yu, Cryptanalyses on a Merkle-Damgård based MAC – almost universal forgery and distinguishing-\(H\) attacks, 411-427 [Zbl 1297.94099]
Moradi, Amir, Statistical tools flavor side-channel collision attacks, 428-445 [Zbl 1297.94092]
Coron, Jean-Sébastien; Naccache, David; Tibouchi, Mehdi, Public key compression and modulus switching for fully homomorphic encryption over the integers, 446-464 [Zbl 1297.94062]
Gentry, Craig; Halevi, Shai; Smart, Nigel P., Fully homomorphic encryption with polylog overhead, 465-482 [Zbl 1297.94071]
Asharov, Gilad; Jain, Abhishek; López-Alt, Adriana; Tromer, Eran; Vaikuntanathan, Vinod; Wichs, Daniel, Multiparty computation with low communication, computation and interaction via threshold FHE, 483-501 [Zbl 1297.94042]
Chen, Yuanmi; Nguyen, Phong Q., Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers, 502-519 [Zbl 1297.94059]
Becker, Anja; Joux, Antoine; May, Alexander; Meurer, Alexander, Decoding random binary linear codes in \(2^{n/20}\): how \(1 + 1 = 0\) improves information set decoding, 520-536 [Zbl 1291.94206]
Kakvi, Saqib A.; Kiltz, Eike, Optimal security proofs for full domain hash, revisited, 537-553 [Zbl 1297.94118]
Seurin, Yannick, On the exact security of Schnorr-type signatures in the random oracle model, 554-571 [Zbl 1290.94129]
Abdalla, Michel; Fouque, Pierre-Alain; Lyubashevsky, Vadim; Tibouchi, Mehdi, Tightly-secure signatures from lossy identification schemes, 572-590 [Zbl 1297.94115]
Okamoto, Tatsuaki; Takashima, Katsuyuki, Adaptively attribute-hiding (hierarchical) inner product encryption, 591-608 [Zbl 1297.94096]
Libert, Benoît; Peters, Thomas; Yung, Moti, Scalable group signatures with revocation, 609-627 [Zbl 1296.94155]
Mironov, Ilya; Pandey, Omkant; Reingold, Omer; Segev, Gil, Incremental deterministic public-key encryption, 628-644 [Zbl 1297.94091]
Bellare, Mihir; Dowsley, Rafael; Waters, Brent; Yilek, Scott, Standard security does not imply security against selective-opening, 645-662 [Zbl 1297.94046]
Hohenberger, Susan; Lewko, Allison; Waters, Brent, Detecting dangerous queries: a new approach for chosen ciphertext security, 663-681 [Zbl 1297.94077]
Boldyreva, Alexandra; Degabriele, Jean Paul; Paterson, Kenneth G.; Stam, Martijn, Security of symmetric encryption in the presence of ciphertext fragmentation, 682-699 [Zbl 1297.94053]
Micciancio, Daniele; Peikert, Chris, Trapdoors for lattices: simpler, tighter, faster, smaller, 700-718 [Zbl 1297.94090]
Banerjee, Abhishek; Peikert, Chris; Rosen, Alon, Pseudorandom functions and lattices, 719-737 [Zbl 1297.68071]
Lyubashevsky, Vadim, Lattice signatures without trapdoors, 738-755 [Zbl 1295.94111]