The SCEAS System
Navigation Menu

Search the dblp DataBase


Muthuramakrishnan Venkitasubramaniam: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer, Muthuramakrishnan Venkitasubramaniam
    l-Diversity: Privacy Beyond k-Anonymity. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:24- [Conf]
  2. Muthuramakrishnan Venkitasubramaniam, Ashwin Machanavajjhala, David J. Martin, Johannes Gehrke
    Trusted CVS. [Citation Graph (0, 0)][DBLP]
    ICDE Workshops, 2006, pp:23- [Conf]
  3. D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan
    Brief announcement: on the round complexity of distributed consensus over synchronous networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:397- [Conf]
  4. D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan
    On Byzantine Agreement over (2, 3)-Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:450-464 [Conf]
  5. Rafael Pass, Muthuramakrishnan Venkitasubramaniam
    An efficient parallel repetition theorem for Arthur-Merlin games. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:420-429 [Conf]
  6. Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke, Muthuramakrishnan Venkitasubramaniam
    L-diversity: Privacy beyond k-anonymity. [Citation Graph (0, 0)][DBLP]
    TKDD, 2007, v:1, n:1, pp:- [Journal]

  7. Concurrent Non-Malleable Zero Knowledge Proofs. [Citation Graph (, )][DBLP]

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

  9. A unified framework for concurrent security: universal composability from stand-alone non-malleability. [Citation Graph (, )][DBLP]

  10. Concurrent Non-malleable Commitments from Any One-Way Function. [Citation Graph (, )][DBLP]

  11. On Constant-Round Concurrent Zero-Knowledge. [Citation Graph (, )][DBLP]

  12. Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model. [Citation Graph (, )][DBLP]

  13. Private Coins versus Public Coins in Zero-Knowledge Proof Systems. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002