|
Search the dblp DataBase
Muthuramakrishnan Venkitasubramaniam:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer, Muthuramakrishnan Venkitasubramaniam
l-Diversity: Privacy Beyond k-Anonymity. [Citation Graph (0, 0)][DBLP] ICDE, 2006, pp:24- [Conf]
- Muthuramakrishnan Venkitasubramaniam, Ashwin Machanavajjhala, David J. Martin, Johannes Gehrke
Trusted CVS. [Citation Graph (0, 0)][DBLP] ICDE Workshops, 2006, pp:23- [Conf]
- 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]
- 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]
- Rafael Pass, Muthuramakrishnan Venkitasubramaniam
An efficient parallel repetition theorem for Arthur-Merlin games. [Citation Graph (0, 0)][DBLP] STOC, 2007, pp:420-429 [Conf]
- 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]
Concurrent Non-Malleable Zero Knowledge Proofs. [Citation Graph (, )][DBLP]
Precise Concurrent Zero Knowledge. [Citation Graph (, )][DBLP]
A unified framework for concurrent security: universal composability from stand-alone non-malleability. [Citation Graph (, )][DBLP]
Concurrent Non-malleable Commitments from Any One-Way Function. [Citation Graph (, )][DBLP]
On Constant-Round Concurrent Zero-Knowledge. [Citation Graph (, )][DBLP]
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model. [Citation Graph (, )][DBLP]
Private Coins versus Public Coins in Zero-Knowledge Proof Systems. [Citation Graph (, )][DBLP]
Search in 0.019secs, Finished in 0.021secs
|