Visual cryptography M Naor, A Shamir Advances in Cryptology—EUROCRYPT'94: Workshop on the Theory and Application …, 1995 | 3939 | 1995 |

Optimal aggregation algorithms for middleware R Fagin, A Lotem, M Naor Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2001 | 2604 | 2001 |

Rank aggregation methods for the web C Dwork, R Kumar, M Naor, D Sivakumar Proceedings of the 10th international conference on World Wide Web, 613-622, 2001 | 2247 | 2001 |

Broadcast encryption A Fiat, M Naor Advances in Cryptology—CRYPTO’93: 13th Annual International Cryptology …, 1994 | 2093 | 1994 |

Untraceable electronic cash D Chaum, A Fiat, M Naor Advances in Cryptology—CRYPTO’88: Proceedings 8, 319-327, 1990 | 2033 | 1990 |

Pricing via processing or combatting junk mail C Dwork, M Naor Advances in Cryptology—CRYPTO’92: 12th Annual International Cryptology …, 1993 | 2020 | 1993 |

Our data, ourselves: Privacy via distributed noise generation C Dwork, K Kenthapadi, F McSherry, I Mironov, M Naor Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference …, 2006 | 2013 | 2006 |

Non-malleable cryptography D Dolev, C Dwork, M Naor Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991 | 1982 | 1991 |

Revocation and tracing schemes for stateless receivers D Naor, M Naor, J Lotspiech Advances in Cryptology—CRYPTO 2001: 21st Annual International Cryptology …, 2001 | 1579 | 2001 |

Public-key cryptosystems provably secure against chosen ciphertext attacks M Naor, M Yung Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990 | 1314 | 1990 |

Universal one-way hash functions and their cryptographic applications M Naor, M Yung Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 1306 | 1989 |

Multicast security: A taxonomy and some efficient constructions R Canetti, J Garay, G Itkis, D Micciancio, M Naor, B Pinkas IEEE INFOCOM'99. Conference on Computer Communications. Proceedings …, 1999 | 1139 | 1999 |

Efficient oblivious transfer protocols. M Naor, B Pinkas SODA 1, 448-457, 2001 | 1025 | 2001 |

Viceroy: A scalable and dynamic emulation of the butterfly D Malkhi, M Naor, D Ratajczak Proceedings of the twenty-first annual symposium on Principles of …, 2002 | 1020 | 2002 |

Privacy preserving auctions and mechanism design M Naor, B Pinkas, R Sumner Proceedings of the 1st ACM Conference on Electronic Commerce, 129-139, 1999 | 951 | 1999 |

Small-bias probability spaces: Efficient constructions and applications J Naor, M Naor Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990 | 940 | 1990 |

Tracing traitors B Chor, A Fiat, M Naor Crypto 94, 257-270, 1994 | 916 | 1994 |

Bit commitment using pseudorandomness M Naor Journal of cryptology 4, 151-158, 1991 | 853 | 1991 |

Oblivious transfer and polynomial evaluation M Naor, B Pinkas Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 847 | 1999 |

Number-theoretic constructions of efficient pseudo-random functions M Naor, O Reingold Journal of the ACM (JACM) 51 (2), 231-262, 2004 | 841 | 2004 |