| Journal Space efficient secret sharing for implicit data security (Abhishek Parakh and Subhash Kak) Information Sciences, Volume 181, Issue 2, 2011, pages 335-341 Internet voting protocol based on improved implicit security (Abhishek Parakh and Subhash Kak) Cryptologia, Volume 34, Issue 3 July 2010, pages 258-268. Online data storage using implicit security (Abhishek Parakh and Subhash Kak) Information Sciences, Volume 179, Issue 19, 2009, pages 3323-3331. Oblivious transfer based on key exchange Cryptologia, Volume 32, Issue 1 January 2008, pages 37 - 44. Oblivious transfer using elliptic curves Cryptologia, Volume 31, Issue 2 April 2007, pages 125 - 132. Aryabhata's root extraction methods Indian Journal of History of Science, 42.2 (2007) 149-161. Conferences New Key Agreement Techniques for Sensor Networks (Abhishek Parakh and Subhash Kak) To appear in Proceedings of IEEE ANTS 2011. A New Small World Lattice (Abhishek Parakh and Subhash Kak) To appear in Lecture Notes in Computer Science (LNCS), Volume No: 7135. Efficient key management in sensor networks (Abhishek Parakh and Subhash Kak) IEEE GLOBECOM 2010, Workshop on Web and Pervasive Security. A tree based recursive information hiding scheme (Abhishek Parakh and Subhash Kak) IEEE ICC 2010 - Communication and Information System Security Symposium ('ICC'10 CISS'), May 23-27, Cape Town, South Africa, 2010. Recursive secret sharing for distributed storage and information hiding (Abhishek Parakh and Subhash Kak) Advanced Networks and Telecommunication Systems (ANTS), 2009 IEEE 3rd International Symposium on , vol., no., pp.1-3, 14-16 Dec. 2009. A secure data storage scheme for sensor networks (Abhishek Parakh and Subhash Kak) Security and Privacy in Mobile Information and Communication Systems. Volume 17, pages 14-22, LNICST, Springer, 2009. Internet voting protocol based on implicit data security (Abhishek Parakh and Subhash Kak) Proceedings of 17th IEEE International Conference on Computer Communications and Networks 2008. ICCCN 08, Pages 1-4. A d-Sequence based recursive random number generator Proceedings of International Symposium on System and Information Security, 2006. 542p. PDF Cryptology ePrint Archive, Report 2006/310. Magazine Challenges Facing Electronic Voting (Abhishek Parakh and Subhash Kak) Seminar: the Monthly Symposium, No. 609, May 2010. How to improve security in electronic voting? (Abhishek Parakh and Subhash Kak) ACM Ubiquity Volume 8 Issue 6 (February 13 - February 19, 2007). Talks/Presentations A key distribution scheme for sensor networks using structured graphs (Invited - Subhash Kak) (Abhishek Parakh and Subhash Kak) Plenary talk at ELECTRO 2009, Dec 22-24, Banaras Hindu University, Banaras, India. Communication efficient oblivious transfer using elliptic curves At Conference on Theoretical and Applied Computer Science (TACS'09), Oct. 24, Oklahoma State University, Stillwater, Oklahoma, 2009. Space efficient secret sharing (Abhishek Parakh and Subhash Kak) At 4th Annual Computer Science Research Conference at the University of Oklahoma, April 18, 2009. Other A tree based recursive scheme for space efficient secret sharing (Abhishek Parakh and Subhash Kak) Cryptology ePrint Archive, Report 2009/409. Space efficient secret sharing: A recursive approach (Abhishek Parakh and Subhash Kak) Cryptology ePrint Archive, Report 2009/365. A recursive threshold visual cryptography scheme (Abhishek Parakh and Subhash Kak) Cryptology ePrint Archive, Report 2008/535. A note on Aryabhata's principle of relativity arXiv:physics/0610095 M.S. Thesis (2007) page updated: sometime in past |