Source: https://www.cs.purdue.edu/homes/mja/pu/vita.html
Timestamp: 2019-04-18 16:48:27+00:00

Document:
2004-present Distinguished Professor of Computer Science, Purdue Univ.
2003-present Professor (courtesy) of Electr. and Comp. Eng., Purdue Univ.
1989-04 Professor of Computer Science, Purdue Univ.
1986-89 Associate Professor of Computer Science, Purdue Univ.
1982-86 Assistant Professor of Computer Science, Purdue Univ.
1980 M.S. in Electr. Eng. and Comp. Sci., Johns Hopkins Univ.
2007-9 Chief Technology Officer, Arxan Technologies Inc.
2007-10 Chief Scientist, Arxan Defense Systems Inc.
2001-present Technical Advisory Board, Arxan Technologies Inc.
2001 Co-Founder, Arxan Technologies Inc.
2007-10 Associate Head Computer Science, Purdue Univ.
2001-17 Associate Director CERIAS, Purdue Univ.
1994-96 Associate Head Computer Science, Purdue Univ.
Selected as the Outstanding Teacher of the College of Science for 2004. Selected among the Top Ten Outstanding Teachers for the College of Science in 1994, 1995, 2006, 2007.
1987 Computational Geometry Day at Courant Institute / New York Univ.
Handbook of Algorithms and Theory of Computation, CRC Press (1st Edition: 1995-98; 2d Edition: 2006-).
Handbook of Parallel and Distributed Computing, McGraw-Hill (1993-97).
Handbook of Computer Science and Engineering, CRC Press (1994-97).
Computational Mathematics Series Editor for Chapman & Hall / CRC (1999-2002).
Note on journal versions of conference papers: Conference papers marked by * have not appeared in journal version, and will not be submitted to journals unless the conference's page limitations constrained the presentation (journals will not publish papers that do not add substantially to a published conference version of a paper).
* Security and Privacy Risks in Electronic Communications: A User's Assessment (with Fariborz Farahmand, Joshua Ripple, and Robin L. Dillon-Merrill). Proc. 2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON 2017), New York, October 2017, pp. 412-417. Won Best Paper Award in the track on ``Big Data, Image Processing and Multimedia Technology'' (best paper awards were given within tracks).
* Confidentiality Management in Collaborative Design (with Adam Dachowicz, Siva Chaitanya Chaduvula, and Jitesh H. Panchal). Proc. of ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (IDETC 2016), Charlotte, North Carolina, August 2016. 15 pages.
ErsatzPasswords: Ending Password Cracking and Detecting Password Leakage (with Mohammed H. Almeshekah, Chris Gutierrez, and Eugene H. Spafford). Proc. 31st Annual Computer Security Applications Conference (ACSAC 15), Los Angeles, California, December 2015. Acceptance rate: 24% (47/193). Won Outstanding Paper Award from that conference.
* Enhancing Password Security using Deceptive Covert Communication (with Mohammed H. Almeshekah and Eugene H. Spafford). Proc. 30th International Information Security and Privacy Conference, Hamburg, Germany, May 2015, pp. 159-173.
Similarity Group-by Operators for Multi-dimensional Relational Data (with Ruby Y. Tahboub, Mingjie Tang, Walid G. Aref, Qutaibah M. Malluhi, Mourad Ouzzani, Yasin N. Silva). Proc. 32d International Conference on Data Engineering (ICDE 2016) Helsinki, Finland, May 2016, pp. 1448-1449.
Secure Collaborations in Engineering System Design (with Shumiao Wang, Siddharth Bhandari, Jitesh Panchal, and Karthik Ramani). Proc. of ASME 2014 International Design and Engineering Technical Conference and Computers and Information in Engineering Conference (IDETC 2014), Buffalo, New York, August 2014. 13 pages.
* Back Channels Can Be Useful! - Layering Authentication Channels to Provide Covert Communication (with Mohammed H. Almeshekah and Eugene H. Spafford). Proc. The 21st International Workshop in Security Protocols (SPW 2013), Cambridge, United Kingdom, March 2013.
* Secure and Private Outsourcing of Shape-Based Feature Extraction (with Shumiao Wang, Mohammed Nassar, and Qutaibah Malluhi) Proc. 15th International Conference on Information and Communications Security (ICICS 13), Beijing, China, November 2013, pp. 90-99. Acceptance rate: 26% (29/113).
* Secure and Efficient Outsourcing of Sequence Comparisons (with Marina Blanton, Keith Frikken and Qutaibah Malluhi). Proc. 17th European Symposium on Research in Computer Security (ESORICS 2012), Pisa, Italy, September 2012, pp. 505-522. Acceptance rate: 20% (50/148).
* Private Outsourcing of Matrix Multiplication over Closed Semi-Rings (with Keith Frikken and Shumiao Wang). Proc. International Conference on Security and Cryptography (SECRYPT 2012), Rome, Italy, July 2012, pp. 136-144. Acceptance rate for full papers: 14% (22/160).
* Privacy-Preserving Business Process Outsourcing (with Mehdi Bentounsi and Salima Benbernou). Proc. 19th IEEE International Conference on Web Services (ICWS 2012), Honolulu, Hawaii, June 2012, pp. 662-663.
* Anonyfrag: An Anonymization-Based Approach For Privacy-Preserving BPaaS (with Mehdi Bentounsi, Salima Benbernou, and Cheikh Deme). Proc. 1st International Workshop on Cloud Intelligence (Cloud-I, a VLDB 2012 Workshop), Istanbul, Turkey, August 2012.
* Leakage-Free Redactable Signatures (with Elisa Bertino and Ashish Kundu). Proc. ACM Conference on Data and Application Security and Privacy, San Antonio, Texas, February 2012, pp. 307-316.
* Secure Authenticated Comparisons (with Keith Frikken and Hao Yuan). Proc. 9th Conference on Applied Cryptography and Network Security (ACNS 11), Nerja, Spain, June 2011, pp. 514-531. Acceptance rate: 18% (31/172).
* Duress Detection for Authentication Attacks Against Multiple Administrators, (with Emil Stefanov), Proc. 2010 ACM CCS Workshop on Insider Threats (WITS 10), Chicago, October 2010, pp. 37-46.
* Securely Outsourcing Linear Algebra Computations (with Keith Frikken). Proc. of 5th ACM Symposium on Information, Computer and Communications Security (AsiaCCS 10), Beijing, China, April 2010, pp. 48-59.
* Identifying Interesting Instances for Probabilistic Skylines (with Yinian Qi). Proc. 21st International Conference and Workshop on Database and Expert Systems Applications (DEXA 10), Bilbao, Spain, August 2010, pp. 300-314.
* Efficient and Secure Distribution of Massive Geo-Spatial Data (with Hao Yuan). Proc. 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS 2009), Seattle, Washington, November 2009, pp. 440-443.
* Computing All Skyline Probabilities for Uncertain Data (with Yinian Qi). Proc. 28th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 09), Providence, Rhode Island, July 2009, pp. 279-287.
* Efficient Data Structures for Range-Aggregate Queries on Trees (with Hao Yuan). Proc. of 12th International Conference on Database Theory (ICDT 09), Saint-Petersburg, Russia, pp. 111-120. Acceptance rate: 32% (25/77).
* Incentives and Perceptions of Information Security Risks (with Fariborz Farahmand and Benn Konsynski). Proc. International Conference on Information Systems (ICIS 08), Paris, France, December 2008.
* Efficient Private Record Linkage (with Mohamed Yakout and Ahmed Elmagarmid). Proc. 25th International Conference on Data Engineering (ICDE 09), Shanghai, China, April 2009, pp. 1283-1286.
* Private and Cheating-Free Outsourcing of Algebraic Computations (with David Benjamin). Proc. of 6th Annual Conference on Privacy, Security and Trust (PST 08), Fredericton, New Brunswick, Canada, October 2008, pp. 240-245. Acceptance rate: 28% (25/71).
* Binding Software to Specific Native Hardware in a VM Environment: The PUF Challenge and Opportunity, (with Eric D. Bryant, John T. Korb, and John R. Rice). Proc. of 1st Workshop on Virtual Machine Security (VMSec 08), Fairfax, Virginia, October 2008, pp. 45-48. Acceptance rate: 35% (7/20).
* Efficient Privacy-Preserving -Nearest Neighbor Search (with Yinian Qi). Proc. of 28th International Conference on Distributed Computing Systems (ICDCS 08), Beijing, China, June 2008, pp. 311-319. Acceptance rate: 16% (102/638).
* Efficient Distributed Third-Party Data Authentication for Tree Hierarchies (with Hao Yuan). Proc. of 28th International Conference on Distributed Computing Systems (ICDCS 08), Beijing, China, June 2008, pp. 184-193. Acceptance rate: 16% (102/638).
* Private Combinatorial Group Testing (with Keith B. Frikken, Marina V. Blanton and YounSun Cho). Proc. of 3d ACM Symposium on Information, Computer and Communications Security (AsiaCCS 08), Tokyo, March 2008, pp. 312-320. Acceptance rate: 18% (32/182 for regular papers).
* Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors (with YounSun Cho and Ashish Kundu). Proc. 24th International Conference on Data Engineering (ICDE 08), Cancun, Mexico, April 2008, pp. 696-704.
* Private Discovery of Shared Interests (with YounSun Cho). Proc. 9th International Conference on Information and Communications Security (ICICS 07), Zhengzhou, China, December 2007.
* Incorporating Temporal Capabilities in Existing Key Management Schemes (with Marina V. Blanton and Keith B. Frikken). Proc. 12th European Symposium on Research in Computer Security (ESORICS 07), Dresden, Germany, September 2007, pp. 515-530.
* Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric (with Marina V. Blanton, Michael T. Goodrich, and Stanislas Polu). Proc. 2007 Workshop on Algorithms and Data Structures (WADS 07), Halifax, Nova Scotia, August 2007, pp. 114-126. Acceptance rate: 26% (40/150).
* Passwords for Everyone: Secure Mnemonic-based Accessible Authentication (with Mercan Topkara and Umut Topkara). Proc. 2007 USENIX Annual Technical Conference (USENIX 07), Santa Clara, California, June 2007, pp. 369-374.
* Efficient Techniques for Realizing Geo-Spatial Access Control (with Marina V. Blanton and Keith B. Frikken). Proc. of 2d ACM Symposium on Information, Computer and Communications Security (AsiaCCS 07), Singapore, March 2007, pp. 82-92. Accceptance rate: 18%.
* Passwords Decay, Words Endure: Secure and Re-usable Multiple Password Mnemonics (with Mercan Topkara and Umut Topkara). Proc. 22d Annual ACM Symposium on Applied Computing (SAC 07), Seoul, Korea, March 2007, pp. 292-299.
* Information Hiding through Errors: A Confusing Approach (with Mercan Topkara and Umut Topkara). Proc. SPIE International Conference on Security, Steganography, and Watermarking of Multimedia Contents, 2007, San Jose, CA, 12 pages.
* Secure and Private Collaborative Linear Programming (with Jiangtao Li). Proc. 2nd International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 06), Atlanta, Georgia, November 2006, pp. 1-8.
* Words Are Not Enough: Sentence Level Natural Language Watermarking (with Mercan Topkara and Umut Topkara). Proc. 1st ACM Workshop on Multimedia Content Protection and Security (MCPS 06), Santa Barbara, California, October 2006, pp. 37-46.
* The Hiding Virtues of Ambiguity: Quantifiably Resilient Watermarking of Natural Language Text through Synonym Substitutions (with Mercan Topkara and Umut Topkara). Proc. ACM Multimedia and Security Workshop (MMSEC 06), Geneva, Switzerland, September 2006, pp. 164-174.
An Empirical Study of Automatic Event Reconstruction Systems (with Sundararaman Jeyaraman). Proc. 6th Annual Digital Forensics Research Workshop (DFRWS 06), Lafayette, Indiana, August 2006.
* Key Management for Non-Tree Access Hierarchies (with Marina V. Blanton and Keith B. Frikken). Proc. 11th ACM Symposium on Access Control Models and Technologies (SACMAT 06), Lake Tahoe, California, June 2006, pp. 11-18. Acceptance rate: 30% (25/82).
* Efficient Correlated Action Selection (with Marina V. Blanton, Keith B. Frikken, and Jiangtao Li). Proc. 10th Financial Cryptography and Data Security Conference (FC 06), Anguilla, British West Indies, February 2006, pp. 296-310. Acceptance rate: 30% (19/64 for regular papers).
* Lost in Just the Translation (with Christian Grothoff, Krista Grothoff, and Ryan Stutsman). Proc. 21st Annual ACM Symposium on Applied Computing (SAC 06), Dijon, France, April 2006, pp. 338-345. Acceptance rate: 32% (300/927).
* Trust Negotiation with Hidden Credentials, Hidden Policies, and Policy Cycles (with Keith B. Frikken and Jiangtao Li). Proc. of the 13th Annual Network and Distributed System Security Symposium (NDSS 06), San Diego, California, February 2006, pp. 157-172. Acceptance rate: 13% (17/127).
* Natural Language Watermarking: Research Challenges and Applications (with Mercan Topkara, Giuseppe Riccardi, and Dilek Hakkani-Tur). Proc. of the SPIE International Conference on Security, Steganography, and Watermarking of Multimedia Contents VI, January 2006, San Jose, California.
* Dynamic and Efficient Key Management for Access Hierarchies (with Marina V. Blanton and Keith B. Frikken). Proc. of the 12th ACM Conference on Computer and Communications Security (CCS 05), Alexandra, Virginia, November 2005, pp. 190-202. Acceptance rate: 15% (38/249). This paper was given the ``CCS Test of Time Award'' in October 2015 (an award started in 2012 and given to particularly influential papers that appeared in CCS ten years earlier).
* ViWiD: Visible Watermarking-Based Defense Against Phishing (with Mercan Topkara, Ashish Kamra, and Cristina Nita-Rotaru). Proc. of the Workshop on Digital Watermarking (IWDW 05), Lecture Notes in Computer Sciences, Springer Verlag, Siena, Italy, September 2005, pp. 470-482..
* Indexing Information for Data Forensics (with Michael T. Goodrich and Roberto Tamassia). Proc. 3rd Conference on Applied Cryptography and Network Security (ACNS 05), New York, June 2005, pp. 206-221. Acceptance rate: 22% (35/156).
Translation-Based Steganography (with Christian Grothoff, Krista Grothoff, Ludmila Alkhutova, and Ryan Stutsman). Proc. 7th International Information Hiding Workshop (IHW 05), Barcelona, Spain, June 2005, pp. 219-233.
* Provable Bounds for Portable and Flexible Privacy-Preserving Access Rights (with Marina V. Blanton). Proc. 10th ACM Symposium on Access Control Models and Technologies (SACMAT 05), Stockholm, Sweden, June 2005, pp. 95-101. Acceptance rate: 21% (19/90).
* Privacy-Preserving Credit Checking (with Keith Frikken and Chen Zhang). Proc. 6th ACM Conference on Electronic Commerce (EC 05), Vancouver, Canada, June 2005, pp. 147-154. Acceptance rate: 29% (33/113).
* Secure Collaborative Planning, Forecasting, and Replenishment (SCPFR) (with Marina Blanton, Vinayak Deshpande, Keith Frikken, Jiangtao Li, and Leroy Schwarz). Multi-Echelon / Public Applications of Supply Chain Management Conference, Atlanta, June 2006.
* Markov Models for Identification of Significant Episodes (with Robert Gwadera and Wojciech Szpankowski). Proc. 5th SIAM International Conference on Data Mining (SDM 05), Newport Beach, California, April 2005, pp. 404-414. Acceptance rate: 18% (40/218).
* Secure Biometric Authentication for Weak Computational Devices (with Keith B. Frikken, Michael T. Goodrich, and Roberto Tamassia). Proc. 9th International Conference on Financial Cryptography and Data Security (FC 05), Lecture Notes in Computer Sciences, Springer Verlag (LNCS 3570), Roseau, Dominica, February 2005, pp. 357-370. Acceptance rate: 24% (22/92).
* Achieving Fairness in Private Contract Negotiation (with Keith B. Frikken). Proc. 9th International Conference on Financial Cryptography and Data Security (FC 05), Lecture Notes in Computer Sciences, Springer Verlag (LNCS 3570), Roseau, Dominica, February 2005, pp. 270-284. Acceptance rate: 24% (22/92).
* Remote Revocation of Smart Cards in a Private DRM system (with Keith B. Frikken and Marina V. Bykova). Proc. Australasian Information Security Workshop (AISW 05), Newcastle, Australia, January 2005, pp. 169-177. Acceptance rate: 37% (13/35).
Verifying Data Integrity in Peer-to-Peer Media Streaming (with Ahsan Habib, Dongyan Xu, Bharat Bhargava, and John Chuang). Proc. 12th Annual Multimedia Computing and Networking Workshop (MMCN 05), San Jose, California, January 2005, pp. 1-12. Acceptance rate: 16% (16/100 for regular papers).
* Detection of Significant Sets of Episodes in Event Sequences (with Robert Gwadera and Wojciech Szpankowski). Proc. 4th IEEE International Conference on Data Mining (ICDM 04), Brighton, United Kingdom, November 2004, pp. 3-10. Acceptance rate: 9% (39/451).
* Private Collaborative Forecasting and Benchmarking (with Marina Bykova, Jiangtao Li, Keith B. Frikken, and Mercan Karahan). Proc. 3rd ACM Workshop on Privacy in the Electronic Society (WPES 04), Washington, DC, October 2004, pp. 103-114. Acceptance rate: 22% (10/45 for regular papers).
* Privacy-Preserving Route Planning (with Keith B. Frikken). Proc. 3rd ACM Workshop on Privacy in the Electronic Society (WPES 04), Washington, DC, October 2004, pp. 8-15. Acceptance rate: 22% (10/45 for regular papers).
* Hidden Access Control Policies with Hidden Credentials (with Keith B. Frikken and Jiangtao Li). Proc. 3rd. ACM Workshop on Privacy in the Electronic Society (WPES 04) (short paper), Washington, DC, October 2004, pp. 27-28. Acceptance rate: 45% (21/45 for short papers).
* A Hierarchical Protocol for Increasing the Stealthiness of Steganographic Methods (with Mercan Karahan, Umut Topkara, Cuneyt Taskiran, Eugene T. Lin, and Edward J. Delp). Proc. ACM Multimedia and Security Workshop (MMSEC 04), Magdeburg, Germany, September 2004, pp. 16-24.
* wmdb.*: Rights Protection for Numeric Relational Data, (with Radu Sion and Sunil K. Prabhakar). Proc. 20th International Conference on Data Engineering (ICDE 04), Boston, Massachusetts, 2004, p. 863.
* Privacy-Preserving Location-Dependent Query Processing (with Keith B. Frikken). Proc. IEEE International Conference on Pervasive Services (ICPS 04), July 2004, pp. 9-17.
* Portable and Flexible Document Access Control Mechanisms (with Marina Bykova). Proc. 9th European Symposium on Research in Computer Security (ESORICS 04), Lecture Notes in Computer Sciences, Springer Verlag (LNCS 3193), Sophia Antipolis, France, September 2004, pp. 193-208.
* Resilient Rights Protection for Sensor Streams (with Radu Sion and Sunil Prabhakar). Proc. 30th International Conference on Very Large Data Bases (VLDB 04), Toronto, September 2004, pp. 732-743. Acceptance rate: 16% (81/504).
* Secure Outsourcing of Sequence Comparisons (with Jiangtao Li). Proc. 4th Workshop on Privacy Enhancing Technologies (PET 04), Lecture Notes in Computer Sciences, Springer Verlag (LNCS 3424), Toronto, May 2004, pp. 63-78.
* Succinct Specifications of Portable Document Access Policies (with Marina Bykova). Proc. 9th ACM Symposium on Access Control Models and Technologies (SACMAT 04), Yorktown Heights, June 2004, pp. 41-50.
* Private Fingerprint Verification without Local Storage (with Florian Kerschbaum, David Mraihi, and John R. Rice). Proc. International Conference on Biometric Authentication (ICBA 04) (short paper), Hong Kong, July 2004, pp. 387-394.
* Attacking Digital Watermarks (with Radu Sion). Proc. Symposium on Electronic Imaging (SPIE 04), San Jose, California, January 2004, Vol. 5306, pp. 848-858.
* Adaptive Data Structures for IP Lookups (with Ananth Grama and Ioannis Ioannidis). Proc. 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 03), San Francisco, California, April 2003, pp. 75-84. Acceptance ratio: 21% (224/1078).
Authentication of LZ-77 Compressed Data (with Stefano Lonardi). Proc. 18th Annual ACM Symposium on Applied Computing (SAC 03), Melbourne, Florida, March 2003, pp. 282-287.
* On-the-fly Intrusion Detection for Web Portals (with Radu Sion and Sunil K. Prabhakar). IEEE International Conference on Information Technology: Coding and Computing (ITCC 03), Las Vegas, Nevada, April 2003, pp. 325-330.
* Rights Protection for Relational Data (with Radu Sion and Sunil K. Prabhakar). Proc. 2003 ACM International Conference on Management of Data (SIGMOD 03), San Diego, California, June 2003, pp. 98-109. Acceptance rate: 15% (52/342).
* Secure Supply-Chain Protocols (with Hicham G. Elmongui, Vinayak Deshpande, and Leroy B. Schwarz). Proc. 2003 IEEE Conference on Electronic Commerce (CEC 03), Newport Beach, California, June 2003, pp. 293-302.
* Enhanced Smart-card Based License Management (with Jiangtao Li). Proc. 2003 IEEE Conference on Electronic Commerce (CEC 03), Newport Beach, California, June 2003, pp. 111-119.
* Cropping-Resilient Segmented Multiple Watermarking (with Keith B. Frikken). Proc. 2003 Workshop on Algorithms and Data Structures (WADS 03), Lecture Notes in Computer Sciences, Springer Verlag (LNCS 2748), Ottawa, Canada, August 2003, pp. 231-242. Acceptance rate: 32% (40/126).
* Replicated Parallel I/O without Additional Scheduling Costs (with Keith B. Frikken). Proc. 14th International Conference and Workshop on Database and Expert Systems Applications (DEXA 03), Lecture Notes in Computer Sciences, Springer Verlag (LNCS 2736), Prague, Czech Republic, September 2003, pp. 223-232. Acceptance rate: 39% (91/236).
* Secure and Private Sequence Comparisons (with Florian Kerschbaum and Kevin Du). Proc. 2d. ACM Workshop on Privacy in the Electronic Society (WPES 03), Washington, DC, October 2003, pp. 39-44. Acceptance rate: 32% (16/50).
* Privacy Preserving Electronic Surveillance (with Keith B. Frikken). Proc. 2d. ACM Workshop on Privacy in the Electronic Society (WPES 03), Washington, DC, October 2003, pp. 45-54. Acceptance rate: 32% (16/50).
Reliable Detection of Episodes in Event Sequences (with Robert Gwadera and Wojciech Szpankowski). Proc. 3rd IEEE International Conference on Data Mining (ICDM 03), Melbourne, Florida, November 2003, pp. 67-74. Acceptance rate: 12% (58/501).
* Resilient Information Hiding for Abstract Semi-Structures (with Radu Sion and Sunil Prabhakar), Proc. of the Workshop on Digital Watermarking (IWDW 03), Lecture Notes in Computer Sciences, Springer Verlag (LNCS 2939), Seoul, Korea, October 2003, pp. 141-153.
* Power: A Metric for Evaluating Watermarking Algorithms (with Radu Sion and S. Prabhakar). Proc. IEEE International Conference on Information Technology: Coding and Computing (ITCC 02), Las Vegas, Nevada, April 2002, pp. 95-100.
* On the Discovery of Weak Periodicities in Large Time Series (with Walid G. Aref, Christos Berberidis, Ioannis P. Vlahavas, and Ahmed K. Elmagarmid). Proc. 6th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 02), August 2002, Helsinki, Finland. Lecture Notes in Computer Science, Vol. LNAI 2431, Springer Verlag, pp. 51-61.
* Optimal Parallel I/O for Range Queries through Replication (with Keith B. Frikken, Sunil K. Prabhakar, and Rei Safavi-Naini). Proc. 13th International Conference and Workshop on Database and Expert Systems Applications (DEXA 02), Aix-en-Provence, France, September 2002. Lecture Notes in Computer Science, Vol. 2453, Springer Verlag, pp. 669-678. Acceptance rate: 37% (89/241).
* Multiple and Partial Periodicity Mining in Time Series Databases (with Christos Berberidis, Walid G. Aref, Ioannis P. Vlahavas, and Ahmed K. Elmagarmid). Proc. 15th European Conference on Artificial Intelligence (ECAI 02), July 2002, Lyon, France. IOS Press, pp. 370-374.
* Natural Language Watermarking and Tamperproofing (with Victor Raskin, Christian F. Hempelmann, Mercan Karahan, Umut Topkara, Katrina E. Triezenberg, Radu Sion). Proc. 5th International Information Hiding Workshop (IHW 02), Noordwijkerhout, The Netherlands, October 2002. Acceptance rate: 34% (27/78).
* On Watermarking Numeric Sets (with Radu Sion and Sunil K. Prabhakar). Proc. 1st International Workshop on Digital Watermarking (IWDW 02), Seoul, South Korea, November 2002. Lecture Notes in Computer Science, 2613: Digital Watermarking, Springer-Verlag, New York, 2002, pp. 130-146.
* A Secure Protocol for Computing Dot-products in Clustered and Distributed Environments (with Ananth Grama and Ioannis Ioannidis). Proc. 2002 Int. Conf. on Parallel Processing (ICPP 02), Vancouver, British Columbia, August 2002, pp. 79-384.
* Why NLP should move into IAS (with Victor Raskin, Sergei Nirenburg, Christian F. Hempelmann, and Katrina E. Triezenberg). Proceedings of the Workshop on a Roadmap for Computational Linguistics (COLING), Steven Krauwer (ed.), Taipei, Taiwan: Academia Sinica, 2002, pp. 1-7.
* Outsourcing Scientific Computations Securely, (with John R. Rice). Proc. International NAISO (Natural & Artificial Intelligence Systems Organization) Congress on Information Science Innovations, Dubai, U.A.E., March 2001.
* Natural Language Watermarking: Design, Analysis, and a Proof-of-Concept Implementation (with Victor Raskin; students: Michael C. Crogan, Christian Hempelmann, Florian Kerschbaum, Dina Mohamed, Sanket Naik). Proc. 4th International Information Hiding Workshop (IHW 01), Pittsburgh, Pennsylvania, April 2001, pp. 185-199. Lecture Notes in Computer Science, Vol. 2137, Springer Verlag.
* Privacy-Preserving Cooperative Scientific Computations (with Kevin Du). Proc. 14th IEEE Computer Security Foundations Workshop (CSFW 01), Cape Breton, Nova Scotia, Canada, June 2001, pp. 273-282.
* Secure Multi-Party Computational Geometry (with Kevin Du). Proc. 2001 Workshop on Algorithms and Data Structures (WADS 01), Providence, Rhode Island, August 2001. Lecture Notes in Computer Science, Vol. 2125, Springer Verlag, pp. 165-179.
* Secure Multi-Party Computation Problems and their Applications: A Review and Open Problems (with Kevin Du). Proc. 10th ACM/SIGSAC New Security Paradigms Workshop (NSPW 01), Cloudcroft, New Mexico, September 2001, pp. 11-20.
* Protecting Software Code by Guards (with Hoi Chang). Proc. ACM Workshop on Security and Privacy in Digital Rights Management (SPDRM 01), Philadelphia, Pennsylvania, November 2001, pp. 160-175.
* Privacy-preserving Cooperative Statistical Analysis (with Kevin Du). Proc. 17th Annual Computer Security Applications Conference (ACSAC 01), New Orleans, Louisiana, December 2001, pp. 102-110.
* (Almost) Optimal Parallel Block Access for Range Queries, (with Sunil K. Prabhakar). Proc. 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 00), Dallas, Texas, May 2000, pp. 205-215.
* Better Logging Through Formality: Applying Formal Specification Techniques to Improve Audit Logs and Audit Consumers, (with Chapman Flack). Lecture Notes in Computer Science, Vol. 1907, Springer Verlag, Proc. 3rd International Workshop on the Recent Advances in Intrusion Detection (RAID 00), Toulouse, France, October 2000, pp. 1-16.
* Natural Language Processing for Information Assurance, (with Chris McDonough, Sergei Nirenburg, and Victor Raskin). Proc. 9th ACM/SIGSAC New Security Paradigms Workshop (NSPW 00), Cork, Ireland, September 2000, pp. 51-65.
Protocols for Secure Remote Database Access with Approximate Matching, (with Kevin Du). Proc. 1st ACM Workshop on Security and Privacy in E-Commerce, Athens, Greece, November 2000, 25 pages.
* Watermarking Data Using Quadratic Residues, (with Samuel S. Wagstaff). Proc. of SPIE Workshop on Electronic Imaging (SPIE 99), SPIE - The International Society for Optical Engineering, San Jose, January 1999, SPIE Vol. 3657, pp. 283-288.
* Disclosure Limitation of Sensitive Rules, (with Elisa Bertino, Ahmed K. Elmagarmid, M. Ibrahim, and Vassilis Verykios). Proc. IEEE Knowledge and Data Engineering Exchange Workshop (KDEX 99), Chicago, November 1999, pp. 45-52.
* Parallel Geometric Algorithms in Coarse-Grain Network Models (with Danny Z. Chen). Lecture Notes in Computer Science, Vol. 1449, Springer Verlag, Proc. of the Fourth Annual International Computing and Combinatorics Conference (COCOON 98), Taipei, Taiwan, August 1998, pp. 55-64.
Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems, (with Danny Z. Chen and K.S. Klenk). Proc. Ninth Canadian Conference on Computational Geometry (CCG 97), Kingston, Canada, 1997, pp. 59-64.
* Static Matching of Ordered Program Segments to Dedicated Machines in a Heterogeneous Computing Environment, (with Dan W. Watson, John K. Antonio, H.J. Siegel, R. Gupta). Proc. 5th IEEE Workshop on Heterogeneous Processing, Honolulu, Hawaii, 1996, pp. 24-37.
Pattern Matching Image Compression (Abstract), (with Yann Genin and Wojciech Szpankowski). Proc. IEEE Data Compression Conference (DCC 96), Snowbird, Utah, 1996, p. 421.
A Pattern Matching Approach to Image Compression, (with Yann Genin and Wojciech Szpankowski). Proc. 3rd IEEE International Conference on Image Processing (ICIP 96), Lausanne, Switzerland, September 1996, pp. 349-356.
Applications of a Numbering Scheme for Polygonal Obstacles in the Plane, (with Danny Z. Chen). Proc. 7th Annual International Symposium on Algorithms and Computation (ISAAC 96), Osaka, Japan, 1996, Springer Verlag Lecture Notes in Computer Sci.: 1178, December 1996, pp. 1-24.
* Internet, Education and the Web, (with Elias N. Houstis, Anupam Joshi, Sanjiva Weerawarana, and Ahmed K. Elmagarmid). Proc. IEEE 5th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE 96), Stanford, California, 1996, pp. 27-32.
Parallel Algorithms for Maximum Matching in Interval Graphs, (with Marilyn G. Andrews, Danny Z. Chen, D.T. Lee). Proc. 9th IEEE International Parallel Processing Symposium (IPPS 95), Santa Barbara, California, 1995, pp. 84-92.
* Static Program Decomposition Among Machines in an SIMD/SPMD Heterogeneous Environment with Non-Constant Mode Switching Costs, (with Dan W. Watson, H.J. Siegel, John K. Antonio). Proc. 3d IEEE Workshop on Heterogeneous Processing, Cancun, Mexico, 1994, pp. 58-65.
* Biased Finger Trees and Their Use in Dynamic Computational Geometry, (with Michael T. Goodrich and Kumar Ramaiyer). Proc. 10th Annual ACM Symp. on Computational Geometry (SoCG 94), Stony Brook, New York, 1994, pp. 150-159.
On the Multisearching Problem for Hypercubes, (with Andreas Fabri). Proc. 6th Parallel Architectures and Languages Europe Symp. (PARLE 94), Athens, Greece, 1994, Springer Verlag Lecture Notes in Computer Sci.: 817, 1994, pp. 159-166.
* A System for Drawing Graphs with Geometric Symmetry, (with Joseph B. Manning, K. Cudjoe, J. Lozito and R. Pacheco). Proc. 1994 Workshop on Graph Drawing (GD 94), Princeton, New Jersey, 1994, Springer Verlag Lecture Notes in Computer Sci.: 894, 1994, pp. 262-265.
* A Framework for Compile-Time Selection of Parallel Modes in an SIMD/SPMD Heterogeneous Environment, (with Dan W. Watson, H.J. Siegel, John K. Antonio, Mark A. Nichols). Proc. 2d IEEE Workshop on Heterogeneous Processing, Newport Beach, California, 1993, pp. 57-64.
On Parallel Rectilinear Obstacle-Avoiding Paths, (with Danny Z. Chen). Proc. 5th Canadian Conference on Computational Geometry (CCG 93), Waterloo, Canada, 1993, pp. 210-215.
Computing the All-Pairs Longest Chains in the Plane, (with Danny Z. Chen). Proc. 1993 Workshop on Algorithms and Data Structures (WADS 93), Montreal, Canada, 1993. Springer Verlag Lecture Notes in Computer Sci.: 709, 1993, pp. 1-13.
An Optimal Algorithm for Shortest Paths on Interval and Circular-Arc Graphs, with Applications, (with Danny Z. Chen and D.T. Lee). Proc. 1st Annual European Symposium on Algorithms (ESA 93), Bad Honnef, Germany, 1993. Springer Verlag Lecture Notes in Computer Sci.: 726, 1993, pp. 13-24.
Optimal Parallel Hypercube Algorithms for Polygon Problems, (with Danny Z. Chen). Proc. 5th IEEE Symposium on Parallel and Distributed Processing (SPDP 93), Dallas, Texas, 1993, pp. 208-215.
Pattern Matching with Mismatches: A Probabilistic Analysis and a Randomized Algorithm, (with Philippe Jacquet and Wojciech Szpankowski). Proc. 3rd Combinatorial Pattern Matching Symposium (CPM 92), Tucson, Arizona, 1992. Springer Verlag Lecture Notes in Computer Science: 644 (eds. Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber), pp. 27-40, 1992.
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix, (with S. Rao Kosaraju). Proc. 2d ACM-SIAM Symp. on Discrete Algorithms (SODA 91), San Francisco, California, 1991, pp. 394-403.
Co-Scheduling Compute-Intensive Tasks on a Network of Workstations: Models and Algorithms, (with Christina Lock, Dan C. Marinescu, H.J. Siegel, and Thomas L. Casavant). Proc. 11th Int. Conf. on Distributed Computing Systems (ICDCS 91), Arlington, Texas, 1991, pp. 344-352.
Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer, (with Frank Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay). Proc. 2d Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA 91), Hilton Head, South Carolina, 1991, pp. 204-214.
An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal, (with Michael T. Goodrich and Mark H. Overmars). Proc. of the 17th Annual International Colloquium on Automata, Languages, and Programming (ICALP 90), Warwick, United Kingdom, 1990. Springer Verlag Lecture Notes in Computer Sci.: 443, 1990, pp. 689-702.
P-Complete Geometric Problems, (with Paul Callahan and Michael T. Goodrich). Proc. 2d Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA 90), Crete, Greece, 1990, pp. 317-326.
Parallel Rectilinear Shortest Paths with Rectangular Obstacles, (with Danny Z. Chen). Proc. 2d Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA 90), Crete, Greece, 1990, pp. 270-279.
A Faster Parallel Algorithm for a Matrix Searching Problem. Proc. 2d Scandinavian Workshop on Algorithm Theory (SWAT 90), Bergen, Norway, 1990. Springer Verlag Lecture Notes in Computer Sci.: 447 1990, pp. 192-200.
On the Parallel-Decomposibility of Geometric Problems, (with Jyh-Jong Tsay). Proc. 5th Annual ACM Symp. on Computational Geometry (SoCG 89), Saarbrucken, Federal Republic of Germany, 1989, pp. 104-113.
An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point, (with Danny Z. Chen). Proc. 5th Annual ACM Symp. on Computational Geometry (SoCG 89), Saarbrucken, Federal Republic of Germany, 1989, pp. 114-123.
* Constructing Trees in Parallel, (with S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, and Shanghua Teng). Proc. 1st Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA 89), Santa Fe, New Mexico, 1989, pp. 421-431.
Optimal Channel Placement for Multi-Terminal Nets, (with Susanne E. Hambrusch). Proc. 1989 Workshop on Algorithms and Data Structures (WADS 89), Ottawa, Canada, 1989, pp. 421-431.
* Fast Detection and Display of Symmetry in Embedded Planar Graphs, (with Joseph B. Manning). Proc. 19th Southeastern Int. Conf. on Combinatorics, Graph Theory and Computing, Baton Rouge, Louisiana, 1988.
On the Parallel Complexity of Evaluating Some Sequences of Set Manipulation Operations, (with S. Rao Kosaraju and Michael T. Goodrich). Proc. 3rd Aegean Workshop on Computing (AWOC 88), Lecture Notes in Computer Science, 319: VLSI Algorithms and Architectures, Springer-Verlag, New York, 1988, pp. 1-10.
Efficient Parallel Algorithms for String Editing and Related Problems, (with Alberto Apostolico, Lawrence L. Larmore, and H. Scott McFaddin). Proc. 26th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, Illinois, 1988, pp. 253-263.
Parallel Topological Sorting of Features in a Binary Image, (with Susanne E. Hambrusch and Lynn E. TeWinkel). Proc. 26th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, Illinois, 1988, pp. 1114-1115.
Efficient Solutions to Some Maxdominance Problems, (with S. Rao Kosaraju). Proc. 21st Annual Conf. on Info. Sciences and Systems (CISS 87), Baltimore, Maryland, 1987, pp. 600-610.
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms, (with Richard Cole and Michael T. Goodrich). Proc. 28th Annual IEEE Symp. on Foundations of Computer Sci. (FOCS 87), Marina Del Rey, California, 1987, pp. 151-160.
Optimal Simulations Between Mesh-Connected Arrays of Processors, (with S. Rao Kosaraju). Proc. 18th Annual ACM Symp. on Theory of Computing (STOC 86), Berkeley, California, 1986, pp. 264-271.
Efficient Plane Sweeping in Parallel, (with Michael T. Goodrich). Proc. 2nd Annual ACM Symp. on Computational Geometry (SoCG 86), Yorktown Heights, New York, 1986, pp. 216-225.
Parallel Algorithms for Some Functions of Two Convex Polygons, (with Michael T. Goodrich). Proc. 24th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, Illinois, 1986, pp. 758-767.
Efficient Solutions to a Class of Placement Problems, (with Susanne E. Hambrusch). Proc. 11th Annual Workshop on Graph-Theoretic Concepts in Computer Sci. (WG 85), Wuerzburg, West Germany, 1985, pp. 11-21.
Parallel Solutions to Geometric Problems, (with Michael T. Goodrich). Proc. 1985 Int. Conf. on Parallel Processing (ICPP 85), St. Charles, Illinois, 1985, pp. 411-417.
Solving Tree Problems on a Mesh-Connected Processor Array, (with Susanne E. Hambrusch). Proc. 26th Annual IEEE Symp. on Foundations of Computer Sci. (FOCS 85), Portland, Oregon, 1985, pp. 222-231.
Simulations Between Mesh-Connected Processor Arrays. Proc. 23nd Annual Allerton Conf. on Communication, Control, and Computing, Monticello, Illinois, 1985, pp. 268-269.
Detecting Symmetry in a Planar Figure. Proc. 22nd Annual Allerton Conf. on Communication, Control, and Computing, Monticello, Illinois, 1984, pp. 101-102.
* Drawing Nonintersecting Segments Between Two Planar Sets. Proc. 22nd Annual Allerton Conf. on Communication, Control, and Computing, Monticello, Illinois, 1984, pp. 113-119.
Finding Euler Tours in Parallel. Proc. 17th Annual Conf. on Info. Sciences and Systems (CISS 83), Baltimore, Maryland, 1983, pp. 685-689.
Dynamic Computational Geometry. Proc. 24th Annual IEEE Symp. on Foundations of Computer Sci. (FOCS 83), Tucson, Arizona, 1983, pp. 92-99.
Graph Problems on a Mesh-Connected Processor Array, (with S.R. Kosaraju). Proc. 14th Annual ACM Symp. on Theory of Computing (STOC 82), San Francisco, California, 1982, pp. 345-353.
An Adversary-Based Lower Bound for Sorting, (with S. Rao Kosaraju). Proc. 15th Annual Conf. on Info. Sciences and Systems (CISS 81), Baltimore, Maryland, 1981, pp. 7-8.
* Security in Cyber-Enabled Design and Manufacturing: A Survey (with Adam Dachowicz, Siva Chaitanya Chaduvula, and Jitesh H. Panchal). ASME Journal of Computing and Information Science in Engineering. Volume 18, No. 4, July 2018, 15 pages.
* Secure Co-design: Achieving Optimality without Revealing (with Siva Chaitanya Chaduvula, and Jitesh Panchal). Journal of Computing and Information Science in Engineering. Vol. 18, No. 2, March 2018, 14 pages.
Secure Collaboration in Engineering Systems Design (with Shumiao Wang, Siddharth Bhandari, Siva Chaitanya Chaduvula, Jitesh Panchal, and Karthik Ramani). ASME Journal of Computing and Information Science in Engineering (JCISE), Vol. 17, No. 4, June 2017, 11 pages.
* Microstructure-based Counterfeit Detection in Metal Part Manufacturing (with Adam Dachowicz, Siva Chaitanya Chaduvula, and Jitesh Panchal). Journal of Materials (JOM) (the main journal of The Minerals, Metals & Materials Society). November 2017, Volume 69, Issue 11, pp. 2390-2396.
* On Approximate Pattern Matching with Thresholds (with Peng Zhang). Info. Processing Letters. Vol. 123, 2017, pp. 21-26.
* Securing Aggregate Queries for DNA Databases (with Qutaibah Malluhi, Mohamed Nassar, and Abdullatif Shifka). IEEE Transactions on Cloud Computing. Volume PP, Issue 99, March 2017, 12 pages.
Inhibiting and Detecting Offline Password Cracking using ErsatzPasswords (with Mohammed H. Almeshekah, Chris Gutierrez, Eugene H. Spafford, and Jeff Avery). ACM Transactions on Privacy and Security. Volume 19 Issue 3, December 2016 Article No. 9.
Similarity Group-by Operators for Multi-dimensional Relational Data (with Ruby Y. Tahboub, Mingjie Tang, Walid G. Aref, Qutaibah M. Malluhi, Mourad Ouzzani, Yasin N. Silva). IEEE Trans. on Knowledge and Data Engineering, 28 (2), 2016, pp. 510-523.
Security-aware Business Process as a Service by hiding provenance (with Mehdi Bentounssi and Salima Benbernou). Computer Standards & Interfaces, 44, 2016, pp. 220-233.
* A Scheme for Collaboratively Processing Nearest Neighbor Queries in Oblivious Storage (with Keith Frikken and Shumiao Wang). EAI Transactions on Collaborative Computing, 14 (2), 2014.
* A Lower-Variance Randomized Algorithm for Approximate String Matching (with Elena Grigorescu and Yi Wu). Info. Processing Letters, 113 (18), 2013, pp. 690-692.
* Efficient Relaxed Search in Hierarchically-Clustered Sequence Datasets (with Kai Bader and Christian Grothoff). Journal of Experimental Algorithmics, 17 (1), 2012, 18 pages.
* Efficient and Practical Approach for Private Record Linkage (with Mohamed Yakout and Ahmed Elmagarmid). ACM Journal of Data and Information Quality, 3 (3), 2012, 28 pages.
* Running Max/Min Filters using Comparisons per Sample (with Hao Yuan). IEEE Transactions on Pattern Analysis and Machine Intelligence (IEEE-PAMI), 33 (12) (2011), pp. 2544-2548.
* Pattern Matching in the Hamming Distance with Thresholds (with Timothy W. Duket). Info. Processing Letters, 111 (14), (2011) pp. 674-677.
Asymptotically Efficient Algorithms for Skyline Probabilities of Uncertain Data (with Hao Yuan and Yinian Qi). ACM Transactions on Database Systems, 36 (2), (2011).
* On the Complexity of Authorization in RBAC under Qualification and Security Constraints (with Yuqing Sun, Qihua Wang, Ninghui Li, and Elisa Bertino). IEEE Transactions on Dependable and Secure Computing, 8 (6) (2011), pp. 883-897.
* Outsourcing Manufacturing: Secure Price Masking Mechanisms for Purchasing Component Parts (with Vinayak Deshpande, Leroy Schwarz, Marina Blanton, and Keith Frikken). Production and Operations Management (POMS), 20 (2) (2011), pp. 165-180.
Dynamic and Efficient Key Management for Access Hierarchies (with Marina Blanton, Nelly Fazio, and Keith B. Frikken). ACM Transactions on Information and System Security (TISSEC), 12 (2009).
* A Tree-Covering Problem Arising in Integrity of Tree-Structured Data (with Greg Frederickson and Ashish Kundu). Info. Processing Letters, 109 (2008), pp. 79-82.
Private Information: To Reveal Or Not To Reveal (with Danfeng Yao, Keith Frikken, and Roberto Tamassia). ACM Transactions on Information and System Security (TISSEC), 12 (2008).
An Empirical Study of Automatic Event Reconstruction Systems (with Sundararaman Jeyaraman). Digital Forensics, 3(1) (2006), pp. 108-115.
Translation-Based Steganography (with Christian Grothoff, Krista Grothoff, Ludmila Alkhutova, and Ryan Stutsman). Journal of Computer Security, 17(3) (2009), pp. 269-303.
Attribute-Based Access Control with Hidden Policies and Hidden Credentials (with Keith B. Frikken and Jiangtao Li). IEEE Transactions on Computers, 55 (2006), pp. 1259-1270.
Succinct Representation of Flexible and Privacy-Preserving Access Rights (with Marina Blanton). The VLDB Journal: The International Journal of Very Large Databases, 15(4) (2006), pp. 334-354.
Rights Protection for Discrete Numeric Streams (with Radu Sion and Sunil Prabhakar). IEEE Transactions on Knowledge and Data Engineering (TKDE), 18 (2006), pp. 699-714.
A Tree-based Forward Digest Protocol to Verify Data Integrity in Distributed Media Streaming (with Ahsan Habib, Dongyan Xu, Bharat Bhargava, and John Chuang). IEEE Transactions on Knowledge and Data Engineering (TKDE), 17 (2005), pp. 1010-1014.
Rights Protection for Categorical Data (with Radu Sion and Sunil Prabhakar). IEEE Transactions on Knowledge and Data Engineering (TKDE), 17 (2005), pp. 912-926.
Secure Outsourcing of Sequence Comparisons (with Jiangtao Li). International Journal of Information Security, 2005, pp. 277-287.
Adaptive Data Structures for IP Lookups (with Ananth Grama and Ioannis Ioannidis). ACM Journal of Experimental Algorithmics (JEA), 10 (2005), pp. 1-24.
* A Survey of Anti-Tamper Technologies, (with Eric D. Bryant and Martin R. Stytz). CrossTalk, The Journal of Defense Software Engineering, 17 (2004), pp. 12-16.
Reliable Detection of Episodes in Event Sequences, (with Robert Gwadera and Wojciech Szpankowski). Knowledge and Information Systems Journal (KAIS), 7 (2005), pp. 415-437.
Rights Protection for Relational Data, (with Radu Sion and Sunil Prabhakar). IEEE Transactions on Knowledge and Data Engineering (TKDE), 16 (2004), pp. 1509-1525.
Augmenting LZ-77 with Authentication and Integrity Assurance Capabilities, (with Stefano Lonardi). Concurrency: Practice and Experience, 16 (2004), pp. 1063-1076.
* Digital Rights Protection, (with Sunil Prabhakar, Keith Frikken, Radu Sion). IEEE Data Engineering Bulletin, 27 (2004), pp. 19-26.
Efficient Parallel Algorithms for Planar st-Graphs, (with D.Z. Chen and O. Daescu). Algorithmica, 35 (2003), pp. 194-215.
(Almost) Optimal Parallel Block Access for Range Queries, (with Sunil K. Prabhakar). Information Sciences, 157 (2003), pp. 21-31.
* Compact Recognizers of Episode Sequences, (with Alberto Apostolico). Information and Computation, 174 (2002), pp. 180-192.
* Faster Image Template Matching in the Sum of the Absolute Value of Differences Measure. IEEE Trans. on Image Processing, 10 (2001), pp. 659-663.
* On Connecting Red and Blue Rectangles with Monotone Nonintersecting Rectilinear Paths, (with Danny Z. Chen). Int. J. on Computational Geometry & Applications, 11 (2001).
* A Randomized Algorithm for Approximate String Matching, (with Frederic Chyzac and Philippe Dumas). Algorithmica, 29 (2001), pp. 468-486.
Secure Outsourcing of Scientific Computations, (with K.N. Pantazopoulos, John R. Rice, Eugene H. Spafford). Advances in Computers, Vol 54, Chapter 6, 2001, pp. 215-272.
* On Estimating the Large Entries of a Convolution. IEEE Trans. on Computers, 50 (2001), pp. 193-196.
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems, (with Marilyn G. Andrews, Danny Z. Chen, D.T. Lee). Algorithmica, 26 (2000), pp. 263-289.
Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems, (with Danny Z. Chen and K.S. Klenk). Parallel Processing Letters, 9 (1999), pp. 511-520.
* An Improved Hypercube Bound for Multi-searching and its Applications. Int. J. on Computational Geometry & Applications, 9 (1999), pp. 29-38.
Pattern Matching Image Compression: Algorithmic and Empirical Results, (with Yann Genin and Wojciech Szpankowski). IEEE Trans. on Pattern Analysis and Machine Intelligence, 21 (1999), pp. 614-627.
* Algorithms for Variable Length Subnet Address Assignment, (with Douglas E. Comer). IEEE Trans. on Computers, C-47 (1998), pp. 693-699.
On the Multisearching Problem for Hypercubes, (with Andreas Fabri). Computational Geometry: Theory and Applications, 5 (1996), pp. 293-302.
Computing the All-Pairs Longest Chains in the Plane, (with Danny Z. Chen). Int. J. on Computational Geometry & Applications, 5 (1995), pp. 257-271.
Optimal Parallel Hypercube Algorithms for Polygon Problems, (with Danny Z. Chen). IEEE Trans. on Computers, C-44 (1995), pp. 914-922.
An Optimal Algorithm for Shortest Paths on Interval and Circular-Arc Graphs, with Applications, (with Danny Z. Chen and D.T. Lee). Algorithmica, 14 (1995), pp. 429-441.
On the Parallel Complexity of Evaluating Some Sequences of Set Manipulation Operations, (with Michael T. Goodrich and S. Rao Kosaraju). J. of the ACM, 41 (1994), pp. 1049-1088.
* A Block-Based Mode Selection Model for SIMD/SPMD Heterogeneous Parallel Environments, (with Dan W. Watson, H.J. Siegel, John K. Antonio, Mark A. Nichols). J. of Parallel and Distributed Computing, 21 (1994), pp. 271-288.
* New Clique and Independent Set Algorithms for Circle Graphs, (with Alberto Apostolico and Susanne E. Hambrusch). Discrete Appl. Math. 36 (1992), pp. 1-24. An Erratum by the same authors, correcting a proof, appeared in Discrete Applied Mathematics, 41 (1993), pp. 179-180.
A Faster Parallel Algorithm for a Matrix Searching Problem. Algorithmica, 9 (1993), pp. 156-167.
Output-Sensitive Hidden Surface Elimination for Rectangles, (with Michael T. Goodrich and Mark H. Overmars). Info. and Computation, 107 (1993), pp. 1-24.
Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers, (with Frank Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay). J. of Parallel and Distributed Computing, 19 (1993), pp. 1-13.
* A Probabilistic Analysis of a Pattern Matching Problem, (with Philippe Jacquet and Wojciech Szpankowski). Random Structures and Algorithms, 4 (1993), pp. 191-213.
P-Complete Geometric Problems, (with Paul Callahan and Michael T. Goodrich). Int. J. on Computational Geometry & Applications, 3 (1993), pp. 443-462.
On Parallel Rectilinear Obstacle-Avoiding Paths, (with Danny Z. Chen). Computational Geometry: Theory and Applications, 3 (1993), pp. 307-313.
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix, (with S. Rao Kosaraju). J. of Algorithms, 13 (1992), pp. 394-413.
* Fast Detection and Display of Symmetry in Outerplanar Graphs, (with Joseph B. Manning). Discrete Appl. Math., 39 (1992), pp. 13-35.
On the Parallel-Decomposibility of Geometric Problems, (with Jyh-Jong Tsay). Algorithmica, 8 (1992), pp. 209-231.
An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point, (with Danny Z. Chen and Hubert Wagener). J. of the ACM, 38 (1991), pp. 516-533.
* Sequence Comparison on the Connection Machine, (with H. Scott McFaddin). Concurrency: Practice and Experience, 3 (1991), pp. 89-107.
* A Linear Time Algorithm for the Computation of Some Distance Functions between Convex Polygons, (with Celso Ribeiro and Sergio Lifschitz). RAIRO J. Oper. Res., 25 (1991), pp. 413-424.
* Computing Some Distance Functions Between Polygons, (with Celso Ribeiro and Sergio Lifschitz). Pattern Recognition, 24 (1991), pp. 775-781.
Parallel Rectilinear Shortest Paths with Rectangular Obstacles, (with Danny Z. Chen). Computational Geometry: Theory and Applications, 1 (1991), pp. 79-113.
* On Performing Robust Order Statistics on Tree-Structured Dictionary Machines, (with Michael T. Goodrich). J. of Parallel and Distributed Computing, 9 (1990), pp. 69-76.
Efficient Parallel Algorithms for String Editing and Related Problems, (with A. Apostolico, L. Larmore, and H.S. McFaddin). SIAM J. on Computing, 19 (1990), pp. 968-988.
An Efficient Algorithm for Maxdominance, With Applications, (with S. Rao Kosaraju). Algorithmica, 4 (1989), pp. 221-236.
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms, (with R. Cole and Michael T. Goodrich). SIAM J. on Computing, 18 (1989), pp. 499-532.
* An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem, (with Danny Z. Chen). Info. Processing Letters, 32 (1989), pp. 159-165.
Optimal Simulations Between Mesh-Connected Arrays of Processors, (with S. Rao Kosaraju). J. of the ACM, 35 (1988), pp. 635-650.
On Multidimensional Arrays of Processors. IEEE Trans. on Computers, C-37 (1988), pp. 1306-1309. Reprinted in 1994 in Interconnection Networks for High-Performance Parallel Computers, I.D. Scherson and A.S. Youssef (Ed.), IEEE Computer Society Press.
* Finding a Minimum Independent Dominating Set in a Permutation Graph, (with G.K. Manacher and J. Urrutia). Discrete Appl. Math., 21 (1988), pp. 177-183.
Fast Detection and Display of Symmetry in Trees, (with J.B. Manning). Congressus Numerantium, 64 (1988), pp. 159-169.
Parallel Algorithms for Some Functions of Two Convex Polygons, (with Michael T. Goodrich). Algorithmica, 3 (1988), pp. 535-548.
Efficient Solutions to Some Transportation Problems, With Applications to Minimizing Robot Arm Travel, (with S. Rao Kosaraju). SIAM J. on Computing, 17 (1988), pp. 849-869.
Sorting With Efficient Use of Special-Purpose Sorters, (with Greg N. Frederickson and S. Rao Kosaraju). Info. Processing Letters, 27 (1988), pp. 13-15.
Efficient Algorithms for Common Transversals, (with C. Bajaj). Info. Processing Letters, 25 (1987), pp. 87-91.
On Bipartite Matchings of Minimum Density, (with Susanne E. Hambrusch). J. of Algorithms, 8 (1987), pp. 480-502.
A Note on Finding a Maximum Empty Rectangle, (with Greg N. Frederickson). Discrete Appl. Math., 13 (1986), pp. 87-91.
Solving Tree Problems on a Mesh-Connected Processor Array, (with Susanne E. Hambrusch). Info. and Control, 69 (1986), pp. 168-187.
Computing the Convex Hull of Line Intersections. J. of Algorithms, 7 (1986), pp. 285-288.
Optimal Rotation Problems in Channel Routing, (with Susanne E. Hambrusch). IEEE Trans. on Computers, C-35 (1986), pp. 843-847.
Efficient Parallel Solutions to Some Geometric Problems, (with M.T. Goodrich). J. of Parallel and Distributed Computing, 3 (1986), pp. 492-507.
An Assignment Algorithm With Applications to Integrated Circuit Layout, (with Susanne E. Hambrusch). Discrete Appl. Math., 13 (1986), pp. 9-22.
A Generalized Dictionary Machine for VLSI, (with S. Rao Kosaraju). IEEE Trans. on Computers, C-34 (1985), pp. 151-155.
Some Dynamic Computational Geometry Problems. Computers and Math. w. Appl., 11 (1985), pp. 1171-1181.
A Matching Problem in the Plane. J. of Computer and System Sciences, 31 (1985), pp. 63-70.
On Symmetry Detection. IEEE Trans. on Computers, C-34 (1985), pp. 663-666.
Graph Problems on a Mesh-Connected Processor Array, (with S. Rao Kosaraju). J. of the ACM, 31 (1984), pp. 649-667.
Checking Similarity of Planar Figures. Int. J. of Computer and Info. Sciences, 13 (1984), pp. 279-290.
Finding Euler Tours in Parallel, (with Uzi Vishkin). J. of Computer and System Sciences, 29 (1984), pp. 330-337.
Parallel Strong Orientation of an Undirected Graph. Info. Proc. Letters, 18 (1984), pp. 37-39.
A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons. Info. Processing Letters, 17 (1983), pp. 207-209.
Finding the Cyclic index of an Irreducible, Nonnegative Matrix. SIAM J. on Computing, 11 (1982), pp. 567-570.
An Adversary-Based Lower Bound for Sorting, (with S. Rao Kosaraju). Info. Processing Letters, 13 (1981), pp. 55-57.
Algorithms and Theory of Computation Handbook, Volume 1: General Concepts and Techniques (Ed. with Marina Blanton), Chapman and Hall/CRC press, 2009, 1938 pages.
Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques (Ed. with Marina Blanton), Chapman and Hall/CRC press, 2009.
Privacy-Preserving Cryptographic Protocols (with Keith B. Frikken). Digital Privacy Theories, Technologies, and Practices, Alessandro Acquisiti, Stefanos Gritzalis, Costas Lambrinoudakis, and Sabrina e Capitani di Vimercati (eds), Auerbach, 2008.
Digital Rights Management, (with Keith Frikken, Carrie Black, Susan Overstreet, Pooja Bhatia). Practical Handbook of Internet Computing, Munindar P. Singh (Ed.), CRC Press, 2004.
Protocols for Secure Remote Database Access with Approximate Matching, (with Kevin Du). Recent Advances in Secure and Private E-Commerce, Kluwer Academic Publishers, 2001.
Deterministic Parallel Computational Geometry, (with Danny Z. Chen). Computational Geometry, Joerg-Rudiger Sack and Jorge Urrutia (Eds.), 1999.
Handbook of Algorithms and Theory of Computation (Ed.), CRC Press, 1999, 1296 pages.
Parallel Computations of Levenshtein Distances, (with Alberto Apostolico). Pattern Matching Algorithms and Applications, Alberto Apostolico and Zvi Galil (Eds.), Oxford University Press, 1997, pp. 143-184.
Parallel Computational Geometry. Handbook of Parallel and Distributed Computing, Albert Zomaya (Ed.), McGraw-Hill, 1996, pp. 404-428.
Mixed-mode System Heterogeneous Computing, (with H. J. Siegel, Muthucumaru Maheswaran, Dan Watson, John Antonio). Heterogeneous Computing. Mary M. Eshaghian (Ed.), Artech House, 1996, pp. 19-66.
Parallel Computational Geometry, (with Danny Z. Chen). Parallel Computing: Paradigms and Applications, Albert Zomaya (Ed.), International Thomson, 1996, pp. 162-197.
Deterministic Parallel Computational Geometry, (with Michael T. Goodrich). Synthesis of Parallel Algorithms, John H. Reif (Ed.), Morgan Kaufmann, 1993, pp. 497-536.
Security Issues in Collaborative Computing (abstract of keynote talk). Lecture Notes in Computer Science, Vol. 4112, Springer Verlag, Proc. of the 12th Annual International Computing and Combinatorics Conference (COCOON 06), Taipei, Taiwan, August 2006, p. 2.
A Survey of Watermarking Techniques for Non-Media Digital Objects (abstract of keynote talk). Proc. Australasian Information Security Workshop (AISW 05), Newcastle, Australia, January 2005, p. 73.
Extreme Events Involving Computer Systems and Networks, Report of the Workshop on Extreme Events, National Center for Atmospheric Research, Boulder, Colorado, 2000, pp. 27-28.
Program Chair's Message. Proc. Second Merged IPPS/SPDP Symposium, San Juan, Puerto Rico, 1999, p. xvii.
Section Advisor's Introduction. Handbook of Computer Science and Engineering, CRC Press, 1997, pp. 29-31.
Issues on the Algorithm-Software Continuum (position statement as panel member). Proc. 4th Symposium on the Frontiers of Massively Parallel Computation, McLean, Virginia, 1992, p. 212.
Editor's Foreword. Algorithmica Special Issue on Computational Geometry, 8 (1992), pp. 343-344.
La Multiplication en Parallele des Matrices Concaves et ses Applications, Actes des Journees du Laboratoire d'Informatique de Paris-Nord, Villetaneuse, France, 1989, pp. 179-198.
2001-02 $40,118 Lilly Endowment Inc.
2001-02 $36,688 Lilly Endowment Inc.
2000-01 $25,623 Lilly Endowment Inc.
2000-01 $21,113 Lilly Endowment Inc.
2000-01 $24,507 Lilly Endowment Inc.
2000-01 $36,702 Lilly Endowment Inc.
1999-00 $21,685 Lilly Endowment Inc.
1999-00 $36,685 Lilly Endowment Inc.
1999-00 $39,000 Lilly Endowment Inc.
Served New York State's Education Dept. in a 3-member Site Visit Committee to SUNY Buffalo, in the framework of the State's Statewide Doctoral Program Review (1990).
2009 Rose-Hulman Inst. of Tech.
2000 Case Western Reserve Univ.
IEEE Distributed Computing Systems Conf.
IEEE Int. Parallel Processing Symp.
Note: All Theses are Ph.D. unless it is explicitly specified that they are M.S.
Jyh-Jong Tsay (1990). Currently Associate Professor at the Institute of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan.
Joseph B. Manning (1990). Currently Permanent College Lecturer, Computer Science, University College, Cork, Ireland.
Danny Z. Chen (1992). Currently Professor of Computer Science and Engineering, University of Notre Dame, South Bend, Indiana.
Weifa Liang, Australian National Univ.
Note: Excellent teaching evaluations. Selected among Top Ten Outstanding Teachers for the College of Science in 1994, 1995, and the Outstanding Teacher for 2004 and 2006. Advisor to Purdue UPE student organization (2003-04), Purdue ACM student organization (1995-97) and to WICS (Women in Computer Science) student organization (1982-84).

References: V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V.