R. Lakshmanan

dblp:141/7217 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secret sharing
0.212013
Graph access structures with optimal pixel expansion three · Inf. Comput. 2013
Graph algorithms and graph theory
graph access structures
0.212013
Graph access structures with optimal pixel expansion three · Inf. Comput. 2013
YearPublicationVenuePosition
2017 Construction of a (k, n)-visual cryptography scheme
R. Lakshmanan, Subramanian Arumugam 0001
Des. Codes Cryptogr.1
2014 On (k, n)*-visual cryptography scheme
Subramanian Arumugam 0001, R. Lakshmanan, Atulya K. Nagar
Des. Codes Cryptogr.2
2013 Graph access structures with optimal pixel expansion three
Subramanian Arumugam 0001, R. Lakshmanan, Atulya K. Nagar
Inf. Comput.2