Avishek Adhikari

Orcid: 0000-0002-7768-4629

According to our database1, Avishek Adhikari authored at least 62 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improved Fault Analysis on Subterranean 2.0.
IEEE Trans. Computers, June, 2024

Restricted near collision attack on Plantlet.
J. Cryptogr. Eng., April, 2024

Cryptanalysis of full round FUTURE with multiple biclique structures.
Peer Peer Netw. Appl., January, 2024

Yoyo cryptanalysis on Future.
Int. J. Appl. Cryptogr., 2024

2023
Proactive visual cryptographic schemes for general access structures.
Multim. Tools Appl., November, 2023

Revisiting Yoyo Tricks on AES.
IACR Trans. Symmetric Cryptol., 2023

(t, k, n) Regional Secret Image Sharing over Finite Fields.
Signal Process., 2023

2022
Practical attacks on a class of secret image sharing schemes based on Chinese Remainder Theorem.
Comput. Electr. Eng., 2022

Connectivity invariant lightweight resiliency improvement strategies for CRT-subset scheme.
Ad Hoc Networks, 2022

2021
Evolving Secret Sharing in Almost Semi-honest Model.
IACR Cryptol. ePrint Arch., 2021

2020
Essential secret image sharing scheme with small and equal sized shadows.
Signal Process. Image Commun., 2020

Evolving Secret Sharing with Essential Participants.
IACR Cryptol. ePrint Arch., 2020

Signless Laplacian spectrum of power graphs of finite cyclic groups.
AKCE Int. J. Graphs Comb., 2020

Cheating Detectable Ramp Secret Sharing with Optimal Cheating Resiliency.
Proceedings of the Information Systems Security - 16th International Conference, 2020

Color Visual Cryptography Schemes Using Linear Algebraic Techniques over Rings.
Proceedings of the Information Systems Security - 16th International Conference, 2020

2019
Ramp secret sharing with cheater identification in presence of rushing cheaters.
Groups Complex. Cryptol., 2019

Maximal contrast color visual secret sharing schemes.
Des. Codes Cryptogr., 2019

Visual Secret Sharing Scheme with Distributed Levels of Importance of Shadows.
Proceedings of the Fifth International Conference on Mathematics and Computing, 2019

2018
Single key MITM attack and biclique cryptanalysis of full round Khudra.
J. Inf. Secur. Appl., 2018

Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness.
Proceedings of the Information Security Practice and Experience, 2018

Secret Sharing Schemes on Compartmental Access Structure in Presence of Cheaters.
Proceedings of the Information Systems Security - 14th International Conference, 2018

2017
A new graph parameter and a construction of larger graph without increasing radio k-chromatic number.
J. Comb. Optim., 2017

Efficient Constructions for t- (k, n)<sup>*</sup>-Random Grid Visual Cryptographic Schemes.
IACR Cryptol. ePrint Arch., 2017

On relationship between Hamiltonian path and holes in -coloring of minimum span.
Discret. Appl. Math., 2017

Probabilistic signature based generalized framework for differential fault analysis of stream ciphers.
Cryptogr. Commun., 2017

Contrast Optimal XOR Based Visual Cryptographic Schemes.
Proceedings of the Information Theoretic Security - 10th International Conference, 2017

2016
Full key recovery of ACORN with a single fault.
J. Inf. Secur. Appl., 2016

Efficient Construction of Visual Cryptographic Scheme for Compartmented Access Structures.
IACR Cryptol. ePrint Arch., 2016

Constructions and analysis of some efficient t - (k, n)<sup>∗</sup>-visual cryptographic schemes using linear algebraic techniques.
Des. Codes Cryptogr., 2016

Differential Fault Analysis on Tiaoxin and AEGIS Family of Ciphers.
Proceedings of the Security in Computing and Communications - 4th International Symposium, 2016

