WorldCat Identities

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 21-24, 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 black-box reductions, and key establishment
Randomization and approximation techniques in computer science : international workshop RANDOM '97, Bologna, Italy, July 11-12,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
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, list-decodable error-correcting codes, samplers, and pseudorandom generators. The structure of the presentation is meant to be suitable for teaching in a graduate-level 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

A study of statistical zero-knowledge proofs by Salil Vadhan( Book )

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 13-15, 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
The complexity of counting by Salil Vadhan( )

1 edition published in 1995 in English and held by 4 WorldCat member libraries worldwide

Can statistical zero knowledge be made non-interactive? : 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 De-Santis et. al. (ICALP98) of non-interactive statistical zero-knowledge proofs. Our main focus is to compare the class NISZK of problems possessing such non-interactive proofs to the class SZK of problems possessing interactive statistical zero-knowledge proofs. Along these lines, we first show that if statistical zero-knowledge is non-trivial then so is non-interactive statistical zero-knowledge, where by non-trivial we mean that the class includes problems which are not solvable in probabilistic polynomial-time. (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 zero-knowledge proofs can be made non-interactive. 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 6-8, 2011, San Jose, California, USA( Book )

2 editions published in 2011 in English and held by 2 WorldCat member libraries worldwide

The forty-third annual ACM symposium on theory of computing : (STOC 2011)( )

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, list-decodable error-correcting codes, samplers, and pseudorandom generators. The structure of the presentation is meant to be suitable for teaching in a graduate-level course, with exercises accompanying each section
Theory of cryptography (9783540709350) MWU-0205 by Salil Vadhan( Book )

1 edition published in 2007 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.60 (from 0.52 for Theory of ... to 0.88 for Theory of ...)

Theory of cryptography : 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, the Netherlands, February 21-24, 2007 : proceedings Theory of cryptography (9783540709350) MWU-0205
Covers
Randomization and approximation techniques in computer science : international workshop RANDOM '97, Bologna, Italy, July 11-12,1997 : proceedingsA study of statistical zero-knowledge proofsRandomization and Approximation Techniques in Computer Science : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13-15, 2002 ProceedingsTheory of cryptography (9783540709350) MWU-0205
Alternative Names
Salil Vadhan American computer scientist

Salil Vadhan Amerikaans informaticus

Salil Vadhan US-amerikanischer Informatiker

Vadhan, Salil P.

Languages
English (54)