The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Amit Sahai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Brent R. Waters, Edward W. Felten, Amit Sahai
    Receiver anonymity via incomparable public keys. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2003, pp:112-121 [Conf]
  2. Vipul Goyal, Omkant Pandey, Amit Sahai, Brent Waters
    Attribute-based encryption for fine-grained access control of encrypted data. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2006, pp:89-98 [Conf]
  3. Venkatesan Guruswami, Amit Sahai
    Multiclass Learning, Boosting, and Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:145-155 [Conf]
  4. 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]
  5. Mihir Bellare, Amit Sahai
    Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:519-536 [Conf]
  6. 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]
  7. Cynthia Dwork, Amit Sahai
    Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:442-457 [Conf]
  8. 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]
  9. Yuval Ishai, Amit Sahai, David Wagner
    Private Circuits: Securing Hardware against Probing Attacks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:463-481 [Conf]
  10. Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
    Coding Constructions for Blacklisting Problems without Computational Assumptions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:609-623 [Conf]
  11. Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai
    Robust Non-interactive Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:566-598 [Conf]
  12. Jens Groth, Rafail Ostrovsky, Amit Sahai
    Non-interactive Zaps and New Techniques for NIZK. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:97-111 [Conf]
  13. Dan Boneh, Amit Sahai, Brent Waters
    Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:573-592 [Conf]
  14. Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai
    Exposure-Resilient Functions and All-or-Nothing Transforms. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:453-469 [Conf]
  15. Yevgeniy Dodis, Amit Sahai, Adam Smith
    On Perfect and Adaptive Security in Exposure-Resilient Cryptography. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:301-324 [Conf]
  16. Jens Groth, Rafail Ostrovsky, Amit Sahai
    Perfect Non-interactive Zero Knowledge for NP. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:339-358 [Conf]
  17. Yuval Ishai, Manoj Prabhakaran, Amit Sahai, David Wagner
    Private Circuits II: Keeping Secrets in Tamperable Circuits. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:308-327 [Conf]
  18. Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shacham, Brent Waters
    Sequential Aggregate Signatures and Multisignatures Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:465-485 [Conf]
  19. Ben Lynn, Manoj Prabhakaran, Amit Sahai
    Positive Results and Techniques for Obfuscation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:20-39 [Conf]
  20. Amit Sahai, Brent Waters
    Fuzzy Identity-Based Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:457-473 [Conf]
  21. Boaz Barak, Amit Sahai
    How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:543-552 [Conf]
  22. Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
    Combinatorial feature selection problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:631-640 [Conf]
  23. Moses Charikar, Amit Sahai
    Dimension Reduction in the \ell _1 Norm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:551-560 [Conf]
  24. Yevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, Amit Sahai
    On the (Im)possibility of Cryptography with Imperfect Randomness. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:196-205 [Conf]
  25. Venkatesan Guruswami, Amit Sahai, Madhu Sudan
    "Soft-decision" Decoding of Chinese Remainder Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:159-168 [Conf]
  26. Manoj Prabhakaran, Alon Rosen, Amit Sahai
    Concurrent Zero Knowledge with Logarithmic Round-Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:366-375 [Conf]
  27. Amit Sahai
    Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:543-553 [Conf]
  28. Amit Sahai, Salil P. Vadhan
    A Complete Promise Problem for Statistical Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:448-457 [Conf]
  29. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Cryptography from Anonymity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:239-248 [Conf]
  30. Boaz Barak, Manoj Prabhakaran, Amit Sahai
    Concurrent Non-Malleable Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:345-354 [Conf]
  31. Amit Sahai
    Secure Protocols for Complex Tasks in Complex Environments. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2004, pp:14-16 [Conf]
  32. Anna Lysyanskaya, Ronald L. Rivest, Amit Sahai, Stefan Wolf
    Pseudonym Systems. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 1999, pp:184-199 [Conf]
  33. Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins
    Minimizing Wirelength in Zero and Bounded Skew Clock Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:177-184 [Conf]
  34. Edith Elkind, Amit Sahai, Kenneth Steiglitz
    Frugality in path auctions. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:701-709 [Conf]
  35. John Bethencourt, Amit Sahai, Brent Waters
    Ciphertext-Policy Attribute-Based Encryption. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2007, pp:321-334 [Conf]
  36. 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]
  37. Marshall W. Bern, Amit Sahai
    Pushing Disks Together - The Continuous-Motion Case. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:119-125 [Conf]
  38. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai
    Universally composable two-party and multi-party secure computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:494-503 [Conf]
  39. Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai
    Query strategies for priced information (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:582-591 [Conf]
  40. Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat
    Approximating the smallest grammar: Kolmogorov complexity in natural models. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:792-801 [Conf]
  41. Cynthia Dwork, Moni Naor, Amit Sahai
    Concurrent Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:409-418 [Conf]
  42. 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]
  43. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Batch codes and their applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:262-271 [Conf]
  44. Manoj Prabhakaran, Amit Sahai
    New notions of security: achieving universal composability without trusted setup. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:242-251 [Conf]
  45. Manoj Prabhakaran, Amit Sahai
    Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:104-127 [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. Marshall W. Bern, Amit Sahai
    Pushing Disks Together - The Continuous-Motion Case. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:4, pp:499-514 [Journal]
  48. 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]
  49. 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]
  50. 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]
  51. Boaz Barak, Amit Sahai
    How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:096, pp:- [Journal]
  52. Jens Groth, Rafail Ostrovsky, Amit Sahai
    Perfect Non-Interactive Zero Knowledge for NP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:097, pp:- [Journal]
  53. 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]
  54. 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]
  55. Cynthia Dwork, Moni Naor, Amit Sahai
    Concurrent zero-knowledge. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:6, pp:851-898 [Journal]
  56. 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]
  57. Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai
    Query Strategies for Priced Information. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:4, pp:785-819 [Journal]
  58. Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins
    Minimizing Wirelength in Zero and Bounded Skew Clock Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:4, pp:582-595 [Journal]
  59. Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat
    The smallest grammar problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2554-2576 [Journal]
  60. Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky, Amit Sahai
    Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2007, pp:444-459 [Conf]
  61. Rafail Ostrovsky, Omkant Pandey, Amit Sahai
    Private Locally Decodable Codes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:387-398 [Conf]
  62. Nishanth Chandran, Jens Groth, Amit Sahai
    Ring Signatures of Sub-linear Size Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:423-434 [Conf]
  63. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Zero-knowledge from secure multiparty computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:21-30 [Conf]

  64. Attribute-based encryption with non-monotonic access structures. [Citation Graph (, )][DBLP]


  65. Black-box accountable authority identity-based encryption. [Citation Graph (, )][DBLP]


  66. Founding Cryptography on Oblivious Transfer - Efficiently. [Citation Graph (, )][DBLP]


  67. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. [Citation Graph (, )][DBLP]


  68. Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. [Citation Graph (, )][DBLP]


  69. Precise Concurrent Zero Knowledge. [Citation Graph (, )][DBLP]


  70. New Constructions for UC Secure Computation Using Tamper-Proof Hardware. [Citation Graph (, )][DBLP]


  71. Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. [Citation Graph (, )][DBLP]


  72. Efficient Non-interactive Proof Systems for Bilinear Groups. [Citation Graph (, )][DBLP]


  73. Resettably Secure Computation. [Citation Graph (, )][DBLP]


  74. Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption. [Citation Graph (, )][DBLP]


  75. Covert Multi-Party Computation. [Citation Graph (, )][DBLP]


  76. Extracting Correlations. [Citation Graph (, )][DBLP]


  77. Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy. [Citation Graph (, )][DBLP]


  78. Bounded Ciphertext Policy Attribute Based Encryption. [Citation Graph (, )][DBLP]


  79. Computing on Encrypted Data. [Citation Graph (, )][DBLP]


  80. Revocation Systems with Very Small Private Keys. [Citation Graph (, )][DBLP]


  81. Cryptography with constant computational overhead. [Citation Graph (, )][DBLP]


  82. Secure Arithmetic Computation with No Honest Majority. [Citation Graph (, )][DBLP]


  83. On Complete Primitives for Fairness. [Citation Graph (, )][DBLP]


  84. Founding Cryptography on Tamper-Proof Hardware Tokens. [Citation Graph (, )][DBLP]


  85. Secure Arithmetic Computation with No Honest Majority [Citation Graph (, )][DBLP]


  86. Efficient Non-interactive Proof Systems for Bilinear Groups. [Citation Graph (, )][DBLP]


  87. Improved Algorithms for Optimal Embeddings. [Citation Graph (, )][DBLP]


Search in 0.114secs, Finished in 0.120secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002