Vadhan, Salil
Overview
Works:  12 works in 54 publications in 1 language and 931 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor 
Classifications:  QA76, 004.015114 
Publication Timeline
.
Most widely held works by
Salil Vadhan
Theory of cryptography : 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, the Netherlands, February 2124, 2007
: proceedings by
Salil Vadhan(
)
18 editions published in 2007 in English and held by 546 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 4th Theory of Cryptography Conference, TCC 2007, held in Amsterdam, The Netherlands in February 2007. The 31 revised full papers presented were carefully reviewed and selected from 118 submissions. The papers are organized in topical sections on encryption, universally composable security, arguments and zero knowledge, notions of security, obfuscation, secret sharing and multiparty computation, signatures and watermarking, private approximation and blackbox reductions, and key establishment
18 editions published in 2007 in English and held by 546 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 4th Theory of Cryptography Conference, TCC 2007, held in Amsterdam, The Netherlands in February 2007. The 31 revised full papers presented were carefully reviewed and selected from 118 submissions. The papers are organized in topical sections on encryption, universally composable security, arguments and zero knowledge, notions of security, obfuscation, secret sharing and multiparty computation, signatures and watermarking, private approximation and blackbox reductions, and key establishment
Randomization and approximation techniques in computer science : international workshop RANDOM '97, Bologna, Italy, July 1112,1997
: proceedings by
José D. P Rolim(
Book
)
15 editions published in 2002 in English and held by 294 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'98, held in Barcelona, Spain, in October 1998. The 26 revised full papers presented were carefully reviewed and selected for inclusion in the proceedings. Also included are three invited contributions. Among the topics addressed are graph computation, derandomization, pattern matching, computational geometry, approximation algorithms, search algorithms, sorting, and networking algorithms
15 editions published in 2002 in English and held by 294 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'98, held in Barcelona, Spain, in October 1998. The 26 revised full papers presented were carefully reviewed and selected for inclusion in the proceedings. Also included are three invited contributions. Among the topics addressed are graph computation, derandomization, pattern matching, computational geometry, approximation algorithms, search algorithms, sorting, and networking algorithms
Pseudorandomness by
Salil Vadhan(
)
4 editions published between 2012 and 2014 in English and held by 48 WorldCat member libraries worldwide
This is a survey of pseudorandomness, the theory of efficiently generating objects that "look random" despite being constructed using little or no randomness. This theory has significance for a number of areas in computer science and mathematics, including computational complexity, algorithms, cryptography, combinatorics, communications, and additive number theory. Our treatment places particular emphasis on the intimate connections that have been discovered between a variety of fundamental "pseudorandom objects" that at first seem very different in nature: expander graphs, randomness extractors, listdecodable errorcorrecting codes, samplers, and pseudorandom generators. The structure of the presentation is meant to be suitable for teaching in a graduatelevel course, with exercises accompanying each section
4 editions published between 2012 and 2014 in English and held by 48 WorldCat member libraries worldwide
This is a survey of pseudorandomness, the theory of efficiently generating objects that "look random" despite being constructed using little or no randomness. This theory has significance for a number of areas in computer science and mathematics, including computational complexity, algorithms, cryptography, combinatorics, communications, and additive number theory. Our treatment places particular emphasis on the intimate connections that have been discovered between a variety of fundamental "pseudorandom objects" that at first seem very different in nature: expander graphs, randomness extractors, listdecodable errorcorrecting codes, samplers, and pseudorandom generators. The structure of the presentation is meant to be suitable for teaching in a graduatelevel course, with exercises accompanying each section
Theory of cryptography : proceedings(
)
1 edition published in 2007 in English and held by 12 WorldCat member libraries worldwide
1 edition published in 2007 in English and held by 12 WorldCat member libraries worldwide
A study of statistical zeroknowledge proofs by
Salil Vadhan(
Book
)
6 editions published between 1999 and 2013 in English and held by 10 WorldCat member libraries worldwide
6 editions published between 1999 and 2013 in English and held by 10 WorldCat member libraries worldwide
Randomization and Approximation Techniques in Computer Science : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA,
September 1315, 2002 Proceedings by
José D. P Rolim(
Book
)
2 editions published in 2002 in English and held by 6 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2002, held in Cambridge, MA, USA in September 2002. The 21 revised full papers presented were carefully reviewed and selected from 48 submissions. Among the topics addressed are coding, geometric computations, graph colorings, random hypergraphs, graph computations, lattice computations, proof systems, probabilistic algorithms, derandomization, constraint satisfaction, and web graphs analysis
2 editions published in 2002 in English and held by 6 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2002, held in Cambridge, MA, USA in September 2002. The 21 revised full papers presented were carefully reviewed and selected from 48 submissions. Among the topics addressed are coding, geometric computations, graph colorings, random hypergraphs, graph computations, lattice computations, proof systems, probabilistic algorithms, derandomization, constraint satisfaction, and web graphs analysis
The complexity of counting by
Salil Vadhan(
)
1 edition published in 1995 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 4 WorldCat member libraries worldwide
Can statistical zero knowledge be made noninteractive? : or on the relationship of SZK and NISZK by
Oded Goldreich(
Book
)
2 editions published in 1998 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We further extend the study, recently initiated by DeSantis et. al. (ICALP98) of noninteractive statistical zeroknowledge proofs. Our main focus is to compare the class NISZK of problems possessing such noninteractive proofs to the class SZK of problems possessing interactive statistical zeroknowledge proofs. Along these lines, we first show that if statistical zeroknowledge is nontrivial then so is noninteractive statistical zeroknowledge, where by nontrivial we mean that the class includes problems which are not solvable in probabilistic polynomialtime. (The hypothesis holds under various assumptions, such as the intractability of the Discrete Logarithm Problem.) Furthermore, we show that if NISZK is closed under complementation, then in fact SZK = NISZK, i.e. all statistical zeroknowledge proofs can be made noninteractive. The main tools in our analysis are two promise problems that are natural restrictions of promise problems known to be complete for SZK. We show that these restricted problems are in fact complete for NISZK, and using this relationship we derive our results comparing the two classes. The two problems refer to the statistical difference, and difference in entropy, respectively, of a given distribution from the uniform one. We also consider a weak form of NISZK, in which only requires that for every inverse polynomial 1/p(n), there exists a simulator which achieves simulator deviation 1/p(n), and show that this weak form of NISZK actually equals NISZK."
2 editions published in 1998 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We further extend the study, recently initiated by DeSantis et. al. (ICALP98) of noninteractive statistical zeroknowledge proofs. Our main focus is to compare the class NISZK of problems possessing such noninteractive proofs to the class SZK of problems possessing interactive statistical zeroknowledge proofs. Along these lines, we first show that if statistical zeroknowledge is nontrivial then so is noninteractive statistical zeroknowledge, where by nontrivial we mean that the class includes problems which are not solvable in probabilistic polynomialtime. (The hypothesis holds under various assumptions, such as the intractability of the Discrete Logarithm Problem.) Furthermore, we show that if NISZK is closed under complementation, then in fact SZK = NISZK, i.e. all statistical zeroknowledge proofs can be made noninteractive. The main tools in our analysis are two promise problems that are natural restrictions of promise problems known to be complete for SZK. We show that these restricted problems are in fact complete for NISZK, and using this relationship we derive our results comparing the two classes. The two problems refer to the statistical difference, and difference in entropy, respectively, of a given distribution from the uniform one. We also consider a weak form of NISZK, in which only requires that for every inverse polynomial 1/p(n), there exists a simulator which achieves simulator deviation 1/p(n), and show that this weak form of NISZK actually equals NISZK."
STOC'11 : proceedings of the 43th ACM Symposium on Theory of Computing, June 68, 2011, San Jose, California, USA(
Book
)
2 editions published in 2011 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 2011 in English and held by 2 WorldCat member libraries worldwide
The fortythird annual ACM symposium on theory of computing : (STOC 2011)(
)
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
Foundations and trends in theoretical computer science by
Salil Vadhan(
Book
)
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
This is a survey of pseudorandomness, the theory of efficiently generating objects that "look random" despite being constructed using little or no randomness. This theory has significance for a number of areas in computer science and mathematics, including computational complexity, algorithms, cryptography, combinatorics, communications, and additive number theory. Our treatment places particular emphasis on the intimate connections that have been discovered between a variety of fundamental "pseudorandom objects" that at first seem very different in nature: expander graphs, randomness extractors, listdecodable errorcorrecting codes, samplers, and pseudorandom generators. The structure of the presentation is meant to be suitable for teaching in a graduatelevel course, with exercises accompanying each section
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
This is a survey of pseudorandomness, the theory of efficiently generating objects that "look random" despite being constructed using little or no randomness. This theory has significance for a number of areas in computer science and mathematics, including computational complexity, algorithms, cryptography, combinatorics, communications, and additive number theory. Our treatment places particular emphasis on the intimate connections that have been discovered between a variety of fundamental "pseudorandom objects" that at first seem very different in nature: expander graphs, randomness extractors, listdecodable errorcorrecting codes, samplers, and pseudorandom generators. The structure of the presentation is meant to be suitable for teaching in a graduatelevel course, with exercises accompanying each section
Theory of cryptography (9783540709350) MWU0205 by
Salil Vadhan(
Book
)
1 edition published in 2007 in English and held by 1 WorldCat member library worldwide
1 edition published in 2007 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 International Association for Cryptologic Research
 Rolim, José D. P. Author Editor
 Theory of Cryptography Conference 2007 Amsterdam
 Sahai, Amit
 Goldreich, Oded Author
 Association for Computing Machinery (ACM)
 Pettie, Seth Editor
 Melkebeek, Dieter van Editor
 Watrous, John Editor
 ACM Special Interest Group for Algorithms and Computation Theory (SIGACT)
Useful Links
Associated Subjects
Algorithms Approximation theory Combinatorial analysis Computational complexity Computer programming Computer science Computer scienceMathematics Computer scienceStatistical methods Computer security Computer software Counting Cryptography Data encryption (Computer science) Data protection Data structures (Computer science) Electronic data processing Mathematical optimization Numbers, Random Numerical analysis Random number generators Statistics Stochastic processes Zeroknowledge proofs
Covers
Alternative Names
Salil Vadhan American computer scientist
Salil Vadhan Amerikaans informaticus
Salil Vadhan USamerikanischer Informatiker
Vadhan, Salil P.
Languages