Hovav Shacham
Artificial Intelligence · 2001–2016
A researcher in the Science corpus: 19 papers; trusts 41 researchers and is trusted by 235 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 80 citations into it; #1,934 of 36,961 by trust here, #2,195 by citations
- Information Systems — 49 citations into it; #113 of 9,233 by trust here, #232 by citations
- Computer Networks and Communications — 21 citations into it; #2,952 of 9,996 by trust here, #1,125 by citations
- Signal Processing — 19 citations into it; #264 of 7,592 by trust here, #471 by citations
- Computational Theory and Mathematics — 14 citations into it; #2,785 of 12,489 by trust here, #1,953 by citations
- Computer Vision and Pattern Recognition — 9 citations into it; #4,031 of 21,973 by trust here, #5,160 by citations
- Electrical and Electronic Engineering — 9 citations into it
Whom Hovav Shacham trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dan Boneh
- Giuseppe Ateniese
- Jean-Sébastien Coron
- Paulo L. Barreto
- Ronald Cramer
- Ari Juels
- Mihir Bellare
- Ben Lynn
- Amos Fiat
- Claus-Peter Schnorr
Who trusts Hovav Shacham overall
- Lucas Davi
- Dan Boneh
- Aurélien Francillon
- Ahmad-Reza Sadeghi
- Kui Ren
- Brent Waters
- Enes Göktas
- Tyler K. Bletsch
- Craig Gentry
- Xavier Boyen
Papers from Hovav Shacham's perspective
Ordered by how strongly the researchers Hovav Shacham trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- A method for obtaining digital signatures and public-key cryptosystems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Handbook of Applied Cryptography
- Short Signatures from the Weil Pairing
- Identity-Based Encryption from the Weil Pairing
- New Directions in Cryptography
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Hierarchical ID-Based Cryptography (International Conference on the Theory and Application of Cryptology and Information Security)
- Pors: proofs of retrievability for large files (Conference on Computer and Communications Security)
Their papers
- Return-Oriented Programming: Systems, Languages, and Applications (2012) — 631 citations
- Aggregate and Verifiably Encrypted Signatures from Bilinear Maps (2003) — 2,058 citations
- Sequential Aggregate Signatures from Trapdoor Permutations (2004) — 349 citations
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles (2006) — 355 citations
- Experimental Security Analysis of a Modern Automobile (2010) — 516 citations
- On the (In)effectiveness of Mosaicing and Blurring as Tools for Document Redaction (2016) — 79 citations
- Iago attacks: why the system call API is a bad untrusted RPC interface (2013) — 337 citations
- Pixel Perfect : Fingerprinting Canvas in HTML 5 (2012) — 334 citations
- Comprehensive Experimental Analyses of Automotive Attack Surfaces (2011) — 1,677 citations
- Return-oriented programming without returns (2010) — 639 citations
- An empirical study of privacy-violating information flows in JavaScript web applications (2010) — 209 citations
- When good instructions go bad: generalizing return-oriented programming to RISC (2008) — 441 citations
- Compact Proofs of Retrievability (2008) — 2,171 citations
- The geometry of innocent flesh on the bone: return-into-libc without function calls (on the x86) (2007) — 1,596 citations
- On the effectiveness of address-space randomization (2004) — 1,034 citations
- Group signatures with verifier-local revocation (2004) — 667 citations
- Short Group Signatures (2004) — 2,240 citations
- SiRiUS: Securing Remote Untrusted Storage (2003) — 669 citations
- Short Signatures from the Weil Pairing (2001) — 4,798 citations