On the Robustness of Visual Cryptographic Schemes.
Proceedings of the Digital Forensics and Watermarking - 15th International Workshop, 2016

2015
Probabilistic Signature Based Framework for Differential Fault Analysis of Stream Ciphers.
IACR Cryptol. ePrint Arch., 2015

Efficient Threshold Secret Sharing Schemes Secure against Rushing Cheaters.
IACR Cryptol. ePrint Arch., 2015

On characterizing radio k-coloring problem by path covering problem.
Discret. Math., 2015

Structural Form of a Minimal Critical Set for a Latin Square Representing the Elementary Abelian 2-group of Order 8.
Ars Comb., 2015

Plaintext checkable encryption with designated checker.
Adv. Math. Commun., 2015

Plaintext Checkable Signcryption.
Proceedings of the Information Systems Security - 11th International Conference, 2015

Computationally Secure Cheating Identifiable Multi-Secret Sharing for General Access Structure.
Proceedings of the Distributed Computing and Internet Technology, 2015

Improved practical differential fault analysis of grain-128.
Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, 2015

2014
One-sided leakage-resilient privacy only two-message oblivious transfer.
J. Inf. Secur. Appl., 2014

An Efficient t-Cheater Identifiable Secret Sharing Scheme with Optimal Cheater Resiliency.
IACR Cryptol. ePrint Arch., 2014

Multi-Bit Differential Fault Analysis of Grain-128 with Very Weak Assumptions.
IACR Cryptol. ePrint Arch., 2014

Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images.
Des. Codes Cryptogr., 2014

Multi-Use Multi-Secret Sharing Scheme for General Access Structure.
CoRR, 2014

An Efficient Robust Secret Sharing Scheme with Optimal Cheater Resiliency.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2014

Improved Multi-Bit Differential Fault Analysis of Trivium.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

XOR Based Non-monotone t- (k, n)^* -Visual Cryptographic Schemes Using Linear Algebra.
Proceedings of the Information and Communications Security - 16th International Conference, 2014

2013
Indistinguishability against Chosen Ciphertext Verification Attack Revisited: The Complete Picture.
Proceedings of the Provable Security - 7th International Conference, 2013

Signcryption from Randomness Recoverable PKE Revisited.
Proceedings of the Information Systems Security - 9th International Conference, 2013

2012
An efficient IND-CCA2 secure Paillier-based cryptosystem.
Inf. Process. Lett., 2012

A repeated game approach for analyzing the collusion on selective forwarding in multihop wireless networks.
Comput. Commun., 2012

2011
The domination numbers of cylindrical grid graphs.
Appl. Math. Comput., 2011

Mixed-Strategy Game Based Trust Management for Clustered Wireless Sensor Networks.
Proceedings of the Trusted Systems - Third International Conference, 2011

Cryptanalysis of Randomized Arithmetic Codes Based on Markov Model.
Proceedings of the Information Security and Cryptology - 7th International Conference, 2011

2010
An efficient multi-use multi-secret sharing scheme based on hash function.
Appl. Math. Lett., 2010

Cryptanalysis on an Image Scrambling Encryption Scheme Based on Pixel Bit.
Proceedings of the Digital Watermarking - 9th International Workshop, 2010

A New Scrambling Evaluation Scheme Based on Spatial Distribution Entropy and Centroid Difference of Bit-Plane.
Proceedings of the Digital Watermarking - 9th International Workshop, 2010

2007
Applications of Partially Balanced Incomplete Block Designs in Developing (2, <i>n</i>) Visual Cryptographic Schemes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

2006
DNA Secret Sharing.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2005
Critical sets in orthogonal arrays with 7 and 9 levels.
Australas. J Comb., 2005

2004
A New Black and White Visual Cryptographic Scheme for General Access Structures.
Proceedings of the Progress in Cryptology, 2004

2003
A New (2, n)-Visual Threshold Scheme for Color Images.
Proceedings of the Progress in Cryptology, 2003


  Loading...