Joe Kilian

ScholarGPS® ID: 83275902923196

Affiliation

Rutgers, The State University of New Jersey, New Brunswick, Newark and Camden, United States

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Multimedia | Spread Spectrum | Digital Image Processing | Information Theory

Metrics Summary

Publication Count

Predicted Citations

17,335

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Fast Private Norm Estimation and Heavy Hitters (book chapter) In Theory of Cryptography Kilian, Joe \| Madeira, André \| Strauss, Martin J. \| Zheng, Xuan Springer Berlin Heidelberg (2008) 10.1007/978-3-540-78524-8_11 Cited by (4) \| Cite \| Source \| Open Access
Interactive Hashing: An Information Theoretic Tool (Invited Talk) (book chapter) In Information Theoretic Security Crépeau, Claude \| Kilian, Joe \| Savvides, George Springer Berlin Heidelberg (2008) 10.1007/978-3-540-85093-9_3 Cited by (5) \| Cite \| Source \| Open Access
A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting (book chapter) In Advances in Cryptology - ASIACRYPT 2008 Keller, Jason \| Kilian, Joe Springer Berlin Heidelberg (2008) 10.1007/978-3-540-89255-7_13 Cited by (3) \| Cite \| Source \| Open Access
Communication vs. Computation (journal article) Harsha, Prahladh \| Ishai, Yuval \| Kilian, Joe \| Nissim, Kobbi \| Venkatesh, S. computational complexity, volume 16, issue 1, pages 1-33 (2007). 10.1007/s00037-007-0224-y Cited by (2) \| Cite \| Source \| Open Access
On covert collaboration (conference) Baliga, Arati \| Kilian, Joe the 9th workshop (2007) Dallas, Texas, USA 10.1145/1288869.1288874 Cited by (5) \| Cite \| Source
Betting Boolean-style: a framework for trading in securities based on logical formulas (journal article) Fortnow, Lance \| Kilian, Joe \| Pennock, David M. \| Wellman, Michael P. Decision Support Systems, volume 39, issue 1, pages 87-104 (2005). 10.1016/j.dss.2004.08.010 Cited by (18) \| Cite \| Source \| Open Access
Lower Bounds For Concurrent Zero Knowledge* (journal article) Kilian, Joe \| Rackoff, Charles \| Petrank, Erez Combinatorica, volume 25, issue 2, pages 217-249 (2005). 10.1007/s00493-005-0014-6 Cited by (3) \| Cite \| Source \| Open Access
On Robust Combiners for Oblivious Transfer and Other Primitives (book chapter) In Advances in Cryptology – EUROCRYPT 2005 Harnik, Danny \| Kilian, Joe \| Naor, Moni \| Reingold, Omer \| Rosen, Alon Springer Berlin Heidelberg (2005) 10.1007/11426639_6 Cited by (89) \| Cite \| Source \| Open Access
Communication Versus Computation (book chapter) In Automata, Languages and Programming Harsha, Prahladh \| Ishai, Yuval \| Kilian, Joe \| Nissim, Kobbi \| Venkatesh, S. Springer Berlin Heidelberg (2004) 10.1007/978-3-540-27836-8_63 Cited by (7) \| Cite \| Source
Betting boolean-style: a framework for trading in securities based on logical formulas (conference) Fortnow, Lance \| Kilian, Joe \| Pennock, David M. \| Wellman, Michael P. EC03: The Fourth ACM Conference on Electronic Commerce (2003) San Diego CA USA 10.1145/779928.779946 Cited by (27) \| Cite \| Source \| Open Access
A sublinear algorithm for weakly approximating edit distance (conference) Batu, Tugkan \| Ergün, Funda \| Kilian, Joe \| Magen, Avner \| Raskhodnikova, Sofya \| Rubinfeld, Ronitt \| Sami, Rahul STOC03: The 35th Annual ACM Symposium on Theory of Computing (2003) San Diego CA USA 10.1145/780542.780590 Cited by (54) \| Cite \| Source \| Open Access
Extending Oblivious Transfers Efficiently (book chapter) In Advances in Cryptology - CRYPTO 2003 Ishai, Yuval \| Kilian, Joe \| Nissim, Kobbi \| Petrank, Erez Springer Berlin Heidelberg (2003) 10.1007/978-3-540-45146-4_9 Cited by (482) \| Cite \| Source \| Open Access
Zero-knowledge sets (conference) Micali, S. \| Rabin, M. \| Kilian, J. 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003 (2003) Cambridge, MA, USA 10.1109/SFCS.2003.1238183 Cited by (126) \| Cite \| Source
A sublinear algorithm for weakly approximating edit distance (conference) Batu, Tugkan \| Ergün, Funda \| Kilian, Joe \| Magen, Avner \| Raskhodnikova, Sofya \| Rubinfeld, Ronitt \| Sami, Rahul the thirty-fifth ACM symposium (2003) San Diego, CA, USA 10.1145/780587.780590 Cited by (6) \| Cite \| Source \| Open Access
GUEST EDITOR'S FOREWORD (journal article) Cowen, Lenore \| Fagin, Ronald \| Kilian, Joe \| Kleinberg, Jon Journal of Computer and System Sciences, volume 65, issue 1, pages 1- (2002). 10.1006/jcss.2002.1834 Cite \| Source \| Open Access
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds (journal article) Canetti, Ran \| Kilian, Joe \| Petrank, Erez \| Rosen, Alon SIAM Journal on Computing, volume 32, issue 1, pages 1-47 (2002). 10.1137/S0097539701392949 Cited by (48) \| Cite \| Source \| Open Access
Heuristics for Semirandom Graph Problems (journal article) Feige, Uriel \| Kilian, Joe Journal of Computer and System Sciences, volume 63, issue 4, pages 639-671 (2001). 10.1006/jcss.2001.1773 Cited by (92) \| Cite \| Source \| Open Access
Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds (conference) Canetti, Ran \| Kilian, Joe \| Petrank, Erez \| Rosen, Alon STOC01: 33rd ACM Symposium on Theory of Computing (2001) Hersonissos Greece 10.1145/380752.380852 Cited by (82) \| Cite \| Source
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds (conference) Kilian, Joe \| Petrank, Erez STOC01: 33rd ACM Symposium on Theory of Computing (2001) Hersonissos Greece 10.1145/380752.380851 Cited by (91) \| Cite \| Source
Designability of Graphitic Cones (journal article) Treacy, M. M. J. \| Kilian, J. MRS Proceedings, volume 675 (2001). 10.1557/PROC-675-W2.6.1 Cited by (2) \| Cite \| Source \| Open Access