|
Search the dblp DataBase
Yael Gertner:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan
The Relationship between Public Key Encryption and Oblivious Transfer. [Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:325-335 [Conf]
- Yael Gertner, Tal Malkin, Omer Reingold
On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:126-135 [Conf]
- Yael Gertner, Shafi Goldwasser, Tal Malkin
A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication. [Citation Graph (0, 0)][DBLP] RANDOM, 1998, pp:200-217 [Conf]
- Rosario Gennaro, Yael Gertner, Jonathan Katz
Lower bounds on the efficiency of encryption and digital signature schemes. [Citation Graph (0, 0)][DBLP] STOC, 2003, pp:417-425 [Conf]
- Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
Protecting Data Privacy in Private Information Retrieval Schemes. [Citation Graph (0, 0)][DBLP] STOC, 1998, pp:151-160 [Conf]
- Yael Gertner, Tal Malkin, Steven Myers
Towards a Separation of Semantic and CCA Security for Public Key Encryption. [Citation Graph (0, 0)][DBLP] TCC, 2007, pp:434-455 [Conf]
- Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
Protecting Data Privacy in Private Information Retrieval Schemes. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:60, n:3, pp:592-629 [Journal]
- Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan
Bounds on the Efficiency of Generic Cryptographic Constructions. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:35, n:1, pp:217-246 [Journal]
Search in 0.001secs, Finished in 0.002secs
|