Countries citing papers authored by Svetla Nikova⋆
Since
Specialization
Citations
This map shows the geographic impact of Svetla Nikova⋆'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 Svetla Nikova⋆ with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Svetla Nikova⋆ more than expected).
This network shows the impact of papers produced by Svetla Nikova⋆. 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 Svetla Nikova⋆. The network helps show where Svetla Nikova⋆ may publish in the future.
Co-authorship network of co-authors of Svetla Nikova⋆
This figure shows the co-authorship network connecting the top 25 collaborators of Svetla Nikova⋆.
A scholar is included among the top collaborators of Svetla Nikova⋆ based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Svetla Nikova⋆. Svetla Nikova⋆ is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Nıkolov, Nikolay, et al.. (2016). Cryptographically Strong S-Boxes Generated by Modified Immune Algorithm. Lecture notes in computer science. 9540. 31–42.3 indexed citations
6.
Reparaz, Oscar, Begül Bilgin, Benedikt Gierlichs, Svetla Nikova⋆, & Ingrid Verbauwhede. (2015). Consolidating Masking Schemes. Lecture notes in computer science. 2015. 719–783.7 indexed citations
7.
Bilgin, Begül, et al.. (2014). Higher-Order Glitch Resistant Implementation of the PRESENT S-Box. Lecture notes in computer science. 9024. 75–93.
8.
Bilgin, Begül, et al.. (2012). Threshold Implementations of all 3x3 and 4x4 S-boxes. Lecture notes in computer science. 2012. 300–91.7 indexed citations
9.
Nikova⋆, Svetla, Andreas Pashalidis, & Günther Pernul. (2011). Public Key Infrastructures, Services and Applications: 8th European Workshop, EuroPKI 2011. Springer eBooks.1 indexed citations
10.
Nikova⋆, Svetla, et al.. (2010). Searching Keywords with Wildcards on Encrypted Data. Lecture notes in computer science. 6280. 138–153.
11.
Gong, Zheng, Svetla Nikova⋆, & Yee Wei Law. (2010). KLEIN: A New Family of Lightweight Block Ciphers. Lecture notes in computer science. 7055. 1–18.5 indexed citations
12.
Barreto, Paulo S. L. M., Ventzislav Nikov, Svetla Nikova⋆, Vincent Rijmen, & Elmar Tischhauser. (2010). Whirlwind: a new cryptographic hash function. Designs Codes and Cryptography. 56(2-3). 141–162.17 indexed citations
13.
Preneel, Bart, S.M. Dodunekov, Vincent Rijmen, & Svetla Nikova⋆. (2009). Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes: Volume 23 - D Information and Communication Security. IOS Press eBooks.1 indexed citations
Nikova⋆, Svetla, Christian Rechberger, & Vincent Rijmen. (2006). Threshold implementations against side-channel attacks and glitches. Lecture notes in computer science. 4307. 529–545.109 indexed citations
16.
Nikova⋆, Svetla, et al.. (2005). On the Size of Monotone Span Programs. Lecture notes in computer science. 3352. 252–265.2 indexed citations
17.
Nikova⋆, Svetla, et al.. (2004). On Proactive Secret Sharing Schemes. Lecture notes in computer science. 3357. 308–325.1 indexed citations
18.
Nikova⋆, Svetla, et al.. (2003). On a resynchronization weakness in a class of combiners with memory. Lecture notes in computer science. 2576. 164–173.1 indexed citations
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.