History


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

Result 1 to 20 of 26 total

Using elimination theory to construct rigid matrices. (English)
Comput. Complexity 23, No. 4, 531-563 (2014).
WorldCat.org
1
On-line/off-line leakage resilient secure computation protocols. (English)
Galbraith, Steven (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2012. 13th international conference on cryptology in India, Kolkata, India, December 9‒12, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34930-0/pbk). Lecture Notes in Computer Science 7668, 100-119 (2012).
WorldCat.org
2
Reconstruction of depth-4 multilinear circuits with top fan-in 2. (English)
Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19‒22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 625-642 (2012).
WorldCat.org
3
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).
WorldCat.org
4
Efficient reconstruction of random multilinear formulas. (English)
Ostrovsky, Rafail (ed.), Proceedings of the 2011 IEEE 52nd annual symposium on foundations of computer science ‒ FOCS 2011, Palm Springs, CA, USA, October 22‒25. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4571-4; 978-1-4577-1843-4/ebook). 778-787 (2011).
WorldCat.org
5
Forcing Out a Confession - Threshold Discernible Ring Signatures. (English)
SECRYPT, 379-388(2010)
WorldCat.org
6
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).
WorldCat.org
7
Using elimination theory to construct rigid matrices. (English)
Comput. Res. Repos. 2009, Article No. 0910.5301 (2009).
WorldCat.org
8
An observation about variations of the Diffie-Hellman assumption. (English)
Serdica J. Comput. 3, No. 3, 309-318 (2009).
WorldCat.org
9
Complexity lower bounds using linear algebra. (English)
Found. Trends Theor. Comput. Sci. 4, No. 1-2, 1-163 (2008).
WorldCat.org
10
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).
WorldCat.org
11
Vulnerabilities in anonymous credential systems. (English)
Electron. Notes Theor. Comput. Sci. 197, No. 2, 141-148 (2008).
WorldCat.org
12
An optimal lower bound for 2-query locally decodable linear codes. (English)
Inf. Process. Lett. 97, No. 6, 244-250 (2006).
WorldCat.org
13
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).
WorldCat.org
14
Lower bounds for adaptive locally decodable codes. (English)
Random Struct. Algorithms 27, No. 3, 358-378 (2005).
WorldCat.org
15
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).
WorldCat.org
16
Communication complexity of simultaneous messages. (English)
SIAM J. Comput. 33, No. 1, 137-166 (2003).
WorldCat.org
17
Graph complexity and slice functions. (English)
Theory Comput. Syst. 36, No. 1, 71-88 (2003).
WorldCat.org
18
Better Lower Bounds for Locally Decodable Codes. (English)
IEEE Conference on Computational Complexity, 184-193(2002)
WorldCat.org
19
Relations between communication complexity, linear arrangements, and computational complexity. (English)
Hariharan, Ramesh (ed.) et al., FST TCS 2001: Foundations of software technology and theoretical computer science. 21st conference, Bangalore, India, December 13‒15, 2001. Proceedings. Berlin: Springer (ISBN 3-540-43002-4). Lect. Notes Comput. Sci. 2245, 171-182 (2001).
WorldCat.org
20
first | previous | 1 21 | next | last

Result 1 to 20 of 26 total

Valid XHTML 1.0 Transitional Valid CSS!