The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Guy N. Rothblum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Moni Naor, Guy N. Rothblum
    The Complexity of Online Memory Checking. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:573-584 [Conf]
  2. Moni Naor, Guy N. Rothblum
    Learning to impersonate. [Citation Graph (0, 0)][DBLP]
    ICML, 2006, pp:649-656 [Conf]
  3. Shafi Goldwasser, Guy N. Rothblum
    On Best-Possible Obfuscation. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:194-213 [Conf]
  4. Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan
    Securely Obfuscating Re-encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:233-252 [Conf]
  5. Erez Petrank, Guy N. Rothblum
    Selection from Structured Data Sets [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:085, pp:- [Journal]
  6. Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum
    Verifying and decoding in constant depth. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:440-449 [Conf]
  7. Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
    Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:166-182 [Conf]

  8. The Complexity of Local List Decoding. [Citation Graph (, )][DBLP]


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


  10. One-Time Programs. [Citation Graph (, )][DBLP]


  11. Securing Computation against Continuous Leakage. [Citation Graph (, )][DBLP]


  12. Delegating computation: interactive proofs for muggles. [Citation Graph (, )][DBLP]


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


  14. A (de)constructive approach to program checking. [Citation Graph (, )][DBLP]


  15. Differential privacy under continual observation. [Citation Graph (, )][DBLP]


  16. How Efficient Can Memory Checking Be?. [Citation Graph (, )][DBLP]


  17. Weak Verifiable Random Functions. [Citation Graph (, )][DBLP]


  18. Obfuscation of Hyperplane Membership. [Citation Graph (, )][DBLP]


  19. Leakage-Resilient Signatures. [Citation Graph (, )][DBLP]


  20. Pan-Private Streaming Algorithms. [Citation Graph (, )][DBLP]


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


  22. The Complexity of Local List Decoding. [Citation Graph (, )][DBLP]


  23. A (De)constructive Approach to Program Checking. [Citation Graph (, )][DBLP]


  24. The Complexity of Online Memory Checking. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
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