History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 80 total

The Computational Benefit of Correlated Instances. (English)
ITCS, 219-228(2015)
1
Direct Sum Testing. (English)
ITCS, 327-336(2015)
2
Cryptanalysis of iterated even-mansour schemes with two keys. (English)
Sarkar, Palash (ed.) et al., Advances in cryptology ‒ ASIACRYPT 2014. 20th international conference on the theory and application of cryptology and information security, Kaoshiung, Taiwan, R.O.C., December 7‒11, 2014. Proceedings, Part I. Berlin: Springer (ISBN 978-3-662-45610-1/pbk). Lecture Notes in Computer Science 8873, 439-457 (2014).
3
Improved practical attacks on round-reduced Keccak. (English)
J. Cryptology 27, No. 2, 183-209 (2014).
4
Improved generic attacks against hash-based macs and HAIFA. (English)
Garay, Juan A. (ed.) et al., Advances in cryptology ‒ CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17‒21, 2014. Proceedings, Part I. Berlin: Springer (ISBN 978-3-662-44370-5/pbk). Lecture Notes in Computer Science 8616, 149-168 (2014).
5
Dissection: a new paradigm for solving bicomposite search problems. (English)
Commun. ACMCommun. ACM 57, N0. 10, 98-105(2014)
6
Direct Product Testing. (English)
IEEE Conference on Computational Complexity, 188-196(2014)
7
A Parallel Repetition Theorem for Entangled Projection Games. (English)
IEEE Conference on Computational Complexity, 197-208(2014)
8
Improved Differential Cryptanalysis of Round-Reduced Speck. (English)
Selected Areas in Cryptography, 147-164(2014)
9
Composition of low-error 2-query PCPs using decodable PCPs. (English)
SIAM J. Comput. 42, No. 6, 2452-2486 (2013).
10
Key recovery attacks on 3-round even-mansour, 8-step LED-128, and full $\mathrm{AES}^{2}$. (English)
Sako, Kazue (ed.) et al., Advances in cryptology ‒ ASIACRYPT 2013. 19th international conference on the theory and application of cryptology and information security, Bengaluru, India, December 1‒5, 2013. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-42032-0/pbk). Lecture Notes in Computer Science 8269, 337-356 (2013).
11
Clustering in the Boolean hypercube in a list decoding regime. (English)
Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8‒12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 413-424 (2013).
12
Special issue: Selected papers based on the presentations at the 27th annual IEEE conference on computational complexity (CCC 2012), Porto, Portugal, June 26‒29, 2012. (English)
Comput. Complexity 22, No. 2, 215-462 (2013).
13
Special Issue "Conference on Computational Complexity 2012" Guest editors’ foreword. (English)
Computational ComplexityComputational Complexity 22, N0. 2, 215-217(2013)
14
PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring. (English)
FOCS, 340-349(2013)
15
Covering CSPs. (English)
IEEE Conference on Computational Complexity, 207-218(2013)
16
Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials. (English)
FSE, 219-240(2013)
17
Applying cube attacks to stream ciphers in realistic scenarios. (English)
Cryptogr. Commun. 4, No. 3-4, 217-232 (2012).
18
New attacks on Keccak-224 and Keccak-256. (English)
Canteaut, Anne (ed.), Fast software encryption. 19th international workshop, FSE 2012, Washington, DC, USA, March 19‒21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34046-8/pbk). Lecture Notes in Computer Science 7549, 442-461 (2012).
19
Improved attacks on full GOST. (English)
Canteaut, Anne (ed.), Fast software encryption. 19th international workshop, FSE 2012, Washington, DC, USA, March 19‒21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34046-8/pbk). Lecture Notes in Computer Science 7549, 9-28 (2012).
20
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 80 total