Gregory M. Zaverucha
Impact in
-
- Opportunistic and Delay-Tolerant Networks
- Mobile Ad Hoc Networks
- Caching and Content Delivery
-
- Cryptography and Data Security
- Coding theory and cryptography
Papers in
-
- Cryptography and Data Security 3
- Cryptographic Implementations and Security 2
- Coding theory and cryptography 2
-
- Advanced Steganography and Watermarking Techniques 2
- Chaos-based Image/Signal Encryption 1
- Co-authors
- Aniket Kate (1 shared paper)Urs Hengartner (1 shared paper)Douglas R. Stinson (5 shared papers)Simon R. Blackburn⋆ (1 shared paper)Tuvi Etzion (1 shared paper)Jan Camenisch (1 shared paper)Thomas Groß (1 shared paper)Dieter Sommer (1 shared paper)
- Journals
- Advances in Mathematics of Communications (1 paper)IEEE Transactions on Information Theory (1 paper)Journal of Combinatorial Theory Series A (1 paper)Designs Codes and Cryptography (1 paper)
- Partner nations
- CanadaIsraelUnited Kingdom
In The Last Decade
Gregory M. Zaverucha
8 papers receiving 151 citations
Peers
Comparison fields: 5 of 22
- Computer Networks and Communications 106
- Artificial Intelligence 51
- Computer Vision and Pattern Recognition 22
- Electrical and Electronic Engineering 50
- Computational Theory and Mathematics 13
Countries citing papers authored by Gregory M. Zaverucha
This map shows the geographic impact of Gregory M. Zaverucha's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Gregory M. Zaverucha with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gregory M. Zaverucha more than expected).
Fields of papers citing papers by Gregory M. Zaverucha
This network shows the impact of papers produced by Gregory M. Zaverucha. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Gregory M. Zaverucha. The network helps show where Gregory M. Zaverucha may publish in the future.
Co-authors
The 10 scholars most cited alongside Gregory M. Zaverucha, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2007 | 110 | |
| 2 | 2008 | 18 | |
| 3 | 2011 | 11 | |
| 4 | 2008 | 10 | |
| 5 | Cryptographic Protocols of the Identity Mixer Library, v. 1.0 | 2009 | 7 |
| 6 | 2006 | 2 | |
| 7 | 2010 | 1 | |
| 8 | New Bounds for Generalized Separating Hash Families | 2007 | 1 |
About Gregory M. Zaverucha
Gregory M. Zaverucha is a scholar working on Artificial Intelligence, Computer Vision and Pattern Recognition, Electrical and Electronic Engineering, Computer Networks and Communications and Control and Systems Engineering, having authored 8 papers that have together received 160 indexed citations. Recurring topics across this work include Cryptography and Data Security (3 papers), graph theory and CDMA systems (3 papers), Advanced Steganography and Watermarking Techniques (2 papers), Cryptographic Implementations and Security (2 papers), Coding theory and cryptography (2 papers), Wireless Communication Security Techniques (1 paper), Chaos-based Image/Signal Encryption (1 paper) and Robotic Mechanisms and Dynamics (1 paper). The work is most often cited by research in Computer Networks and Communications (106 citations), Artificial Intelligence (51 citations), Computer Vision and Pattern Recognition (22 citations), Electrical and Electronic Engineering (50 citations) and Computational Theory and Mathematics (13 citations). Gregory M. Zaverucha has collaborated with scholars based in Canada, Israel and United Kingdom. Frequent co-authors include Aniket Kate, Urs Hengartner, Douglas R. Stinson, Simon R. Blackburn⋆, Tuvi Etzion, Jan Camenisch, Thomas Groß, Dieter Sommer, Carl Binding and David R. Cheriton. Their work appears in journals such as Advances in Mathematics of Communications, IEEE Transactions on Information Theory, Journal of Combinatorial Theory Series A and Designs Codes and Cryptography.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.