Justie Su-tzu Juan

Orcid: 0000-0002-3654-2560

According to our database1, Justie Su-tzu Juan authored at least 50 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
RG-Based Region Incrementing Visual Cryptography with Abilities of OR and XOR Decryption.
Symmetry, February, 2024

An easy-to-implement construction for (k,n)-threshold progressive visual secret sharing schemes.
J. Inf. Secur. Appl., 2024

2023
L-PRNU: Low-Complexity Privacy-Preserving PRNU-Based Camera Attribution Scheme.
Comput., September, 2023

A (t, n)-Threshold Visual Secret Sharing Scheme Based on Polarization.
Proceedings of the 6th IEEE International Conference on Knowledge Innovation and Invention, 2023

2022
(n, n) XOR-based Visual Multi-secrets Sharing Scheme with Meaningful Shares.
Proceedings of the 5th IEEE International Conference on Knowledge Innovation and Invention, 2022

2021
(n, n) XOR-based visual cryptography schemes with different meaningful shares<sup>1</sup>.
Proceedings of the International Conference on Computational Science and Computational Intelligence, 2021

The Weakly Dimension-Balanced Pancyclicity on Toroidal Mesh Graph T<sub>m, n</sub> When Both m and n Are Odd.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Flexible meaningful visual multi-secret sharing scheme by random grids.
Multim. Tools Appl., 2020

An Easy-to-implement Construction for (k, n)-threshold Progressive Visual Secret Sharing Schemes.
CoRR, 2020

Efficient Approaches to the Mixture Distance Problem.
Algorithms, 2020

2019
Measuring similarity between two mixture trees using mixture distance metric and algorithms.
CoRR, 2019

Fault-Tolerant Visual Secret Sharing Scheme Using Meaningful Shares.
Proceedings of the IEEE 10th International Conference on Awareness Science and Technology, 2019

2018
A (<i>k</i>, <i>n</i>)-Threshold Progressive Visual Secret Sharing without Expansion.
Cryptogr., 2018

A New Visual Multi-Secrets Sharing Scheme by Random Grids.
Cryptogr., 2018

2017
Mutually independent Hamiltonianicity of Cartesian product graphs.
J. Supercomput., 2017

2015
Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes.
Theor. Comput. Sci., 2015

2013
Quality-adaptive visual secret sharing by random grids.
J. Syst. Softw., 2013

Power Domination in Honeycomb Meshes.
J. Inf. Sci. Eng., 2013

Finding the edge ranking number through vertex partitions.
Discret. Appl. Math., 2013

A flexible multiple-secret image sharing scheme by shifting random grids.
Proceedings of the IEEE International Symposium on Consumer Electronics, 2013

2012
Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems.
IEEE Trans. Parallel Distributed Syst., 2012

Antipodal Labelings for Cycles.
Ars Comb., 2012

The Hamiltonicity of WK-Recursive Pyramid.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2012

2011
Practical electronic auction scheme with strong anonymity and bidding privacy.
Inf. Sci., 2011

A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs.
Algorithmica, 2011

2010
L(j, k)-labelling and maximum ordering-degrees for trees.
Discret. Appl. Math., 2010

Path Embeddings and Related Properties in Cartesian Product Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010

Optimal Edge Ranking of Ladder Graphs.
Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

2009
Efficient Multi-secret Sharing Scheme Using Room Square.
Proceedings of the Third IEEE International Conference on Secure Software Integration and Reliability Improvement, 2009

An Efficient and Secure Multi-secret Image Sharing Scheme with General Access Structure.
Proceedings of the Third IEEE International Conference on Secure Software Integration and Reliability Improvement, 2009

An On-Line Parallel Algorithm for Node Ranking of Trees.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2009

2008
The strong distance problem on the Cartesian product of graphs.
Inf. Process. Lett., 2008

Adaptive group testing for consecutive positives.
Discret. Math., 2008

On the strong distance problems of pyramid networks.
Appl. Math. Comput., 2008

Secure and Efficient Multi-Secret Sharing Schemes with General Access Structures.
Proceedings of the 2008 International Conference on Foundations of Computer Science, 2008

Efficient Biometrics Remote User Authentication Scheme.
Proceedings of the 2008 International Conference on Security & Management, 2008

Computing the Mixture Distance Between Mixture Trees.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2008

2007
Group testing in graphs.
J. Comb. Optim., 2007

On the Verifiable and Detectable Multi-Use General Perfect Secret Sharing Schemes.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

A Perfect Secret Sharing Scheme for (r-1, r)-Uniform Hypergraph-Based Access Structures.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

A Simple Multi-Secret Sharing Scheme to Achieve Both Optimal Improvement Ratios.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

A Practical English Auction Based on the Discrete Logarithms.
Proceedings of the 2007 International Conference on Security & Management, 2007

2006
Simple Multi-Secret Sharing Schemes to Achieve the Optimal Maximum Improvement Ratio.
Proceedings of the IEEE International Conference on Sensor Networks, 2006

A Verifiable and Detectable Secret Sharing Scheme by Using a New Geometric Approach.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2005
Efficient Secret Sharing Schemes from Room Square.
Proceedings of the Third International Conference on Information Technology and Applications (ICITA 2005), 2005

On-line Ranking Algorithms for Trees.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

2004
The Strong Distance Problems.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

2001
Minimum Span of No-Hole (r+1)-Distant Colorings.
SIAM J. Discret. Math., 2001

No-hole 2-distant colorings for unit interval graphs.
Ars Comb., 2001

1999
T-Colorings and T-Edge Spans of Graphs.
Graphs Comb., 1999


  Loading...