default search action
Justie Su-tzu Juan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Hong-Bin Chen
, Hsiang-Chun Hsu
An easy-to-implement construction for (k,n)-threshold progressive visual secret sharing schemes. J. Inf. Secur. Appl. 83: 103757 (2024) - [j23]Yu-Ru Lin, Justie Su-Tzu Juan
RG-Based Region Incrementing Visual Cryptography with Abilities of OR and XOR Decryption. Symmetry 16(2): 153 (2024) - 2023
- [j22]Alan Huang, Justie Su-Tzu Juan
L-PRNU: Low-Complexity Privacy-Preserving PRNU-Based Camera Attribution Scheme. Comput. 12(10): 212 (2023) - [c24]Cang-Wei Huang, Justie Su-Tzu Juan:
A (t, n)-Threshold Visual Secret Sharing Scheme Based on Polarization. ICKII 2023: 172-176 - 2022
- [c23]Sheng-Yao Huang, An-Hui Lo, Justie Su-Tzu Juan:
(n, n) XOR-based Visual Multi-secrets Sharing Scheme with Meaningful Shares. ICKII 2022: 69-74 - 2021
- [c22]Justie Su-Tzu Juan
The Weakly Dimension-Balanced Pancyclicity on Toroidal Mesh Graph Tm, n When Both m and n Are Odd. COCOON 2021: 436-448 - [c21]An-Hui Lo, Justie Su-Tzu Juan:
(n, n) XOR-based visual cryptography schemes with different meaningful shares1. CSCI 2021: 1310-1316 - 2020
- [j21]Justie Su-Tzu Juan
Efficient Approaches to the Mixture Distance Problem. Algorithms 13(12): 314 (2020) - [j20]Bo-Yuan Huang, Justie Su-Tzu Juan
Flexible meaningful visual multi-secret sharing scheme by random grids. Multim. Tools Appl. 79(11-12): 7705-7729 (2020) - [i2]Hong-Bin Chen, Hsiang-Chun Hsu, Justie Su-Tzu Juan:
An Easy-to-implement Construction for (k, n)-threshold Progressive Visual Secret Sharing Schemes. CoRR abs/2002.09125 (2020)
2010 – 2019
- 2019
- [c20]Yu-Chun Chung, Jia-Hao Ou, Justie Su-Tzu Juan
Fault-Tolerant Visual Secret Sharing Scheme Using Meaningful Shares. iCAST 2019: 1-6 - [i1]Justie Su-tzu Juan, Yi-Ching Chen, Chen-Hui Lin, Shu-Chuan Chen:
Measuring similarity between two mixture trees using mixture distance metric and algorithms. CoRR abs/1911.12003 (2019) - 2018
- [j19]Joy Jo-Yi Chang, Bo-Yuan Huang, Justie Su-tzu Juan
A New Visual Multi-Secrets Sharing Scheme by Random Grids. Cryptogr. 2(3): 24 (2018) - [j18]Ying-Yu Chen, Bo-Yuan Huang, Justie Su-tzu Juan
A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion. Cryptogr. 2(4): 28 (2018) - 2017
- [j17]Kai-Siou Wu, Yi-Chun Wang, Justie Su-tzu Juan
Mutually independent Hamiltonianicity of Cartesian product graphs. J. Supercomput. 73(2): 837-865 (2017) - 2015
- [j16]Yi-Chun Wang, Justie Su-tzu Juan
Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes. Theor. Comput. Sci. 562: 542-556 (2015) - 2013
- [j15]Yo-Lin Lin, Justie Su-tzu Juan
Finding the edge ranking number through vertex partitions. Discret. Appl. Math. 161(7-8): 1067-1071 (2013) - [j14]Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Shuo-Hong Xu, Justie Su-tzu Juan:
Power Domination in Honeycomb Meshes. J. Inf. Sci. Eng. 29(6): 1249-1263 (2013) - [j13]Tzung-Her Chen
Quality-adaptive visual secret sharing by random grids. J. Syst. Softw. 86(5): 1267-1274 (2013) - [c19]Ming-Jheng Li, Justie Su-tzu Juan
A flexible multiple-secret image sharing scheme by shifting random grids. ISCE 2013: 289-290 - 2012
- [j12]Justie Su-tzu Juan, Daphne Der-Fen Liu:
Antipodal Labelings for Cycles. Ars Comb. 103: 81-96 (2012) - [j11]Tsong-Jie Lin, Sun-Yuan Hsieh, Justie Su-tzu Juan
Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems. IEEE Trans. Parallel Distributed Syst. 23(6): 1081-1089 (2012) - [c18]Yi-Chun Wang, Justie Su-tzu Juan
The Hamiltonicity of WK-Recursive Pyramid. ICA3PP (2) 2012: 90-99 - 2011
- [j10]Kuo-Hua Kao, Jou-Ming Chang
A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs. Algorithmica 61(2): 402-418 (2011) - [j9]Ming-Jheng Li, Justie Su-tzu Juan
Practical electronic auction scheme with strong anonymity and bidding privacy. Inf. Sci. 181(12): 2576-2586 (2011) - 2010
- [j8]Justie Su-tzu Juan
L(j, k)-labelling and maximum ordering-degrees for trees. Discret. Appl. Math. 158(6): 692-698 (2010) - [c17]Tai-Lung Wu, Justie Su-tzu Juan:
Optimal Edge Ranking of Ladder Graphs. FCS 2010: 145-152 - [c16]Sun-Yuan Hsieh, Tsong-Jie Lin, Justie Su-tzu Juan:
Path Embeddings and Related Properties in Cartesian Product Graphs. PDPTA 2010: 508-514
2000 – 2009
- 2009
- [c15]Chia-Wei Lee, Justie Su-tzu Juan
An On-Line Parallel Algorithm for Node Ranking of Trees. ICA3PP 2009: 384-395 - [c14]Ching-Fan Lee, Justie Su-tzu Juan
An Efficient and Secure Multi-secret Image Sharing Scheme with General Access Structure. SSIRI 2009: 253-259 - [c13]Ming-Jheng Li, Ying-Hsuan Chang, Justie Su-tzu Juan
Efficient Multi-secret Sharing Scheme Using Room Square. SSIRI 2009: 260-266 - 2008
- [j7]Justie Su-tzu Juan
On the strong distance problems of pyramid networks. Appl. Math. Comput. 195(1): 154-161 (2008) - [j6]Justie Su-tzu Juan
Adaptive group testing for consecutive positives. Discret. Math. 308(7): 1124-1129 (2008) - [j5]Justie Su-tzu Juan
The strong distance problem on the Cartesian product of graphs. Inf. Process. Lett. 107(2): 45-51 (2008) - [c12]Chen-Hui Lin, Justie Juan:
Computing the Mixture Distance Between Mixture Trees. BIOCOMP 2008: 98-103 - [c11]Ming-Jheng Li, Justie Su-tzu Juan:
Efficient Biometrics Remote User Authentication Scheme. Security and Management 2008: 87-90 - [c10]Jennifer Tsai, Justie Juan:
Secure and Efficient Multi-Secret Sharing Schemes with General Access Structures. FCS 2008: 106-112 - 2007
- [j4]Justie Su-tzu Juan
Group testing in graphs. J. Comb. Optim. 14(2-3): 113-119 (2007) - [c9]Ming-Jheng Li, Justie Su-tzu Juan:
A Practical English Auction Based on the Discrete Logarithms. Security and Management 2007: 413-419 - [c8]Jennifer Hui-Chan Tsai, Justie Su-tzu Juan:
A Simple Multi-Secret Sharing Scheme to Achieve Both Optimal Improvement Ratios. FCS 2007: 17-20 - [c7]Yi-Chun Wang, Justie Su-tzu Juan:
A Perfect Secret Sharing Scheme for (r-1, r)-Uniform Hypergraph-Based Access Structures. FCS 2007: 103-109 - [c6]Yu-fen Weng, Justie Su-tzu Juan, Yi-Chun Wang:
On the Verifiable and Detectable Multi-Use General Perfect Secret Sharing Schemes. FCS 2007: 164-170 - 2006
- [c5]Justie Su-tzu Juan, Yu-Lin Chuang:
A Verifiable and Detectable Secret Sharing Scheme by Using a New Geometric Approach. FCS 2006: 219-225 - [c4]Yi-Chun Wang, Justie Su-tzu Juan
Simple Multi-Secret Sharing Schemes to Achieve the Optimal Maximum Improvement Ratio. SUTC (2) 2006: 58-63 - 2005
- [c3]Chia-Wei Lee, Justie Su-tzu Juan:
On-line Ranking Algorithms for Trees. FCS 2005: 46-51 - [c2]Justie Su-tzu Juan
Efficient Secret Sharing Schemes from Room Square. ICITA (2) 2005: 477-481 - 2004
- [c1]Justie Su-tzu Juan, Chun-Ming Huang:
The Strong Distance Problems. PDPTA 2004: 699-708 - 2001
- [j3]Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu:
No-hole 2-distant colorings for unit interval graphs. Ars Comb. 61 (2001) - [j2]Gerard J. Chang
Minimum Span of No-Hole (r+1)-Distant Colorings. SIAM J. Discret. Math. 14(3): 370-380 (2001)
1990 – 1999
- 1999
- [j1]Shin-Jie Hu, Justie Su-tzu Juan
T-Colorings and T-Edge Spans of Graphs. Graphs Comb. 15(3): 295-301 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: