The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Salil P. Vadhan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Venkatesan Guruswami, Salil P. Vadhan
    A Lower Bound on List Size for List Decoding. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:318-329 [Conf]
  2. Eyal Rozenman, Salil P. Vadhan
    Derandomized Squaring of Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:436-447 [Conf]
  3. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Short PCPs Verifiable in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:120-134 [Conf]
  4. Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Randomness Conductors and Constant-Degree Lossless Expanders. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:15- [Conf]
  5. Oded Goldreich, Salil P. Vadhan
    Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:54-0 [Conf]
  6. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
    Pseudorandom Generators without the XOR Lemma (Abstract). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:4- [Conf]
  7. Luca Trevisan, Salil P. Vadhan
    Pseudorandomness and Average-Case Complexity via Uniform Reductions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:129-138 [Conf]
  8. Luca Trevisan, Salil P. Vadhan, David Zuckerman
    Compression of Samplable Sources. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:1-14 [Conf]
  9. Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan
    Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:283-298 [Conf]
  10. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:1-18 [Conf]
  11. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
    Derandomization in Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:299-315 [Conf]
  12. Oded Goldreich, Amit Sahai, Salil P. Vadhan
    Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:467-484 [Conf]
  13. Daniele Micciancio, Salil P. Vadhan
    Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:282-298 [Conf]
  14. Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
    Random Selection with an Adversarial Majority. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:409-426 [Conf]
  15. Salil P. Vadhan
    On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:61-77 [Conf]
  16. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
    Lower Bounds for Non-Black-Box Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:384-393 [Conf]
  17. Silvio Micali, Michael O. Rabin, Salil P. Vadhan
    Verifiable Random Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:120-130 [Conf]
  18. Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:3-13 [Conf]
  19. Ran Raz, Omer Reingold, Salil P. Vadhan
    Error Reduction for Extractors. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:191-201 [Conf]
  20. Amit Sahai, Salil P. Vadhan
    A Complete Promise Problem for Statistical Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:448-457 [Conf]
  21. Luca Trevisan, Salil P. Vadhan
    Extracting Randomness from Samplable Distributions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:32-42 [Conf]
  22. Salil P. Vadhan
    Randomness Extractors and their Many Guises. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:9-0 [Conf]
  23. Salil P. Vadhan
    An Unconditional Study of Computational Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:176-185 [Conf]
  24. Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan
    Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:3-14 [Conf]
  25. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    On Interactive Proofs with a Laconic Prover. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:334-345 [Conf]
  26. Salil P. Vadhan
    Order in Pseudorandomness. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:10-11 [Conf]
  27. Nenad Dedic, Leonid Reyzin, Salil P. Vadhan
    An Improved Pseudorandom Generator Based on Hardness of Factoring. [Citation Graph (0, 0)][DBLP]
    SCN, 2002, pp:88-101 [Conf]
  28. Grant Schoenebeck, Salil P. Vadhan
    The computational complexity of nash equilibria in concisely represented games. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:270-279 [Conf]
  29. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust pcps of proximity, shorter pcps and applications to coding. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:1-10 [Conf]
  30. Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson
    Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:612-621 [Conf]
  31. Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
    The Power of a Pebble: Exploring and Mapping Directed Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:269-278 [Conf]
  32. Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Randomness conductors and constant-degree lossless expanders. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:659-668 [Conf]
  33. Oded Goldreich, Amit Sahai, Salil P. Vadhan
    Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:399-408 [Conf]
  34. Alexander Healy, Salil P. Vadhan, Emanuele Viola
    Using nondeterminism to amplify hardness. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:192-201 [Conf]
  35. Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
    Deterministic extractors for small-space sources. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:691-700 [Conf]
  36. Daniel Lewin, Salil P. Vadhan
    Checking Polynomial Identities over any Field: Towards a Derandomization? [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:438-447 [Conf]
  37. Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Extractors: optimal up to constant factors. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:602-611 [Conf]
  38. Minh-Huyen Nguyen, Salil P. Vadhan
    Zero knowledge with efficient provers. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:287-295 [Conf]
  39. Ran Raz, Omer Reingold, Salil P. Vadhan
    Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:149-158 [Conf]
  40. Omer Reingold, Luca Trevisan, Salil P. Vadhan
    Pseudorandom walks on regular digraphs and the RL vs. L problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:457-466 [Conf]
  41. Saurabh Sanghvi, Salil P. Vadhan
    The round complexity of two-party random selection. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:338-347 [Conf]
  42. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
    Pseudorandom Generators Without the XOR Lemma (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:537-546 [Conf]
  43. Salil P. Vadhan
    On transformation of interactive proofs that preserve the prover's complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:200-207 [Conf]
  44. Minh-Huyen Nguyen, Salil P. Vadhan
    Simpler Session-Key Generation from Short Random Passwords. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:428-445 [Conf]
  45. Omer Reingold, Luca Trevisan, Salil P. Vadhan
    Notions of Reducibility between Cryptographic Primitives. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:1-20 [Conf]
  46. Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
    Concurrent Zero Knowledge Without Complexity Assumptions. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:1-20 [Conf]
  47. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    On interactive proofs with a laconic prover. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:1-2, pp:1-53 [Journal]
  48. Luca Trevisan, Salil P. Vadhan, David Zuckerman
    Compression of Samplable Sources. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:3, pp:186-227 [Journal]
  49. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    Simplified derandomization of BPP using a hitting set generator. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:4, pp:- [Journal]
  50. Amit Sahai, Salil P. Vadhan
    A Complete Problem for Statistical Zero Knowledge [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:84, pp:- [Journal]
  51. Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:18, pp:- [Journal]
  52. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    On Interactive Proofs with a Laconic Prover [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:46, pp:- [Journal]
  53. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:057, pp:- [Journal]
  54. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs and Applications to Coding [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:021, pp:- [Journal]
  55. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
    Lower Bounds for Non-Black-Box Zero Knowledge [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:083, pp:- [Journal]
  56. Alexander Healy, Salil P. Vadhan, Emanuele Viola
    Using Nondeterminism to Amplify Hardness [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:087, pp:- [Journal]
  57. Luca Trevisan, Salil P. Vadhan, David Zuckerman
    Compression of Samplable Sources [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:012, pp:- [Journal]
  58. Omer Reingold, Luca Trevisan, Salil P. Vadhan
    Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:022, pp:- [Journal]
  59. Grant Schoenebeck, Salil P. Vadhan
    The Computational Complexity of Nash Equilibria in Concisely Represented Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:052, pp:- [Journal]
  60. Eyal Rozenman, Salil P. Vadhan
    Derandomized Squaring of Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:092, pp:- [Journal]
  61. Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
    Concurrent Zero Knowledge without Complexity Assumptions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:093, pp:- [Journal]
  62. Saurabh Sanghvi, Salil P. Vadhan
    The Round Complexity of Two-Party Random Selection [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:110, pp:- [Journal]
  63. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
    Derandomization in Cryptography [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:114, pp:- [Journal]
  64. Salil P. Vadhan
    Extracting All the Randomness from a Weakly Random Source [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:47, pp:- [Journal]
  65. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
    Pseudorandom generators without the XOR Lemma [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:74, pp:- [Journal]
  66. Oded Goldreich, Amit Sahai, Salil P. Vadhan
    Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:13, pp:- [Journal]
  67. Ran Raz, Omer Reingold, Salil P. Vadhan
    Extracting All the Randomness and Reducing the Error in Trevisan's Extractors [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:46, pp:- [Journal]
  68. Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
    The Power of a Pebble: Exploring and Mapping Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:1, pp:1-21 [Journal]
  69. Dana Ron, Amir Rosenfeld, Salil P. Vadhan
    The hardness of the Expected Decision Depth problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:3, pp:112-118 [Journal]
  70. Amit Sahai, Salil P. Vadhan
    A complete problem for statistical zero knowledge. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:2, pp:196-249 [Journal]
  71. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
    Lower bounds for non-black-box zero knowledge. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:321-391 [Journal]
  72. Ran Raz, Omer Reingold, Salil P. Vadhan
    Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:1, pp:97-128 [Journal]
  73. Madhu Sudan, Luca Trevisan, Salil P. Vadhan
    Pseudorandom Generators without the XOR Lemma. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:236-266 [Journal]
  74. Salil P. Vadhan
    Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2004, v:17, n:1, pp:43-77 [Journal]
  75. Alexander Healy, Salil P. Vadhan, Emanuele Viola
    Using Nondeterminism to Amplify Hardness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:903-931 [Journal]
  76. Salil P. Vadhan
    The Complexity of Counting in Sparse, Regular, and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:398-427 [Journal]
  77. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:889-974 [Journal]
  78. Salil P. Vadhan
    An Unconditional Study of Computational Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:1160-1214 [Journal]
  79. Boaz Barak, Shien Jin Ong, Salil P. Vadhan
    Derandomization in Cryptography. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:380-400 [Journal]
  80. Kai-min Chung, Omer Reingold, Salil P. Vadhan
    S-T Connectivity on Digraphs with a Known Stationary Distribution. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:236-249 [Conf]
  81. Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
    Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:96-108 [Conf]
  82. Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee
    Amplifying Collision Resistance: A Complexity-Theoretic Treatment. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:264-283 [Conf]
  83. Shien Jin Ong, Salil P. Vadhan
    Zero Knowledge and Soundness Are Symmetric. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:187-209 [Conf]

  84. Limitations of Hardness vs. Randomness under Uniform Reductions. [Citation Graph (, )][DBLP]


  85. Tight Bounds for Hashing Block Sources. [Citation Graph (, )][DBLP]


  86. The Complexity of Distinguishing Markov Random Fields. [Citation Graph (, )][DBLP]


  87. Pseudorandom Bit Generators That Fool Modular Sums. [Citation Graph (, )][DBLP]


  88. Are PCPs Inherent in Efficient Arguments? [Citation Graph (, )][DBLP]


  89. Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. [Citation Graph (, )][DBLP]


  90. Computational Differential Privacy. [Citation Graph (, )][DBLP]


  91. Improved Delegation of Computation Using Fully Homomorphic Encryption. [Citation Graph (, )][DBLP]


  92. Universal One-Way Hash Functions via Inaccessible Entropy. [Citation Graph (, )][DBLP]


  93. Dense Subsets of Pseudorandom Sets. [Citation Graph (, )][DBLP]


  94. The Complexity of Zero Knowledge. [Citation Graph (, )][DBLP]


  95. Why simple hash functions work: exploiting the entropy in a data stream. [Citation Graph (, )][DBLP]


  96. On the complexity of differentially private data release: efficient algorithms and hardness results. [Citation Graph (, )][DBLP]


  97. Inaccessible entropy. [Citation Graph (, )][DBLP]


  98. Efficiency improvements in constructing pseudorandom generators from one-way functions. [Citation Graph (, )][DBLP]


  99. An Equivalence Between Zero Knowledge and Commitments. [Citation Graph (, )][DBLP]


  100. Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. [Citation Graph (, )][DBLP]


  101. Fairness with an Honest Minority and a Rational Majority. [Citation Graph (, )][DBLP]


  102. Proofs of Retrievability via Hardness Amplification. [Citation Graph (, )][DBLP]


  103. Composition of Zero-Knowledge Proofs with Efficient Provers. [Citation Graph (, )][DBLP]


  104. Are PCPs Inherent in Efficient Arguments? [Citation Graph (, )][DBLP]


  105. Pseudorandomness and Average-Case Complexity Via Uniform Reductions. [Citation Graph (, )][DBLP]


  106. Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword. [Citation Graph (, )][DBLP]


  107. Tight Bounds for Hashing Block Sources [Citation Graph (, )][DBLP]


  108. On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy [Citation Graph (, )][DBLP]


  109. Limitations of Hardness vs. Randomness under Uniform Reductions. [Citation Graph (, )][DBLP]


  110. Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. [Citation Graph (, )][DBLP]


  111. Dense Subsets of Pseudorandom Sets. [Citation Graph (, )][DBLP]


  112. S-T Connectivity on Digraphs with a Known Stationary Distribution. [Citation Graph (, )][DBLP]


  113. Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. [Citation Graph (, )][DBLP]


  114. Extractors and condensers from univariate polynomials. [Citation Graph (, )][DBLP]


  115. Random Selection with an Adversarial Majority. [Citation Graph (, )][DBLP]


  116. An Unconditional Study of Computational Zero Knowledge. [Citation Graph (, )][DBLP]


  117. Zero Knowledge and Soundness are Symmetric. [Citation Graph (, )][DBLP]


Search in 0.085secs, Finished in 0.093secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002