Result 1 to 20 of 33 total
On black-box reductions between predicate encryption schemes. (English)
Cramer, Ronald (ed.), Theory of cryptography. 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19‒21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28913-2/pbk). Lecture Notes in Computer Science 7194, 440-457 (2012).
1
Forcing out a confession - threshold discernible ring signatures (English)
SECRYPT, 379-388 (2010).
2
Using elimination theory to construct rigid matrices. (English)
Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15‒17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPICS ‒ Leibniz International Proceedings in Informatics 4, 299-310, electronic only (2009).
3
Using elimination theory to construct rigid matrices. (English)
Comput. Res. Repos. 2009, Article No. 0910.5301 (2009).
4
An observation about variations of the Diffie-Hellman assumption. (English)
Serdica J. Comput. 3, No. 3, 309-318 (2009).
5
Complexity lower bounds using linear algebra. (English)
Found. Trends Theor. Comput. Sci. 4, No. 1-2, 1-163 (2008).
6
Using elimination theory to construct rigid matrices (English)
FSTTCS, 299-310 (2009).
7
Improved bounds on security reductions for discrete log based signatures. (English)
Wagner, David (ed.), Advances in cryptology ‒ CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17‒21, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85173-8/pbk). Lecture Notes in Computer Science 5157, 93-107 (2008).
8
Vulnerabilities in anonymous credential systems. (English)
Electron. Notes Theor. Comput. Sci. 197, No. 2, 141-148 (2008).
9
On the diffie-hellman assumption (English)
IACR Cryptology ePrint Archive 2008, 525 (2008).
10
Improved bounds on security reductions for discrete log based signatures (English)
CRYPTO, 93-107 (2008).
11
An optimal lower bound for 2-query locally decodable linear codes. (English)
Inf. Process. Lett. 97, No. 6, 244-250 (2006).
12
Quadratic lower bounds on matrix rigidity. (English)
Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. Third international conference, TAMC 2006, Beijing, China, May 15‒20, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34021-1/pbk). Lecture Notes in Computer Science 3959, 295-307 (2006).
13
Quadratic lower bounds on matrix rigidity (English)
TAMC, 295-307 (2006).
14
Lower bounds for adaptive locally decodable codes. (English)
Random Struct. Algorithms 27, No. 3, 358-378 (2005).
15
Lower bounds for adaptive locally decodable codes (English)
Random Struct. Algorithms 27, No. 3, 358-378 (2005).
16
Width-based algorithms for SAT and CIRCUIT-SAT. (Extended abstract). (English)
Giunchiglia, Enrico (ed.) et al., Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5‒8, 2003. Selected revised papers. Berlin: Springer (ISBN 3-540-20851-8/pbk). Lect. Notes Comput. Sci. 2919, 162-171 (2004).
17
Communication complexity of simultaneous messages. (English)
SIAM J. Comput. 33, No. 1, 137-166 (2003).
18
Graph complexity and slice functions. (English)
Theory Comput. Syst. 36, No. 1, 71-88 (2003).
19
Width-based algorithms for SAT and CIRCUIT-SAT: (Extended abstract) (English)
SAT, 162-171 (2003).
20
Result 1 to 20 of 33 total
Start
Contact
Print
General Help
