Receiver-deniable public-key encryption

International Journal of Network Security

Volumn 8, Issue 2, 2009, Pages 159-165

  Ibrahim, Maged H ^a  

^a Faculty of Engineering at Helwan University   (Egypt)

Author keywords

Deniable encryption; Mediated PKI; Oblivious transfer; Public key encryption; RSA

Indexed keywords

DENIABLE ENCRYPTIONS; MEDIATED PKI; OBLIVIOUS TRANSFER; PUBLIC-KEY ENCRYPTION; RSA;

NETWORK SECURITY; SAFETY ENGINEERING;

PUBLIC KEY CRYPTOGRAPHY;

EID: 69749087308     PISSN: 1816353X     EISSN: 18163548     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. M. Bellare, and P. Rogaway, "Random oracles are practical: a paradigm for designing efficient protocols," 1st Conference on Computer and Communications Security, pp. 62-73, 1993.
2. D. Boneh, X. Ding, G. Tsudik, and M. Wong, "A method for fast revocation of public key certificates and security capabilities," Proceedings of the 10th USENIX Security Symposium, pp. 297-308.
3. C. Cachin, S. Micali, and M. Stadler, "Computa-tionally private information retrieval with polylogarithmic communication," Advances in Cryptography - Eurocrypt "99, pp. 402-414, 1999.
4. R. Canetti, and R. Gennaro, "Incoercible multiparty computation," Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 504-513, 1996.
5. R. Canetti, U. Feige, O. Goldreich, and M. Naor, "Adaptively secure multi-party computation," Proc-cedings 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 639-648, 1996.
6. R. Canetti, C. Dwork, M. Naor, and R. Ostro-vsky, "Deniable encryption," Proceedings of the 17th Annual international Cryptology Conference on Ad-vances in Cryptology, pp. 90-104, Springer-Verlag, London, 1997.
7. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sus-dan, "Private information retrieval," Journal of the ACM, vol. 45, no. 6, pp. 965-982, 1998.
8. R. Cramer, R. Gennaro, and B. Schoenmakers, "A secure and optimally efficient multi-authority elec-tion scheme," Eurocrypt '97, pp. 103-118, 1997.
9. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, "Protecting data privacy in information retrieval schemes," Proceedings of 30th Annual ACM Sympo-sium on Theory of Computing, pp. 151-160, 1998.
10. S. Goldwasser, and S. Micali, "Probabilistic encryp-tion," Journal of Computer and System Sciences, vol. 28, no. 2, pp. 270-299, 1984.
11. M. Hirt, and K. Sako, "Efficient receipt-free voting based on homomorphic encryption," Eurocrypt '00, pp. 539-556, 2000.
12. (http://www.rsa.com/rsalabs)
13. M. H. Ibrahim, "Eliminating quadratic slowdown in two-prime RSA function sharing," International Journal of Network Security (IJNS), vol. 7, no. 1, pp. 107-114, 2008.
14. M. H. Ibrahim, "A method for obtaining deni-able public-key encryption," International Journal of Network Security (IJNS), to appear.
15. K. Kurosawa, and Y. Desmedt, "A new paradigm of hybrid encryption scheme," Advances in Cryptol-ogy - Crypto '04, LNCS 3152, pp. 426-442, Matthew Franklin, Editor, 2004.
16. E. Kushilevitz, and R. Ostrovsky, "Single-database computationally private information retrieval," Pro-ceedings of 38th Annual Symposium on Foundations of Computer Science, pp. 364-373, 1997.
17. M. Naor, and B. Pinkas, "Oblivious transfer and polynomial evaluation," Proceedings of the Thirty-first Annual ACM Symposium on Theory of Com-puting, pp. 245-254, 1999.
18. M. Naor and B. Pinkas, "Efficient oblivious trans-fer protocols," Proceedings of SIAM Symposium on Discrete Algorithms, pp. 7-9, 2001.
19. M. B. Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 1-10, 1988.
20. M. Rabin, How to Exchange Secrets by Oblivious Transfer, Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
21. J. Stern, "A new and efficient all-or-nothing disclo-sure of secrets protocol," Asiacrypt '98, pp. 357-371, Springer-Verlag, 1998.