Result 1 to 20 of 84 total
Efficient dissection of composite problems, with applications to cryptanalysis, knapsacks, and combinatorial search problems. (English)
Safavi-Naini, Reihaneh (ed.) et al., Advances in cryptology ‒ CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19‒23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32008-8/pbk). Lecture Notes in Computer Science 7417, 719-740 (2012).
1
An experimentally verified attack on full Grain-128 using dedicated reconfigurable hardware. (English)
Lee, Dong Hoon (ed.) et al., Advances in cryptology ‒ ASIACRYPT 2011. 17th international conference on the theory and application of cryptology and information security, Seoul, South Korea, December 4‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25384-3/pbk). Lecture Notes in Computer Science 7073, 327-343 (2011).
2
PCP characterizations of NP: toward a polynomially-small error-probability. (English)
Comput. Complexity 20, No. 3, 413-504 (2011).
3
Probabilistically checkable proofs and codes. (English)
Bhatia, Rajendra (ed.) et al., Proceedings of the international congress of mathematicians (ICM 2010), Hyderabad, India, August 19‒27, 2010. Vol. I: Plenary lectures and ceremonies. Hackensack, NJ: World Scientific; New Delhi: Hindustan Book Agency (ISBN 978-981-4324-30-4/set; 978-81-85931-08-3/hbk; 978-981-4324-31-1/hbk; 978-981-4324-35-9/ebook). 265-285 (2011).
4
Derandomized parallel repetition via structured PCPs. (English)
Comput. Complexity 20, No. 2, 207-327 (2011).
5
Dense locally testable codes cannot have constant rate and distance. (English)
Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 507-518 (2011).
6
Dense locally testable codes cannot have constant rate and distance. (English)
Electron. Colloq. Comput. Complex. 18, 55 (2011).
7
Breaking Grain-128 with dynamic cube attacks. (English)
Joux, Antoine (ed.), Fast software encryption. 18th international workshop, FSE 2011, Lyngby, Denmark, February 13‒16, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-21701-2/pbk). Lecture Notes in Computer Science 6733, 167-187 (2011).
8
An improved algebraic attack on Hamsi-256. (English)
Joux, Antoine (ed.), Fast software encryption. 18th international workshop, FSE 2011, Lyngby, Denmark, February 13‒16, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-21701-2/pbk). Lecture Notes in Computer Science 6733, 88-106 (2011).
9
An experimentally verified attack on full grain-128 using dedicated reconfigurable hardware (English)
IACR Cryptology ePrint Archive 2011, 282 (2011).
10
New attacks on keccak-224 and keccak-256 (English)
IACR Cryptology ePrint Archive 2011, 624 (2011).
11
Improved attacks on full GOST (English)
IACR Cryptology ePrint Archive 2011, 558 (2011).
12
Breaking grain-128 with dynamic cube attacks (English)
FSE, 167-187 (2011).
13
An improved algebraic attack on hamsi-256 (English)
FSE, 88-106 (2011).
14
An experimentally verified attack on full grain-128 using dedicated reconfigurable hardware (English)
ASIACRYPT, 327-343 (2011).
15
Dense locally testable codes cannot have constant rate and distance (English)
APPROX-RANDOM, 507-518 (2011).
16
Composition of low-error 2-query PCPs using decodable PCPs. (English)
Goldreich, Oded (ed.), Property testing. Current research and surveys. Berlin: Springer (ISBN 978-3-642-16366-1/pbk). Lecture Notes in Computer Science 6390, 280-288 (2010).
17
The structure of winning strategies in parallel repetition games. (English)
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 518-530 (2010).
18
On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors. (English)
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 138-151 (2010).
19
Derandomized parallel repetition of structured pcps. (English)
Comput. Res. Repos. 2010, Article No. 1002.1606 (2010).
20
Result 1 to 20 of 84 total
Start
Contact
Print
General Help
