Maintained by Kouichi SAKURAI
Version 0.17
March 27, 2010

序説

秘密分散法に関する参考文献です

雑誌論文　1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009

会議論文　1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011

雑誌論文

1998

• “On Matroid Characterization of Ideal Secret Sharing Schemes“　(Jovan Dj. Golic; Journal of Cryptology; Volume 11, Number 2 / October, 1998)
• “How to Build Robust Shared Control Systems ” (Ross Anderson, Cunsheng Ding, Tor Helleseth and Torleiv Klove; Designs, Codes and Cryptography;  Volume 15, Number 2 / November, 1998)
• “Robust vector space secret sharing schemes ” (Padro C; INFORMATION PROCESSING LETTERS   Volume: 68   Issue: 3  Pages: 107-111   Published: November 1998)
• “A General Decomposition Construction for Incomplete Secret Sharing Schemes” (Marten van Dijk, Wen-Ai Jackson and Keith M. Martin; Designs, Codes and Cryptography; Volume 15, Number 3 / December, 1998)

1999

• “Detection of Cheaters in Vector Space Secret Sharing Schemes” (Carles Padro, Germán Sáez and Jorge Luis Villar; Designs, Codes and Cryptography; Volume 16, Number 1/ January, 1999)
• “An application of ramp schemes to broadcast encryption ” (Stinson DR, Wei R; INFORMATION PROCESSING LETTERS   Volume: 69   Issue: 3   Pages: 131-135 /February 12 1999)
• “Weighted threshold secret sharing schemes ” (Morillo P, Padro C, Saez G, et al.; INFORMATION PROCESSING LETTERS   Volume: 70   Issue: 5   Pages: 211-216 /June 1999)
• “Image size invariant visual cryptography ” (Ito R, Kuwakado H, Tanaka H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E82A   Issue: 10   Pages: 2172-2177/ October 1999)
• “Probability of shares in secret sharing schemes ” (Blundo C, De Santis A, Gaggia AG; INFORMATION PROCESSING LETTERS   Volume: 72   Issue: 5-6   Pages: 169-175  /December 1999)

2000

• “A share assignment method to maximize the probability of secret sharing reconstruction under the Internet ” (Lee CY, Yeh YS, Chen DJ, et al.; IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   Volume: E83D   Issue: 2   Pages: 190-199/February2000)
• “New Colored Visual Secret Sharing Schemes” (Ching-Nung Yang and Chi-Sung Laih; Designs, Codes and Cryptography; Volume 20, Number 3 / July, 2000)
• “A practical (t, n) multi-secret sharing scheme ” (Chien HY, Jan JK, Tseng YM; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E83A   Issue: 12   Pages: 2762-2765/December 2000)
• “Construction of visual secret sharing schemes with almost optimal contrast ” (Christian Kuhlmann, Hans Ulrich Simon ; Symposium on Discrete Algorithms archive Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms ; Pages: 263 – 272)
• “Computing Functions of a Shared Secret  ” (Amos Beimel, Mike Burmester, Yvo Desmedt, and Eyal Kushilevitz ;SIAM J. Discrete Math. 13 324 (2000)  )
• “(t,m) THRESHOLD AND GENERALIZED ID-BASED CONFERENCE KEY DISTRIBUTION SYSTEM” (Chih-Hung Wang; Tzonelih Hwang ; Cryptologia, 1558-1586, Volume 24, Issue 2, 2000, Pages 148 – 159 )

 2001

• “On the practical secret sharing scheme ” (Ogata W; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E84A   Issue: 1   Pages: 256-261/January 2001)
• “An analytic construction of the visual secret sharing scheme for color images ” (Koga H, Iwamoto M, Yamamoto H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E84A  Issue: 1   Pages: 262-272/January 2001)
• “Secret sharing schemes with cheating detection ” (Horng G; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E84A   Issue: 3   Pages: 845-850 /March 2001)
• “Improvement on the cheater identifiable threshold scheme ” (Kuwakado H, Tanaka H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E84A   Issue: 4   Pages: 957-960/April 2001)
• “On the Composition of Matroids and Ideal Secret Sharing Schemes” (Siaw-Lynn Ng and Michael Walker; Designs, Codes and Cryptography; Volume 24, Number 1/ September, 2001)
• “Secret sharing and visual cryptography schemes ” (Sec ’01: Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge Pages: 123 – 137)

 2002

• “New constructions of the lattice-based visual secret sharing scheme using mixture of colors ” (Ishihara T, Koga H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E85A  Issue: 1   Pages: 158-166/January 2002)
• “Secret Sharing Schemes with Detection of Cheaters for a General Access Structure” (Sergio Cabello, Carles Padró and Germán Sáez; Designs, Codes and Cryptography; Volume 25, Number 2 / February, 2002)
• “A simple approach to secretly sharing a factoring witness in a publicly-verifiable manner ” (Fujisaki E; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E85A   Issue: 5   Pages:1041-1049/May 2002)
• “Polynomial representation of a visual secret sharing scheme and its application” (Kuwakado H, Tanaka H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E85A  Issue: 6   Pages: 1379-1386 /June 2002)
• “Lower bounds on the information rate of secret sharing schemes with homogeneous access structure“(Padro C, Saez G;INFORMATION PROCESSING LETTERS   Volume: 83   Issue: 6   Pages: 345-351/September 2002)
• “The optimal n-out-of-n visual secret sharing scheme for gray-scale images ” (Iwamoto M, Yamamoto H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E85A   Issue: 10   Pages:2238-2247/October 2002)
• “Asynchronous verifiable secret sharing and proactive cryptosystems ” (Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, Reto Strobl ; CCS ’02: Proceedings of the 9th ACM conference on Computer and communications security Pages: 88 – 97 )

2003

• “A visual secret sharing scheme for color images based on meanvalue-color mixing ” (Ishihara T, Koga H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E86A   Issue: 1   Pages:194-197 /January 2003)
• “Providing Anonymity in Unconditionally Secure Secret Sharing Schemes” (Mida Guillermo, Keith M. Martin and Christine M. O’Keefe; Designs, Codes and Cryptography;     Volume 28, Number 3 / April, 2003)
• “A Representation of a Family of Secret Sharing Matroids” (Siaw-Lynn Ng; Designs, Codes and Cryptography; Volume 30, Number 1 / August, 2003)
• “A tempo-based t-out-of-n audio cryptography scheme ” (Chiou SY, Laih CS; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E86A   Issue: 8   Pages: 2091-2098/August 2003)
• “A construction method of visual secret sharing schemes for plural secret images ” (Iwamoto M, Yamamoto H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E86A  Issue: 10   Pages: 2577-2588/ October 2003)
• “Contrast Optimal Threshold Visual Cryptography Schemes  ” (C. Blundo, P. D’Arco, A. De Santis, and D. R. Stinson ; SIAM J. Discrete Math. 16 224 (2003) )
• “On identification secret sharing schemes” (Cai, N., Lam, K.Y. Information and Computation Volume 184, Issue 2, 1 August 2003, Pages 298-310 )
• “Sharing one secret vs. sharing many secrets” (Di Crescenzo, G. Theoretical Computer Science Volume 295, Issue 1-3, 24 February 2003, Pages 123-140 )

2004

• “A new visual cryptographic scheme using latin squares ” (Adhikari A, Bose M; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E87A   Issue: 5   Pages: 1198-1202 /May 2004 )
• “Efficient secret sharing schemes realizing general access structures ” (Tochikubo K; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E87A   Issue: 7   Pages: 1788-1797/July 2004)
• “A Linear Algebraic Approach to Metering Schemes ” (Carlo Blundo, Sebastià Martín, Barbara Masucci and CarlEs Padró; Designs, Codes and Cryptography; Volume 33, Number 3 / November, 2004)
• “Rational secret sharing and multiparty computation: extended abstract ” (Joseph Halpern, Vanessa Teague; STOC ’04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing Pages: 623 – 632)
• “On cheating immune secret sharing” (Pieprzyk, J., Zhang, X.-M.; Discrete Mathematics and Theoretical Computer Science Volume 6, Issue 2, 2004, Pages 253-264 )
• “Geometrical contributions to secret sharing theory” (Jackson, W.-A., Martin, K.M., O’Keefe, C.M. Journal of Geometry Volume 79, Issue 1-2, 2004, Pages 102-133 )
• “Linear secret sharing schemes and rearrangements of access structures” (Xiao, L.-L., Liu, M.-L. Acta Mathematicae Applicatae Sinica Volume 20, Issue 4, 2004, Pages 685-694 )
• “Characterisations of ideal threshold schemes ” (Pieprzyk, J., Zhang, X.-M. Discrete Mathematics and Theoretical Computer Science Volume 6, Issue 2, 2004, Pages 471-482 )
• “Secret image sharing with steganography and authentication” (Lin, C.-C., Tsai, W.-H. Journal of Systems and Software Volume 73, Issue 3, November 2004, Pages 405-414 )
• “Secret sharing scheme of secure vector space based on quadratic residue ” (Xiao, Q.-H., Ping, L.-D., Pan, X.-Z. Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science) Volume 38, Issue 11, November 2004, Pages 1408-1411+1421 )
• “Secret sharing schemes on sparse homogeneous access structures with rank three” (Martí-Farré, J., Padró, C. Electronic Journal of Combinatorics Volume 11, Issue 1 R, 7 October 2004, Pages 1-16 )
• “Threshold multiple secret sharing scheme” ( Xu, C.-X., Xiao, G.-Z. Tien Tzu Hsueh Pao/Acta Electronica Sinica Volume 32, Issue 10, October 2004, Pages 1688-1689+1687 )
• “Information-theoretical secure verifiable secret sharing on vector space access structures ” (Zhang, F.-T., Shi, J., Wang, Y.-M. Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology Volume 26, Issue 8, August 2004, Pages 1288-1293 )
• “Cheat-proof multi-secret sharing scheme based on factorization” ( Gan, Y.-J., Cao, G. Tiedao Xuebao/Journal of the China Railway Society Volume 26, Issue 4, August 2004, Page 79 )
• “A new visual cryptographic scheme using latin squares” (Adhikari, A., Bose, M. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume E87-A, Issue 5, May 2004, Pages 1198-1202 )
• “Colour image secret sharing” (Lukac, R., Plataniotis, K.N. Electronics Letters Volume 40, Issue 9, 29 April 2004, Pages 529-531 )
• “Randomness in secret sharing and visual cryptography schemes” (De Bonis, A., De Santis, A. Theoretical Computer Science Volume 314, Issue 3, 10 April 2004, Pages 351-374 )
• “A (t,n) multi-secret sharing scheme” (Yang, C.-C., Chang, T.-Y., Hwang, M.-S. Applied Mathematics and Computation Volume 151, Issue 2, 5 April 2004, Pages 483-490 )
• “New combinatorial designs and their applications to authentication codes and secret sharing schemes” ( Ogata, W., Kurosawa, K., Stinson, D.R., Saido, H. Discrete Mathematics Volume 279, Issue 1-3, 28 March 2004, Pages 383-405 )
• “Cheater detectable visual cryptography scheme” (Yan, H., Gan, Z., Chen, K.-F. Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University Volume 38, Issue 1, January 2004, Pages 107-110 )

2005

• “Secret Sharing Schemes with Three or Four Minimal Qualified Subsets” (Jaume Martí-Farré and Carles Padró; Designs, Codes and Cryptography; Volume 34, Number 1             / January, 2005)
• “Efficient secret sharing schemes based on authorized subsets ” (Tochikubo K, Uyematsu T, Matsumoto R; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E88A  Issue: 1   Pages: 322-326/January 2005)
• “Ideal contrast visual cryptography schemes with reversing ” (Cimato S, De Santis A, Ferrara AL, et al.; INFORMATION PROCESSING LETTERS   Volume: 93   Issue: 4   Pages: 199-206/ February 2005 )
• “Automatic repair mechanism of secret sharing storage system ” (Hayashi D, Miyamoto T, Kumagai S; IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   Volume: E88D   Issue: 5   Pages: 971-975/ MAY 2005 )
• “Size-adjustable visual secret sharing schemes ” (Yang CN, Chen TS; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E88A   Issue: 9   Pages: 2471-2474 /September 2005)
• “XOR-based Visual Cryptography Schemes ” (P. Tuyls, H. D. L. Hollmann, J. H. Van Lint and L. Tolhuizen; Designs, Codes and Cryptography; Volume 37, Number 1 / October, 2005)
• “A new multi-stage secret sharing scheme using one-way function ” (Ting-Yi Chang, Min-Shiang Hwang, Wei-Pang Yang ; SIGOPS Operating Systems Review , Volume 39 Issue 1 Pages: 48 – 55 )
• “An approach to enhance inter-provider roaming through secret sharing and its application to WLANs ” (Ulrike Meyer, Jared Cordasco, Susanne Wetzel; WMASH ’05: Proceedings of the 3rd ACM international workshop on Wireless mobile applications and services on WLAN hotspots, Pages: 1 – 13   )

 2006

• “Strongly secure ramp secret sharing schemes for general access structures “(Iwamoto M, Yamamoto H; INFORMATION PROCESSING LETTERS   Volume: 97   Issue: 2   Pages: 52-57 /January 2006 )
• “Cheating in Visual Cryptography” (Gwoboa Horng, Tzungher Chen and Du-shiau Tsai; Designs, Codes and Cryptography; Volume 38, Number 2 / February, 2006)
• “New size-reduced visual secret sharing schemes with half reduction of shadow size ” (Yang CN, Chen TS; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E89A  Issue: 2   Pages: 620-625/February 2006 )
• “Sharing Multiple Secrets: Models, Schemes and Analysis” (Barbara Masucci; Designs, Codes and Cryptography; Volume 39, Number 1 / April, 2006)
• “Visual secret sharing schemes for multiple secret images allowing the rotation of shares ” (Iwamoto M, Wang L, Yoneyama K, et al.;IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume:E89A   Issue: 5   Pages: 1382-1395/May 2006 )
• “Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels” (Hiroki Koga and Etsuyo Ueda; Designs, Codes and Cryptography; Volume 40, Number 1 / July, 2006)
• “A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes” (Mike J. Grannell, Terry S. Griggs and Anne Penfold Street; Designs, Codes and Cryptography; Volume 40, Number 2 / August, 2006)
• “Improved constructions of secret sharing schemes by applying (lambda, omega)-decompositions ” (van Dijk M, Kevenaar T, Schrijen GJ, et al.; INFORMATION PROCESSING LETTERS   Volume: 99   Issue: 4   Pages: 154-157/ August 2006 )
• “Generalised Cumulative Arrays in Secret Sharing” (Shoulun Long, Josef Pieprzyk, Huaxiong Wang and Duncan S. Wong; Designs, Codes and Cryptography; Volume 40, Number 2 / August, 2006)
• “Secret sharing schemes with partial broadcast channels” (Rei Safavi-Naini and Huaxiong Wang; Designs, Codes and Cryptography; Volume 41, Number 1 / October, 2006)
• “Vertical partitioning method for secret sharing distributed database system ” (Miyamoto T, Morita Y, Kumagai S; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E89A  Issue: 11   Pages: 3244-3249 /November 2006)
• “Improved efficiency for revocation schemes via Newton interpolation” (Kogan, N., Tassa, T ;ACM Transactions on Information and System Security Volume 9, Issue 4, 2006, Pages 461-486″
• “Secret sharing scheme with inherited characteristic “( Ye, Z., Meng, F ; Journal of Systems Engineering and Electronics Volume 17, Issue 4, December 2006, Pages 916-918)
• “Chinese remainder theorem-based secret sharing scheme” ( Xi, G.-B., Chen, H.-F., Zhao, W.-D.; Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, Volume 28, Issue 12, December 2006, Pages 2378-2381 )
• “Optimum secret sharing scheme secure against cheating ” ( Ogata, W., Kurosawa, K., Stinson, D.R. ;SIAM Journal on Discrete Mathematics Volume 20, Issue 1, 2006, Pages 79-95 )
• “Linear multi-secret sharing schemes based on multi-party computation” (Liu, M., Xiao, L. , Zhang, Z; Finite Fields and their Applications Volume 12, Issue 4, November 2006, Pages 704-713)
• “Lattice-based threshold-changeability for standard CRT secret-sharing schemes” ( Steinfeld, R., Pieprzyk, J., Wang, H. Finite Fields and their Applications
  Volume 12, Issue 4, November 2006, Pages 653-680)
• “Dynamic threshold secret sharing scheme” ( Huang, D., Wang, H., Huang, L., Dai, Y. ;Qinghua Daxue Xuebao/Journal of Tsinghua University Volume 46, Issue 1, January 2006, Pages 102-105)
• “Secret sharing schemes from three classes of linear codes” (Yuan, J., Ding, C. ;IEEE Transactions on Information Theory Volume 52, Issue 1, January 2006, Pages 206-212)
• “Security Analysis of Authentication of Images Using Recursive Visual Cryptography” (Ching-Nung Yang; Tse-Shih Chen ; Cryptologia, 1558-1586, Volume 32, Issue 2, 2008, Pages 131 – 136 )

2007

• “Optimal multiple assignments based on integer programming in secret sharing schemes with general access structures ” (Iwamoto M, Yamamoto H, Ogawa H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E90A   Issue: 1   Pages: 101-112/January 2007)
• “Hierarchical Threshold Secret Sharing” (Tamir Tassa; Journal of Cryptology; Volume 20, Number 2 / April, 2007)
• “Applications of partially balanced incomplete block designs in developing (2, n) visual cryptographic schemes” (Adhikari A, Bose M, Kumar D, et al.; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E90A   Issue: 5   Pages: 949-951/ May, 2007)
• “A note on secret sharing schemes with three homogeneous access structure ” (Marti-Farre J; INFORMATION PROCESSING LETTERS; Volume: 102 Issue: 4, Pages: 133-137   /MAY 2007)
• “Robust computational secret sharing and a unified account of classical secret-sharing goals ” (Phillip Rogaway, Mihir Bellare ; CCS ’07: Proceedings of the 14th ACM conference on Computer and communications security ,Pages: 172 – 184 )
• “Verifiable multi-secret sharing schemes applicable to arbitrary access structures ” (Zhang, F.-T., Wang, Y.-M.; Tongxin Xuebao/Journal on Communication 28 (11), pp. 58-64)
• “Secret sharing schemes on graphs” (László Csirmaz; Studia Scientiarum Mathematicarum Hungarica, Volume 44, Number 3/September 2007, Pages297-306 )
• “Threshold cryptography based on Asmuth-Bloom secret sharing” (Kamer Kaya, Ali Aydın Selçuk; Information Sciences Volume 177, Issue 19, 1 October 2007, Pages 4148-4160  )
• “New results on non-perfect sharing of multiple secrets” (Alfredo De Santis and Barbara Masucci; Journal of Systems and Software Volume 80, Issue 2, February 2007, Pages 216-223)
• “Dynamic and Verifiable Secret Sharing Among Weighted Participants” (Yanshuo Zhang and Zhuojun Liu; Journal of Systems Science and Complexity, Volume 20, Number 4 /December, 2007, pg- 481-485)

2008

• “A fast (3, n)-threshold secret sharing scheme using Exclusive-OR operations ” (IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 1   Pages: 127-138/January 2008)
• “On increasing the number of users in (t, n) threshold secret sharing schemes ” (Alexandrova T, Morita H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 8   Pages:2138-2150/August 2008)
• “On a fast (k,n)-threshold secret sharing scheme ” (Kurihara J, Kiyomoto S, Fukushima K, et al.; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 9   Pages: 2365-2378/September 2008)
• “Efficient Secret Sharing Schemes Based on Unauthorized Subsets ” (Tochikubo K; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 10   Pages:2860-2867 /October 2008 )
• “Strongly Secure Linear Network Coding “(Harada K, Yamamoto H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 10   Pages: 2720-2728/October 2008)
• “Characterizing Ideal Weighted Threshold Secret Sharing  ” (Amos Beimel, Tamir Tassa, and Enav Weinreb ; SIAM J. Discrete Math. 22 360 (2008) )
• “Mobile proactive secret sharing ” (David A. Schultz, Barbara Liskov, Moses Liskov ; PODC ’08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing Pages 458-458)

 2009

• “Multipartite Secret Sharing by Bivariate Interpolation” (Tamir Tassa and Nira Dyn; Journal of Cryptology; Volume 22, Number 2 / April, 2009)
• “Detection and identification of cheaters in (t, n) secret sharing scheme” (Lein Harn and Changlu Lin; Designs, Codes and Cryptography; Volume 52, Number 1 / July, 2009)
• “Ideal secret sharing schemes whose minimal qualified subsets have at most three participants” (Jaume Martí-Farré and Carles Padró; Designs, Codes and Cryptography; Volume 52, Number 1 / July, 2009)
• “On proper secrets, ( t , k )-bases and linear codes” (Tamir Tassa and Jorge L. Villar; Designs, Codes and Cryptography; Volume 52, Number 2 / August, 2009)
• “An impossibility result on graph secret sharing” (László Csirmaz; Designs, Codes and Cryptography; )
• “A secret sharing scheme based on (t, n) threshold and adversary structure” (Huawang Qin, Yuewei Dai and Zhiquan Wang; International Journal of Information Security; )
• “A (t, n)-fair dynamic threshold secret sharing scheme “, Lin, T.-Y., Wu, T.-C., Lee, C.-I., Wu, T.-S.International ; Journal of Innovative Computing, Information and Control 5 (5), pp. 1395-1406.
• “Hypergraph decomposition and secret sharing” Di Crescenzo, G., Galdi, C; Discrete Applied Mathematics 157 (5), pp. 928-946
• “Weighted threshold secret image sharing” Shyu, S.J., Chuang, C.-C., Chen, Y.-R., Lai, A.-F; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5414 LNCS, pp. 988-998

会議論文

1999

• “A Conference Key Multicasting Scheme Using Knapsack and Secret Sharing” (Shiuh-Jeng Wang and Jin-Fu Chang; Database and Expert Systems Applications: DEXA’99; Springer LNCS, Volume 1677/1999, 813 )
• “A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting” (Berry Schoenmakers; Advances in Cryptology — CRYPTO’ 99; Springer LNCS, Volume 1666/1999, 784 )
• “Changing Thresholds in the Absence of Secure Channels” (Keith M. Martin, Josef Pieprzyk, Rei Safavi-Naini and Huaxiong Wang; Information Security and Privacy:ACISP’99; Springer LNCS, Volume 1587/1999, 177-191)
• “Conference Key Agreement from Secret Sharing” (Chih-Hung Li and Josef Pieprzyk ;Information Security and Privacy:ACISP’99; Springer LNCS, Volume 1587/1999, 64-76)
• “Efficient Multiparty Computations Secure Against an Adaptive Adversary” (Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt and Tal Rabin ;Advances in Cryptology — EUROCRYPT ’99 ;Springer LNCS, Volume 1592/1999,311-326)
• “Formal Verification of Secret Sharing Protocol Using Coq” (Kok Meng Yew, M. Zahidur Rahman and Sai Peck Lee ;Advances in Computing Science — ASIAN’99 ;Springer LNCS, Volume 1742/1999, 790)
• “Secret sharing schemes with detection of cheaters for a general access structure” (Sergio Cabello, Carles Padró and Germán Sáez ;Fundamentals of Computation Theory:FCT’99; Springer LNCS, Volume 1684/1999, 828)
• “Introduction to Secure Computation” (Ronald Cramer ;Lectures on Data Security: Modern Cryptology in Theory and Practice; Springer LNCS, Volume 1561/1999; 16-62)
• “A New Approach to Efficient Verifiable Secret Sharing for Threshold KCDSA Signature” (Ho-Sun Yoon and Heung-Youl Youm ;Information Security and Cryptology – ICISC’99; Springer LNCS, Volume 1787/2000, 208-220)
• “Verifiable Secret Sharing and Time Capsules” (Josef Pieprzyk and Eiji Okamoto ;Information Security and Cryptology – ICISC’99 ;Springer LNCS, Volume 1787/2000,169-183)
• “Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery” (Fabrice Boudot and Jacques Traoré ;Information and Communication Security -ICICS’99,Springer LNCS,  Volume 1726/2004, 87-102)
• “Linear Secret Sharing with Divisible Shares” (Josef Pieprzyk ;Information and Communication Security -ICICS’99, Springer LNCS, Volume 1726/2004, 71-86)

2000

• “Cheating Prevention in Secret Sharing” (Hossein Ghodosi and Josef Pieprzyk ; Information Security and Privacy :ACISP 2000; Springer LNCS, Volume 1841/2000, 328-341)
• “Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography” (Matthias Krause and Hans Ulrich Simon ;LATIN 2000: Theoretical Informatics: 4th Latin American Symposium Proceedings ,Springer LNCS, Volume 1776/2000,280-291)
• “General Secure Multi-party Computation from any Linear Secret-Sharing Scheme” (Ronald Cramer, Ivan Damgård and Ueli Maurer ;Advances in Cryptology — EUROCRYPT 2000 ;Springer LNCS, Volume 1807/2000,316-334)
• “On Multiplicative Secret Sharing Schemes” (Huaxiong Wang, Kwok Yan Lam, Guo-Zhen Xiao and Huanhui Zhao ; Information Security and Privacy :ACISP 2000;Springer LNCS, Volume 1841/2000,342-351)
• “Light Weight Broadcast Exclusion Using Secret Sharing” (Natsume Matsuzaki, Jun Anzai and Tsutomu Matsumoto ;Information Security and Privacy :ACISP 2000; Springer LNCS ,Volume 1841/2000,313-327)
• “Provably Secure Metering Scheme” (Wakaha Ogata and Kaoru Kurosawa ;Advances in Cryptology — ASIACRYPT 2000 ;Springer LNCS, Volume 1976/2000, 388-398)
• “Sharing Block Ciphers” (Ernie Brickell, Giovanni Di Crescenzo and Yair Frankel ;Information Security and Privacy :ACISP 2000; Springer LNCS, Volume 1841/2000,457-470)
• “Mix and Match: Secure Function Evaluation via Ciphertexts” (Markus Jakobsson and Ari Juels ;Advances in Cryptology —ASIACRYPT 2000 ;Springer LNCS, Volume 1976/2000, 162-177)
• “Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures” (Douglas R. Stinson and R. Wei ;Selected Areas in Cryptography :SAC’99;Springer LNCS, Volume 1758/2000, 200-214)
• “Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation” (K. Srinathan and C. Pandu Rangan ;Progress in Cryptology —INDOCRYPT 2000 ;Springer LNCS, Volume 1977/2000,181-215)
• “Certificates of Recoverability with Scalable Recovery Agent Security” (Eric R. Verheul ;Public Key Cryptography-PKC 2000, Springer LNCS, Volume 1751/2004, 258-275)
• “On Symmetrically Private Information Retrieval ” (Sanjeev Kumar Mishra ; Cryptology ePrint 2000/041)
• “On the Complexity of Verifiable Secret Sharing and Multi-Party Computation ” (Ronald Cramer and Ivan Damg{\aa}rd and Stefan Dziembowski ;Cryptology ePrint 2000/038)
• “General Secure Multi-Party Computation from any Linear Secret Sharing Scheme ” (Ronald Cramer and Ivan Damg{\aa}rd and Ueli Maurer ; Cryptology ePrint 2000/037 )

 2001

• “A Generalized Secret Image Sharing and Recovery Scheme” (Chwei-Shyong Tsai and Chin-Chen Chang ;Advances in Multimedia Information Processing — PCM 2001 ;Springer LNCS, Volume 2195/2001,963-968)
• “A PVSS as Hard as Discrete Log and Shareholder Separability” (Adam Young and Moti Yung ;Public Key Cryptography :PKC 2001;Springer LNCS, Volume 1992/2001,287-299)
• “Cheating Immune Secret Sharing” (Xian-Mo Zhang and Josef Pieprzyk ;Information and Communications Security :ICICS 2001 ;Springer LNCS, Volume 2229/2001, 144-149)
• “Cheating Prevention in Secret Sharing over GF ( p ^t)” (Josef Pieprzyk and Zhang Xian-Mo ;Progress in Cryptology —INDOCRYPT 2001 ;Springer LNCS, Volume 2247/2001,79-90)
• “On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase” (Ronald Cramer, Ivan Damgård and Serge Fehr ; Advances in Cryptology — CRYPTO 2001 ;Springer LNCS, Volume 2139/2001,503-523)
• “Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio” (Giovanni Di Crescenzo ;Mathematical Foundations of Computer Science 2001 :MFCS 2001 ;Springer LNCS,  Volume 2136/2001,292-304)
• “Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group” (Brian King ;Information Security and Privacy :ACISP 2001 ;Springer LNCS, Volume 2119/2001,376-391)
• “Robust Forward-Secure Signature Schemes with Proactive Security” (Wen-Guey Tzeng and Zhi-Jia Tzeng ;Public Key Cryptography :PKC 2001 ;Springer LNCS, Volume 1992/2001,264-276 )
• “Forward-Secure Threshold Signature Schemes” (Michel Abdalla, Sara Miner and Chanathip Namprempre ;Topics in Cryptology— CT-RSA 2001 ;Springer LNCS, Volume 2020/2001,441-456)
• “Generalized Zig-zag Functions and Oblivious Transfer Reductions” (Paolo D’Arco and Douglas Stinson ;Selected Areas in Cryptography: SAC 2001 ; Springer LNCS, Volume 2259/2001, 87-102)
• “A Linear Algebraic Approach to Metering Schemes ” (C. Blundo and S. Martìn and B. Masucci and C. Padrò Cryptology ePrint 2001/087 )
• “On the Power of Nonlinear Secret-Sharing ” (Amos Beimel and Yuval Ishai ;Cryptology ePrint 2001/030)
• “On perfect secret sharing schemes and coalitional game forms ” (Stefano Vannucci ; Theoretical Aspects Of Rationality And Knowledge archive Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge; Pages: 183 – 192)

 2002

• “A General Formula of the ( t, n )-Threshold Visual Secret Sharing Scheme “　(Hiroki Koga ;Advances in Cryptology —ASIACRYPT 2002 ;Springer LNCS, Volume 2501/2002, 847-855)
• “A Distributed and Computationally Secure Key Distribution Scheme” (Vanesa Daza, Javier Herranz, Carles Padró and Germán S’aez ; Information Security :ISC 2002 ;Springer LNCS, Volume 2433/2002,342-356)
• “Cheating Prevention in Linear Secret Sharing” (Josef Pieprzyk and Xian-Mo Zhang ;Information Security and Privacy :ACISP 2002; Springer LNCS, Volume 2384/2002,148-156)
• “Constructions of Cheating Immune Secret Sharing” (Josef Pieprzyk and Zhang Xian-Mo ;Information Security and Cryptology —ICISC 2001 ;Springer LNCS, Volume 2288/2002, 159-204)
• “Efficient 1-Out-n Oblivious Transfer Schemes” (Wen-Guey Tzeng ;Public Key Cryptography :PKC 2002, Springer LNCS, Volume 2274/2002,359-362 )
• “Ideal Threshold Schemes from Orthogonal Arrays” (Josef Pieprzyk and Xiam-Mo Zhang ;Information and Communications Security :ICICS 2002 ;Springer LNCS,  Volume 2513/2002, 469-479)
• “Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks” (Fehr Serge and Maurer Ueli ;Advances in Cryptology — CRYPTO 2002 ,Springer LNCS, Volume 2442/2002, 201-219)
• “Non-perfect Secret Sharing over General Access Structures” (K. Srinathan, N. Tharani Rajan and C. Pandu Rangan ;Progress in Cryptology — INDOCRYPT 2002 ;Springer LNCS, Volume 2551/2002, 409-421)
• “Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments” (Masayuki Abe, Ronald Cramer and Serge Fehr ;Advances in Cryptology — ASIACRYPT 2002 ;Springer LNCS,  Volume 2501/2002, 206-224 )
• “On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure” (Ventzislav Nikov, Svetla Nikova, Bart Preneel and Joos Vandewalle ;Progress in Cryptology —INDOCRYPT 2002 ;Springer LNCS, Volume 2551/2002, 422-435)
• “On Unconditionally Secure Robust Distributed Key Distribution Centers” (Paolo D’Arco and Douglas R. Stinson ;Advances in Cryptology — ASIACRYPT 2002 ;Springer LNCS,  Volume 2501/2002, 181-189)
• “Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups” (Ronald Cramer and Serge Fehr ;Advances in Cryptology —CRYPTO 2002 ;Springer LNCS, Volume 2442/2002, 272-287)
• “Requirements for Group Independent Linear Threshold Secret Sharing Schemes” (Brian King ; Information Security and Privacy-ACISP 2002; Springer LNCS, Volume 2384/2002, 143-186  )
• “Trading Players for Efficiency in Unconditional Multiparty Computation” (B. Prabhu, K. Srinathan and C. Pandu Rangan ;Security in Communication Networks -SCN 2002 ; Springer LNCS, Volume 2576/2003, 342-353)
• “An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes ” (H.D.L. Hollmann, J.H.v. Lint, L. Tolhuizen, P. Tuyls ;Cryptology ePrint  2002/195 )
• “A polarisation based Visual Crypto System and its Secret Sharing Schemes ” (P. Tuyls, H.D.L. Hollmann, J.H.v. Lint, L. Tolhuizen ; Cryptology ePrint  2002/194 )
• “A Note on Ideal Tripartite Access Structures ” (Michael J. Collins ; 2002/193)
• “Applying General Access Structure to Proactive Secret Sharing Schemes ” (Ventzislav Nikov and Svetla Nikova and Bart Preneel and Joos Vandewalle ; Cryptology ePrint  2002/141)
• “Secret sharing schemes on access structures with intersection number equal to one ” (Jaume Marti-Farre and Carles Padro ;Cryptology ePrint  2002/106)
• “Applying General Access Structure to Metering Schemes ” (Ventzislav Nikov and Svetla Nikova and Bart Preneel and Joos Vandewalle ; Cryptology ePrint   2002/102 )
• “A Distributed and Computationally Secure Key Distribution Scheme ” (Vanesa Daza and Javier Herranz and Carles Padr ‘o and Germ\’an S ‘aez ;Cryptology ePrint  2002/069  )
• “Fully Distributed Proxy Signature Schemes “(Javier Herranz and Germ ‘an S ‘aez ; Cryptology ePrint  2002/051 )
• “Secret sharing schemes with three or four minimal qualified subsets ” (Jaume Martí-Farré and Carles Padró ; Cryptology ePrint  2002/050)
• “Partial Key Escrow Monitoring Scheme ” (Jiang Shaoquan and Zhang Yufeng ; 2002/039)
• “A Distributed RSA Signature Scheme for General Access Structures ” (Javier Herranz and Carles Padr\’o and Germ\’an S\’aez ; Cryptology ePrint  2002/038 )
• “Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups ” (Ronald Cramer and Serge Fehr ; Cryptology ePrint  2002/036 )

 2003

• “A Comment on Group Independent Threshold Sharing” (Brian King ; Information Security Applications ;Springer LNCS, Volume 2908/2003, 347-358)
• “A Secret Sharing Scheme Using Matrices” (Candelaria Hernández-Goya, Pino Caballero-Gil and Carlos Bruno-Castañeda ;Computational Science and Its Applications — ICCSA 2003 ;Springer LNCS, Volume 2669/2003, 986)
• “A Method for Sending Confidential Messages to a Group without Trusted Parties” (Ren-Junn Hwang and Chin-Chen Chang ;Parallel and Distributed Processing and Applications -ISPA 2003 ;Springer LNCS, Volume 2745/2003, 207-221)
• “A Signcryption Scheme Based on Secret Sharing Technique” (Mohamed Al-Ibrahim ;Computer Network Security -MMM-ACNS 2003; Springer LNCS, Volume 2776/2003, 279-288 )
• “Constructing General Dynamic Group Key Distribution Schemes with Decentralized User Join” (Vanesa Daza, Javier Herranz and Germán Sáez ;Information Security and Privacy -ACISP 2003 ;Springer LNCS, Volume 2727/2003, 217)
• “Computation of Cryptographic Keys from Face Biometrics” (Alwyn Goh and David C.L. Ngo ;Communications and Multimedia Security; Springer LNCS, Volume 2828/2003 ,1-13)
• “Covering and Secret Sharing with Linear Codes” (Cunsheng Ding and Jin Yuan ;Discrete Mathematics and Theoretical Computer Science -DMTCS 2003 ;Springer LNCS, Volume 2731/2003, 11-25)
• “Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes” (Yvo Desmedt, Kaoru Kurosawa and Tri Van Le ; Information Security -ISC 2003;Springer LNCS, Volume 2851/2003 ,396-407)
• “Hypergraph Decomposition and Secret Sharing” (Giovanni Di Crescenzo and Clemente Galdi ; Algorithms and Computation ;Springer LNCS, Volume 2906/2003, 645-654)
• “ID-Based Distributed “Magic Ink” Signature from Pairings” (Yan Xie, Fangguo Zhang, Xiaofeng Chen and Kwangjo Kim ;Information and Communications Security ;Springer LNCS, Volume 2836/2003, 249-259)
• “Ideal Threshold Schemes from MDS Codes” (Josef Pieprzyk and Xian-Mo Zhang ; Information Security and Cryptology — ICISC 2002 ;Springer LNCS, Volume 2587/2003, 253-263)
• “Multi-party Computation from Any Linear Secret Sharing Scheme Unconditionally Secure against Adaptive Adversary: The Zero-Error Case” (Ventzislav Nikov, Svetla Nikova and Bart Preneel ; Applied Cryptography and Network Security ;Springer LNCS, Volume 2846/2003, 1-15)
• “On Multiplicative Linear Secret Sharing Schemes” (Ventzislav Nikov, Svetla Nikova and Bart Preneel ; Progress in Cryptology – INDOCRYPT 2003 ;Springer LNCS,  Volume 2904/2003, 88-92)
• “On the Power of Computational Secret Sharing” (V. Vinod, Arvind Narayanan, K. Srinathan, C. Pandu Rangan and Kwangjo Kim ; Progress in Cryptology – INDOCRYPT 2003 ;Springer LNCS,  Volume 2904/2003, 265-293)
• “Redistribution of Mechanical Secret Shares” (Yvo Desmedt, Rei Safavi-Naini and Huaxiong Wang ; Financial Cryptography -FC 2002 ;Springer LNCS,  Volume 2357/2003, 238-252)
• “PLI: A New Framework to Protect Digital Content for P2P Networks” (Guofei Gu, Bin B. Zhu, Shipeng Li and Shiyong Zhang ;Applied Cryptography and Network Security ;Springer LNCS,  Volume 2846/2003, 206-216)
• “Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem” (Rui Zhang and Hideki Imai ;Applied Cryptography and Network Security ;Springer LNCS, Volume 2846/2003, 96-110)
• “Secret Sharing Schemes on Access Structures with Intersection Number Equal to One” (Jaume Martí-Farré and Carles Padró ; Security in Communication Networks -SCN 2002 ;Springer LNCS, Volume 2576/2003 ,354-363)
• “Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing” (Koutarou Suzuki and Makoto Yokoo ;Financial Cryptography -FC 2002 ;Springer LNCS, Volume 2357/2003, 44-56)
• “Threshold MACs” (Keith M. Martin, Josef Pieprzyk, Rei Safavi-Naini, Huaxiong Wang and Peter R. Wild ;Information Security and Cryptology — ICISC 2002 ;Springer LNCS,  Volume 2587/2003, 237-252)
• “Verifiable Secret Sharing for General Access Structures, with Application to Fully Distributed Proxy Signatures” (Javier Herranz and Germán Sáez ;Financial Cryptography ;Springer LNCS, Volume 2742, 286-302)
• “Group Oriented Cryptosystems Based on Linear Access Structures” (Wen Ping Ma and Moon Ho Lee ;Information Security and Cryptology -ICISC 2003 ;Springer LNCS, Volume 2971/2004, 370-376)
• “Public Watermark Detection Using Multiple Proxies and Secret Sharing” (Qiming Li and Ee-Chien Chang ;Digital Watermarking -IWDW 2003; Springer LNCS, Volume 2939/2004, 343-346 )
• “Secure Sessions from Weak Secrets” (Bruce Christianson, Michael Roe and David Wheeler ; Security Protocols -11th International Workshop; Springer LNCS, Volume 3364/2005, 190-205)
• “A Verifiable Secret Sharing Scheme with Statistical zero-knowledge ” (Chunming Tang and Zhuojun Liu and Mingsheng Wang ; Cryptology ePrint  2003/222)
• “On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes ” (Ventzislav Nikov and Svetla Nikova ;Cryptology ePrint  2003/210 )
• “Secret sharing schemes on sparse homogeneous access structures with rank three ” (Jaume Martí-Farré and Carles Padró ; Cryptology ePrint  2003/151 )
• “Secure Multiplication of Shared Secrets in the Exponent ” (Mario Di Raimondo and Rosario Gennaro ;Cryptology ePrint   2003/057 )
• “Compounding Secret Sharing Schemes ” (E. Martinez-Moro, J. Mozo-Fernandez, C. Munuera ;Cryptology ePrint   2003/048 )
• “On alternative approach for verifiable secret sharing ” (Kamil Kulesza and Zbigniew Kotulski and Josef Pieprzyk ; Cryptology ePrint  2003/035)
• “Multi-Party Computation from any Linear Secret Sharing Scheme Secure against Adaptive Adversary: The Zero-Error Case ” (Ventzislav Nikov, Svetla Nikova, Bart Preneel ; Cryptology ePrint  2003/006)
• “On fail-stop verifiable secret sharing schemes” (Susilo, W., Mu, Y. Proceedings of the International Conference on Security and Management Volume 2, 2003, Pages 663-667 )
• “Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions ” (Van Dijk, M., Kevenaar, T, Schrijen, G.-J., Tuyls, P. IEEE International Symposium on Information Theory – Proceedings 2003, Page 282 )

 2004

• “A { k, n}-Secret Sharing Scheme for Color Images” (Rastislav Lukac, Konstantinos N. Plataniotis and Anastasios N. Venetsanopoulos ; Computational Science – ICCS 2004 ;Springer LNCS, Volume 3039/2004, 72-79)
• “A Pair-Wise Key Agreement Scheme in Ad Hoc Networks” (Woosuck Cha, Gicheol Wang and Gihwan Cho ;Computational Science – ICCS 2004 ; Springer LNCS, Volume 3036/2004, 648-651)
• “A Quick Group Key Distribution Scheme with “Entity Revocation” (Jun Anzai, Natsume Matsuzaki and Tsutomu Matsumoto ;Advances in Cryptology – ASIACRYPT’99 ;Springer LNCS, Volume 1716/2004, 333-347)
• “A New Chameleon Multi-signature Based on Bilinear Pairing” (Chunbo Ma and Dake He ;Grid and Cooperative Computing – GCC 2004Workshops ;Springer LNCS, Volume 3252/2004, 329-334)
• “Broadcast Enforced Threshold Schemes with Disenrollment” (Mingyan Li and Radha Poovendran ;Selected Areas in Cryptography ;Springer LNCS, Volume 3006/2004, 101-116)
• “Asynchronous Proactive Cryptosystems Without Agreement” (Bartosz Przydatek and Reto Strobl ; Advances in Cryptology – ASIACRYPT 2004 ;Springer LNCS, Volume 3329/2004, 152-169)
• “Constant Round Authenticated Group Key Agreement via Distributed Computation” (Emmanuel Bresson and Dario Catalano ;Public Key Cryptography – PKC 2004 ;Springer LNCS, Volume 2947/2004, 115-129)
• “Hierarchical Threshold Secret Sharing” (Tamir Tassa ;Theory of Cryptography-TCC 2004 ;Springer LNCS, Volume 2951/2004, 473-490 )
• “Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes” (Ron Steinfeld, Huaxiong Wang and Josef Pieprzyk ;Advances in Cryptology – ASIACRYPT 2004 ;Springer LNCS, Volume 3329/2004, 170-186 )
• “Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty” (Rida A. Bazzi and Goran Konjevod ; Distributed Computing -DISC 2004; Springer LNCS,Volume 3274/2004, 420-434)
• “Multiparty Key Agreement Protocol with Cheater Identification Based on Shamir Secret Sharing” (Kee-Young Yoo, Eun-Kyung Ryu and Jae-Yuel Im ;Computational Science and Its Applications – ICCSA 2004 ;Springer LNCS, Volume 3046/2004, 655-664)
• “Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups” (Joseph K. Liu, Victor K. Wei and Duncan S. Wong ; Information Security and Privacy -ACISP 2004; Springer LNCS, Volume 3108/2004, 325-335)
• “Optimistic Fair Exchange Based on Publicly Verifiable Secret Sharing” (Gildas Avoine and Serge Vaudenay ;Information Security and Privacy-ACISP 2004 ; Springer LNCS, Volume 3108/2004, 74-85)
• “Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model” (Anderson C.A. Nascimento, Joern Mueller-Quade, Akira Otsuka, Goichiro Hanaoka and Hideki Imai ;Applied Cryptography and Network Security -ACNS 2004; Springer LNCS, Volume 3089/2004, 355-368 )
• “Using Secret Sharing for Searching in Encrypted Data” (Richard Brinkman, Jeroen Doumen and Willem Jonker ; Secure Data Management-SDM 2004; Springer LNCS, Volume 3178/2004, 18-27)
• “Mobile Agents: Preserving Privacy and Anonymity” (Aneta Zwierko and Zbigniew Kotulski ; Intelligent Media Technology for Communicative Intelligence -IMTCI 2004; Springer LNCS, Volume 3490/2005, 246-258)
• “Security of Wang-Li Threshold Signature Scheme ” (Lifeng Guo ; Cryptology ePrint 2004/302)
• “Asynchronous Proactive RSA ” (Ruishan Zhang and Kefei Chen ;Cryptology ePrint  2004/292 )
• “New Monotone Span Programs from Old ” (Ventzislav Nikov and Svetla Nikova ; Cryptology ePrint  2004/282)
• “Cryptanalysis of Threshold-Multisignature schemes ” (Lifeng Guo ; Cryptology ePrint  2004/273)
• “Cryptanalysis of Threshold-Multisignature Schemes ” (Lifeng Guo ; Cryptology ePrint  2004/269 )
• “On codes, matroids and secure multi-party computation from linear secret sharing schemes ” (Ronald Cramer and Vanesa Daza and Ignacio Gracia and Jorge Jimenez Urroz and Gregor Leander and Jaume Marti-Farre and Carles Padro ;  Cryptology ePrint  2004/245 )
• “On the security of some nonrepudiable threshold proxy signature schemes with known signers ” (Zuo-Wen Tan and Zhuo-Jun Liu ; Cryptology ePrint  2004/234)
• “On Cheating Immune Secret Sharing ” (An Braeken, Svetla Nikova, Ventzislav Nikov ; Cryptology ePrint  2004/200 )
• “Optimal Updating of Ideal Threshold Schemes ” (S. G. Barwick and W.-A. Jackson and K. M. Martin and C. M. O’Keefe ; Cryptology ePrint   2004/178)
• “Updating the Parameters of a Threshold Scheme by Minimal Broadcast ” (S. G. Barwick and W.-A. Jackson and K. M. Martin ; Cryptology ePrint  2004/177 )
• “RDS: Remote Distributed Scheme for Protecting Mobile Agents ” (Asnat Dadon-Elichai ;Cryptology ePrint  2004/023)
• “An efficient construction of secret sharing for generalized adversary structure and its reduction ” (Guo, Y.-B., Shi, T.-J., Ma, J.-F. 2004 International Conference on Communications, Circuits and Systems Volume 1, 2004, Pages 6-10 )
• “Secret sharing with access structures in a hierarchy ” (Chang, C.-C., Lin, C.-H., Lee, W., Hwang, P.-C. Proceedings – International Conference on Advanced Information Networking and Application (AINA) Volume 2, 2004, Pages 31-34 )

 2005

• “A New (t, n)-Threshold Multi-secret Sharing Scheme” (HuiXian Li, ChunTian Cheng and LiaoJun Pang ; Computational Intelligence and Security -CIS 2005; Springer LNCS, Volume 3802/2005, 421-426)
• “A Cost-Effective Private-Key Cryptosystem for Color Image Encryption” (Rastislav Lukac and Konstantinos N. Plataniotis ; Computational Science – ICCS 2005 ;Springer LNCS, Volume 3514/2005, 679-686)
• “A New Black and White Visual Cryptographic Scheme for General Access Structures” (Avishek Adhikari, Tridib Kumar Dutta and Bimal Roy ;Progress in Cryptology – INDOCRYPT 2004 ; Springer LNCS, Volume 3348/2005, 399-413)
• “A New Secret Sharing Scheme for Images Based on Additive 2-Dimensional Cellular Automata” (Gonzalo Álvarez Marañón, Luis Hernández Encinas and Ángel Martín del Rey ;Pattern Recognition and Image Analysis -IbPRIA 2005; Springer LNCS, Volume 3522/2005, 411-418)
• “A Secure and Efficient (t, n) Threshold Verifiable Multi-secret Sharing Scheme” (Mei-juan Huang, Jian-zhong Zhang and Shu-cui Xie ; Computational Intelligence and Security -CIS 2005; Springer LNCS, Volume 3802/2005, 532-537 )
• “A Robust Coalition-Resistant Threshold Signature Scheme with Anonymous Signers” (Ming-wen Wang, Qing-xin Zhu and Li Qing ; Parallel and Distributed Processing and Applications – ISPA 2005 Workshops ;Springer LNCS, Volume 3759/2005, 315-322)
• “A Robust Double Auction Protocol Based on a Hybrid Trust Model” (JungHoon Ha, Jianying Zhou and SangJae Moon ; Information Systems Security -ICISS 2005;  Springer LNCS, Volume 3803/2005, 77-90)
• “A Scalable Mutual Authentication and Key Distribution Mechanism in a NEMO Environment” (Mihui Kim, Eunah Kim and Kijoon Chae ;Computational Science and Its Applications – ICCSA 2005 ;Springer LNCS, Volume 3480/2005, 591-600)
• “A Verifiable Fingerprint Vault Scheme” (Qiong Li, Xiamu Niu, Zhifang Wang, Yuhua Jiao and Sheng-He Sun ; Knowledge-Based Intelligent Information and Engineering Systems -KES 2005; Springer LNCS, Volume 3683/2005, 1072-1078)
• “A Study on Efficient Key Management in Real Time Wireless Sensor Network” (Sangchul Son, Miyoun Yoon, Kwangkyum Lee and Yongtae Shin ; Mobile Ad-hoc and Sensor Networks -MSN 2005; Springer LNCS,Volume 3794/2005, 745-752)
• “An Improved Multi-stage (t, n)-Threshold Secret Sharing Scheme” (Hui-Xian Li, Chun-Tian Cheng and Liao-Jun Pang ; Advances in Web-Age Information Management -WAIM 2005; Springer LNCS, Volume 3739/2005, 267-274)
• “Addressing New Challenges by Building Security Protocols Around Graphs” (Kamil Kulesza and Zbigniew Kotulski ; Security Protocols-11th International Workshop ;Springer LNCS, Volume 3364/2005, 301-306)
• “All Sail, No Anchor III: Risk Aggregation and Time’s Arrow” (Bob Blakley and G.R. Blakley ; Information Security and Privacy -ACISP 2005; Springer LNCS, Volume 3574/2005, 1-16)
• “Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes” (Claude Crépeau, Daniel Gottesman and Adam Smith ; Advances in Cryptology – EUROCRYPT 2005 ; Springer LNCS, Volume 3494/2005, 285-301)
• “Audio Secret Sharing for 1-Bit Audio” (Ryouichi Nishimura, Norihiro Fujita and Yôiti Suzuki ; Knowledge-Based Intelligent Information and Engineering Systems-KES 2005 ; Springer LNCS, Volume 3682/2005, 1152-1158 )
• “Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields” (Ronald Cramer, Serge Fehr and Martijn Stam ; Ronald Cramer, Serge Fehr and Martijn Stam ; Springer LNCS, 344-360)
• “Characterizing Ideal Weighted Threshold Secret Sharing” (Amos Beimel, Tamir Tassa and Enav Weinreb ; Theory of Cryptography -TCC 2005; Springer LNCS, Volume 3378/2005, 600-619)
• “Classification of Universally Ideal Homomorphic Secret Sharing Schemes and Ideal Black-Box Secret Sharing Schemes” (Zhanfei Zhou ; Information Security and Cryptology -CISC 2005; Springer LNCS, Volume 3822/2005 , 370-383)
• “Cryptographic Protocol Design Concept with Genetic Algorithms” (Kyeongmo Park and Chuleui Hong ; Knowledge-Based Intelligent Information and Engineering Systems- KES 2005; Springer LNCS, Volume 3682/2005, 483-489)
• “Error-Set Codes and Related Objects” (An Braeken, Ventzislav Nikov and Svetla Nikova ; Computing and Combinatorics -COCOON 2005; Springer LNCS, Volume 3595/2005, 577-585)
• “Extended Visual Secret Sharing Schemes with High-Quality Shadow Images Using Gray Sub Pixels” (Ching-Nung Yang and Tse-Shih Chen ; Image Analysis and Recognition -ICIAR 2005; Springer LNCS, Volume 3656/2005, 1184-1191)
• “Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation” (Vladimir Kolesnikov ; Advances in Cryptology – ASIACRYPT 2005 ; Springer LNCS, Volume 3788/2005, 136-155 )
• “New Aspect Ratio Invariant Visual Secret Sharing Schemes Using Square Block-Wise Operation“　(Ching-Nung Yang and Tse-Shih Chen ; Image Analysis and Recognition- ICIAR 2005; Springer LNCS, Volume 3656/2005, 1167-1174 )
• “Multi-proxy Signatures Based on Diffie-Hellman Problems Allowing Repeated Delegations” (So-Young Park and Sang-Ho Lee ;Web and Communication Technologies and Internet-Related Social Issues – HSI 2005 ; Springer LNCS, Volume 3597/2005, 340-344)
• “New Methods to Construct Cheating Immune Multisecret Sharing Scheme” (Wen Ping Ma and Fu Tai Zhang ; Information Security and Cryptology -CISC 2005; Springer LNCS, Volume 3822/2005, 384-394)
• “New Size-Reduced Visual Secret Sharing Schemes with Half Reduction of Shadow Size” (Ching-Nung Yang and Tse-Shih Chen ; Computational Science and Its Applications – ICCSA 2005 ;Springer LNCS, Volume 3480/2005, 19-28 )
• “On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes” (Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré and Carles Padró ; Advances in Cryptology – CRYPTO 2005 ; Springer LNCS, Volume 3621/2005, 327-343)
• “On Proactive Secret Sharing Schemes” (Ventzislav Nikov and Svetla Nikova ; Selected Areas in Cryptography -SAC 2004; Springer LNCS, Volume 3357/2005, 308-325)
• “Optimization of Electronic First-Bid Sealed-Bid Auction Based on Homomorphic Secret Sharing” (Kun Peng, Colin Boyd and Ed Dawson ; Progress in Cryptology – Mycrypt 2005 ;Springer LNCS, Volume 3715/2005, 84-98)
• “On the Size of Monotone Span Programs” (Ventzislav Nikov, Svetla Nikova and Bart Preneel ; Security in Communication Networks -SCN 2004; Springer LNCS, Volume 3352/2005; 249-262 )
• “Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes” (Zhifang Zhang, Mulan Liu and Liangliang Xiao ; Advances in Cryptology – ASIACRYPT 2005 ; Springer LNCS, Volume 3788/2005, 156-173)
• “Perfect Reconstruction of Black Pixels Revisited” (Hans Ulrich Simon ; Fundamentals of Computation Theory -FCT 2005; Springer LNCS, Volume 3623/2005, 221-232)
• “Security Analysis of Three Cryptographic Schemes from Other Cryptographic Schemes” (Sherman S.M. Chow, Zhengjun Cao and Joseph K. Liu ;Information Security and Cryptology -CISC 2005; Springer LNCS, Volume 3822/2005, 290-301)
• “Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation” (Ronald Cramer, Ivan Damgård and Yuval Ishai ; Theory of Cryptography -TCC 2005; Springer LNCS, Volume 3378/2005, 342-362 )
• “Simple Threshold RSA Signature Scheme Based on Simple Secret Sharing” (Shaohua Tang ; Computational Intelligence and Security -CIS 2005; Springer LNCS,  Volume 3802/2005, 186-191)
• “The Role of Secret Sharing in the Distributed MARE Protocols” (Kyeongmo Park ; Computational Science and Its Applications –ICCSA 2005 ; Springer LNCS, Volume 3481/2005, 264-273)
• “Self-configurable Key Pre-distribution in Mobile Ad Hoc Networks” (Claude Castelluccia, Nitesh Saxena and Jeong Hyun Yi ; NETWORKING 2005-4th International IFIP-TC6 Networking Conference; Springer LNCS, Volume 3462/2005, 1083-1095)
• “Self-healing Key Distribution Schemes with Sponsorization” (Germán Sáez ; Communications and Multimedia Security -CMS 2005; Springer LNCS, Volume 3677/2005, 22-31)
• “Self-organized Security Architecture for MANET” (Panneer Pandi Gnana Durai and Ranjani Parthasarathy ; Intelligent Information Technology -CIT 2004; Springer LNCS, Volume 3356/2005, 169-179)
• “Visual Cryptographic Protocols Using the Trusted Initializer” (Hidenori Kuwakado, Masakatu Morii and Hatsukazu Tanaka Information and Communications Security -ICICS 2005; Springer LNCS,  Volume 3783/2005, 112-122)
• “Universally Composable DKG with Linear Number of Exponentiations” (Douglas Wikström ; Security in Communication Networks -SCN 2004; Springer LNCS, Volume 3352/2005, 263-277)
• “An Efficient Fingerprinting Scheme with Secret Sharing” (Seunglim Yong and Sang-Ho Lee ; Digital Rights Management. Technologies, Issues, Challenges and Systems -DRMTICS 2005; Springer LNCS, Volume 3919/2006, 192-202)
• “On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes” (Ventzislav Nikov and Svetla Nikova ; Coding and Cryptography -WCC 2005; Springer LNCS, Volume 3969/2006, 275-290  )
• “Compartmented Secret Sharing Based on the Chinese Remainder Theorem ” (Sorin Iftene ;Cryptology ePrint 2005/408)
• “Representing small identically self-dual matroids by self-dual codes ” (Carles Padro and Ignacio Gracia ; Cryptology ePrint 2005/376 )
• “Secret color images sharing schemes based on XOR operation ” (Dao-Shun Wang, Lei Zhang, Ning Ma and Lian-Sheng Huang ; Cryptology ePrint 2005/372  )
• “Statistical Multiparty Computation Based on Random Walks on Graphs ” (Liangliang Xiao, Mulan Liu, and Zhifang Zhang ; Cryptology ePrint 2005/337)
• “A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment ” (Raylin Tso and Ying Miao and Takeshi Okamoto and Eiji Okamoto ;Cryptology ePrint 2005/239)
• “A Secret Sharing Scheme for Preventing the Cheaters from Acquiring the Secret ” (Hassan Jameel and Sungyoung Lee ; Cryptology ePrint 2005/216 )
• “Secret sharing on the $d$-dimensional cube ” (Laszlo Csirmaz ; 2005/177 )
• “Multiparty Computation Based on Connectivity of Graphs ” (Liangliang Xiao and Mulan Liu and Zhifang Zhang ; Cryptology ePrint 2005/143)
• “How to Split a Shared Secret into Shared Bits in Constant-Round ” (Ivan Damg{\aa}rd and Matthias Fitzi and Jesper Buus Nielsen and Tomas Toft ; Cryptology ePrint 2005/140)
• “Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation ” (Eike Kiltz ; Cryptology ePrint 2005/066 )
• “Secret sharing schemes on graphs ” (Laszlo Csirmaz ; Cryptology ePrint 2005/059 )

 2006

• “A Proactive Secret Sharing for Server Assisted Threshold Signatures” (Jong-Phil Yang, Kyung Hyune Rhee and Kouichi Sakurai ; High Performance Computing and Communications -Second International Conference, HPCC 2006; Springer LNCS, Volume 4208/2006, 250-259)
• “A Protocol of Member-Join in a Secret Sharing Scheme” (Xiao Li and Mingxing He ; Information Security Practice and Experience -ISPEC 2006; Springer LNCS, Volume 3903/2006, 134-141)
• “A Novel Key Release Scheme from Biometrics” (Ong Thian Song, Andrew B.J. Teoh and David C.L. Ngo ; Intelligence and Security Informatics -ISI 2006; Springer LNCS, Volume 3975/2006, 764-765)
• “A New Key Management Scheme for Distributed Encrypted Storage Systems” (Myungjin Lee, Hyokyung Bahn and Kijoon Chae ; Computational Science and Its Applications – ICCSA 2006 ;Springer LNCS, Volume 3980/2006, 1072-1079)
• “A Secure and Efficient Secret Sharing Scheme with General Access Structures” (Liao-Jun Pang, Hui-Xian Li and Yu-Min Wang ; Fuzzy Systems and Knowledge Discovery -FSKD 2006; Springer LNCS, Volume 4223/2006, 646-649)
• “A Revocation Scheme Preserving Privacy” (Łukasz Krzywiecki, Przemysław Kubiak and Mirosław Kutyłowski ; Information Security and Cryptology -Inscrypt 2006; Springer LNCS, Volume 4318/2006, 130-143)
• “Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields” (Hao Chen and Ronald Cramer ;Advances in Cryptology – CRYPTO 2006 ; Springer LNCS, Volume 4117/2006, 521-536)
• “Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution” (Satoshi Obana and Toshinori Araki ; Advances in Cryptology – ASIACRYPT 2006 ;Springer LNCS, Volume 4284/2006, 364-379)
• “An Ideal and Robust Threshold RSA” (Hossein Ghodosi and Josef Pieprzyk ;Progress in Cryptology – VIETCRYPT 2006 ;Springer LNCS, Volume 4341/2006, 312-321)
• “Cheating Immune (2,n)-Threshold Visual Secret Sharing” (Roberto De Prisco and Alfredo De Santis ; Security and Cryptography for Networks -SCN 2006;  Springer LNCS, Volume 4116/2006, 216-228)
• “Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme” (Christophe Tartary and Huaxiong Wang ; Information Security and Cryptology -Inscrypt 2006; Springer LNCS, Volume 4318/2006, 103-117)
• “Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants” (Jaume Martí-Farré and Carles Padró ;Security and Cryptography for Networks -SCN 2006; Springer LNCS, Volume 4116/2006, 201-215)
• “Energy-Efficient and Non-interactive Self-certification in MANETs” (Jeong Hyun Yi ;Stabilization, Safety, and Security of Distributed Systems -SSS 2006; Springer LNCS, Volume 4280/2006, 533-547)
• “Linear Integer Secret Sharing and Distributed Exponentiation” (Ivan Damgård and Rune Thorbek ; Public Key Cryptography – PKC 2006 ;Springer LNCS, Volume 3958/2006, 75-90 )
• “Multipartite Secret Sharing by Bivariate Interpolation” (Tamir Tassa and Nira Dyn ; Automata, Languages and Programming -ICALP 2006,Springer LNCS, Volume 4052/2006, 288-299)
• “On Matroids and Non-ideal Secret Sharing” (Amos Beimel and Noam Livne ;Theory of Cryptography – TCC 2006 ;Springer LNCS, Volume 3876/2006, 482-501)
• “Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng” (Yvo Desmedt and Tanja Lange ; Financial Cryptography and Data Security -FC 2006 ; Springer LNCS,  Volume 4107/2006, 154-159)
• “Rational Secret Sharing, Revisited” (S. Dov Gordon and Jonathan Katz ;Security and Cryptography for Networks -SCN 2006; Springer LNCS, Volume 4116/2006, 229-241)
• “Real Perfect Contrast Visual Secret Sharing Schemes with Reversing” (Ching-Nung Yang, Chung-Chun Wang and Tse-Shih Chen ; Applied Cryptography and Network Security -ACNS 2006; Springer LNCS, Volume 3989/2006, 433-447)
• “Round-Optimal and Efficient Verifiable Secret Sharing” (Matthias Fitzi, Juan Garay, Shyamnath Gollakota, C. Pandu Rangan and Kannan Srinathan ; Theory of Cryptography -TCC 2006; Springer LNCS, 329-342)
• “Separating Sources for Encryption and Secret Sharing” (Yevgeniy Dodis, Krzysztof Pietrzak and Bartosz Przydatek ; Theory of Cryptography -TCC 2006; Springer LNCS, Volume 3876/2006, 601-616)
• “Secure Cryptographic Workflow in the Standard Model” (M. Barbosa and P. Farshim ; Progress in Cryptology – INDOCRYPT 2006 ;Springer LNCS, Volume 4329/2006, 379-393)
• “Threshold Cryptography Based on Asmuth-Bloom Secret Sharing” (Kamer Kaya, Ali Aydın Selçuk and Zahir Tezcan ; Computer and Information Sciences – ISCIS 2006 ; Springer LNCS, Volume 4263/2006, 935-942)
• “Threshold Implementations Against Side-Channel Attacks and Glitches” (Kamer Kaya, Ali Aydın Selçuk and Zahir Tezcan ; Information and Communications Security -ICICS 2006; Springer LNCS, Volume 4307/2006, 529-545)
• “Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation” (Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen and Tomas Toft ; Theory of Cryptography -TCC 2006; Springer LNCS, Volume 3876/2006, 285-304)
• “Visual Secret Sharing Scheme: Improving the Contrast of a Recovered Image Via Different Pixel Expansions” (Ching-Nung Yang and Tse-Shih Chen ; Image Analysis and Recognition -ICIAR 2006; Springer LNCS, Volume 4141/2006, 468-479)
• “ID-Based ( t , n ) Threshold Proxy Signcryption for Multi-agent Systems” (Fagen Li, Yupu Hu and Shuanggen Liu ; Computational Intelligence and Security -CIS 2006; Springer LNCS, Volume 4456/2007, 406-416)
• “Secure Cryptographic Workflow in the Standard Model ” (M. Barbosa and P. Farshim ; Cryptology ePrint 2006/450)
• “Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals ” (Mihir Bellare and Phillip Rogaway ; Cryptology ePrint 2006/449)
• “A New family of Ideal Multipartite Access Structure Based on MSP ” (Jun Xu and Jiwen Zeng and Xiaomin Zha ; Cryptology ePrint 2006/339)
• “Visual secret sharing scheme with autostereogram ” (Feng Yi and Daoshun Wang and Yiqi Dai ; Cryptology ePrint 2006/295)
• “Ideal Multipartite Secret Sharing Schemes ” (Oriol Farras and Jaume Marti-Farre and Carles Padro ; Cryptology ePrint 2006/292)
• “On Secret Sharing Schemes, Matroids and Polymatroids ” (Jaume Marti-Farre and Carles Padro ;Cryptology ePrint 2006/077 )
• “New Results on Multipartite Access Structures ” (Javier Herranz and German Saez ; Cryptology ePrint 2006/048)
• “An improved visual cryptography scheme for secret hiding” (Youmaran, R., Adler, A., Miri, A. 23rd Biennial Symposium on Communications ,2006 )
• “Simple multi-secret sharing schemes to achieve the optimal maximum improvement ratio” ( Wang, Y.-C., Juan, J.S.-T; Proceedings – IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing Volume 2006 I, 2006, Article number 1636253, Pages 58-63)
• “An image secret sharing method ” (Bai, L., Biswas, S., Ortiz, A., Dalessandro, D. 2006 9th International Conference on Information Fusion, FUSION 2006, Article number 4086091 )
• “A reliable (k, n) image secret sharing scheme” ( Bai, L; Proceedings – 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2006;  Article number 4030863, Pages 31-36)
• “A novel non-interactive verifiable secret sharing scheme” (Jun, A., Guisheng, L., Chunbo, M. ;International Conference on Communication Technology Proceedings, ICCT; 2006, Article number 4146627 )
• “Proposal of an asymptotically contrast-ideal (t, n)-threshold visual secret sharing scheme” (Koga, H., Ueda, E. ; IEEE International Symposium on Information Theory – Proceedings2006, Article number 4036097, Pages 912-916 )
• “DNA secret sharing “( Adhikari, A; 2006 IEEE Congress on Evolutionary Computation, CEC 2006; Article number 1688473, Pages 1407-1411)
• “Improved secret sharing with access structures in a hierarchy” (Yi, L., Ling, Z., Yumin, W. ;Proceedings of 2006 IEEE Asia-Pacific Conference on Services Computing, APSCC; 2006, Article number 4041206, Pages 18-25)
• “An efficient proactive share refreshing scheme for secret sharing in distributed systems” (Tang, C., Wu, D; GLOBECOM – IEEE Global Telecommunications Conference, 2006, Article number 4150916)
• “Ideal secret sharing schemes with multipartite access structures “( Ng, S.-L; IEE Proceedings: Communications Volume 153, Issue 2, April 2006, Pages 165-168 )

 2007

• “A New ( t , n ) −Threshold Scheme Based on Difference Equations ” (Chao-Wen Chan and Chin-Chen Chang ; Combinatorics, Algorithms, Probabilistic and Experimental Methodologies -ESCAPE 2007; Springer LNCS, Volume 4614/2007, 94-106 )
• “An Optimal Share Transfer Problem on Secret Sharing Storage Systems” (Toshiyuki Miyamoto and Sadatoshi Kumagai ; Parallel and Distributed Processing and Applications -ISPA 2007 ;Springer LNCS, Volume 4742/2007, 371-382)
• “Efficient ( k , n ) Threshold Secret Sharing Schemes Secure Against Cheating from n  − 1 Cheaters” (Toshinori Araki ; Information Security and Privacy -ACISP 2007; Springer LNCS, Volume 4586/2007, 133-142)
• “CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts” (Vanesa Daza, Javier Herranz, Paz Morillo and Carla Ràfols ; Provable Security- ProvSec 2007; Springer LNCS, Volume 4784/2007, 35-50)
• “Atomic Secure Multi-party Multiplication with Low Communication” (Ronald Cramer, Ivan Damgård and Robbert de Haan ; Advances in Cryptology – EUROCRYPT 2007 ;Springer LNCS, Volume 4515/2007, 329-346)
• “Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing” (Selim V. Kaya, Thomas B. Pedersen, Erkay Savaş and Yücel Saygıýn ; Emerging Technologies in Knowledge Discovery and Data Mining -PAKDD 2007 ;Springer LNCS, 280-291)
• “Flaws in Some Secret Sharing Schemes Against Cheating” (Toshinori Araki and Satoshi Obana ; Information Security and Privacy -ACISP 2007; Springer LNCS, Volume 4586/2007, 122-132)
• “Ideal Multipartite Secret Sharing Schemes” (Oriol Farràs, Jaume Martí-Farré and Carles Padró ; Advances in Cryptology – EUROCRYPT 2007 ;Springer LNCS, Volume 4515/2007, 448-465)
• “On Partial Anonymity in Secret Sharing” (Vanesa Daza and Josep Domingo-Ferrer ; Public Key Infrastructure -EuroPKI 2007; Springer LNCS, Volume 4582/2007, 193-202)
• “On Secret Sharing Schemes, Matroids and Polymatroids” (Jaume Martí-Farré and Carles Padró ; Theory of Cryptography -TCC 2007; Springer LNCS, Volume 4392/2007, 273-290)
• “Secret Swarm Unit Reactive k  −Secret Sharing” (Shlomi Dolev, Limor Lahiani and Moti Yung ; Progress in Cryptology –INDOCRYPT 2007 ; Springer LNCS, Volume 4859/2007, 123-137)
• “Secure Computation from Random Error Correcting Codes” (Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan and Vinod Vaikuntanathan ; Advances in Cryptology – EUROCRYPT 2007 ; Springer LNCS, Volume 4515/2007, 291-310)
• “Weakly-Private Secret Sharing Schemes” (Amos Beimel and Matthew Franklin ; Theory of Cryptography -TCC 2007; Springer LNCS, Volume 4392/2007, 253-272)
• “Combiner Driven Management Models and Their Applications” (Michael Beiter ; Research in Cryptology -WEWoRC 2007; Springer LNCS, Volume 4945/2008, 114-126)
• “Key Management Based on Hierarchical Secret Sharing in Ad-Hoc Networks” (Chuangui Ma and Rui Cheng ; Information Security and Cryptology -Inscrypt 2007; Springer LNCS, Volume 4990/2008, 182-191)
• “Multiple Watermarking in Visual Cryptography” (Hao Luo, Zhe-Ming Lu and Jeng-Shyang Pan ; Digital Watermarking -IWDW 2007 ; Springer LNCS, Volume 5041/2008, 60-70)
• “Probabilistic ( n , n ) Visual Secret Sharing Scheme for Grayscale Images” (Daoshun Wang, Xiaobo Li and Feng Yi ; Information Security and Cryptology -Inscrypt 2007;Springer LNCS,  Volume 4990/2008, 192-200 )
• “Fuzzy Private Matching (Extended Abstract) ” ({L}ukasz Chmielewski and Jaap-Henk Hoepman ;Cryptology ePrint 2007/363 )
• “Secret sharing on the infinite ladder ” (Laszlo Csirmaz ; Cryptology ePrint 2007/355)
• “Secret sharing on infinite graphs ” (Laszlo Csirmaz ;  Cryptology ePrint 2007/297)
• “CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts ” (Vanesa Daza and Javier Herranz and Paz Morillo and Carla R`afols ; Cryptology ePrint 2007/127  )
• “A generalization of Secret Sharing Scheme on the Basis of Recovering Algorithm, K-RA ” (Masao KASAHARA ; Cryptology ePrint 2007/106 )
• “Distributed privacy preserving k-means clustering with additive secret sharing ” (Mahir Can Doganay, Thomas B. Pedersen, Yücel Saygin, Erkay Savaş, Albert Levi ;ACM International Conference Proceeding Series; Vol. 331;Proceedings of the 2008 international workshop on Privacy and anonymity in information society table of contents Nantes, France SESSION: Distributed privacy protection and query auditing Pages 3-11 )
• “A New Dynamic Threshold Secret Sharing Scheme from Bilinear Maps“( Chen Wei; Long Xiang; Bai Yuebin; Gao Xiaopeng; Parallel Processing Workshops, 2007. ICPPW 2007. International Conference on 10-14 Sept. 2007 Page(s):19 – 19)
• “Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images” (Miyuki Uno , M. Kano; ISPEC 2007, Springer LNCS, Volume 4464/2007,344-359)
• “A verifiable multi-secret sharing scheme (VMSS)” (Pang, L., Jiao, L., Li, H., Wang, Y.; Proceedings – CIS Workshops 2007, International  Conference on Computational Intelligence and Security Workshops, art. no. 4425603, pp. 749-752)
• “Efficient Multiple Assignment Secret Sharing Schemes” (Tochikubo, Kouya; Information Theory, 2007. ISIT 2007. IEEE International Symposium on 24-29 June 2007 Page:461 – 465)
• “Secure Construction for Nonlinear Function Threshold Ramp Secret Sharing” (Yoshida, Maki; Fujiwara, Toru; Information Theory, 2007. ISIT 2007. IEEE International Symposium on 24-29 June 2007 Page:1041 – 1045)
• “A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP” (Runhua Shi; Hong Zhong; Liusheng Huang; Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on Volume 2, July 30 2007-Aug. 1 2007 Page(s):9 – 13)
• “A Proactive Secure Multisecret Sharing Threshold Scheme” (Feng Li; Jianwei Shang; Daxing Li; Software Engineering, Artificial Intelligence, Networking, and
  Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on Volume 1,  July 30 2007-Aug. 1 2007 Page(s):105 – 110)
• “General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting” (Sorin Iftene; Electronic Notes in Theoretical Computer Science
  Volume 186, 14 July 2007, Pages 67-84 Proceedings of the First Workshop in Information and Computer Security (ICS 2006))
• “A New Multi-secret Sharing Scheme with Multi-policy” (Geng Yong-Jun; Fan Xiao-Hong; Hong Fan; Advanced Communication Technology, The 9th International Conference on Volume 3,  12-14 Feb. 2007 Page(s):1515 – 1517)
• “An ECC based vector space key sharing scheme” (Shichun Pang; Shufen Liu; Pervasive Computing and Applications, 2006 1st International Symposium on
  3-5 Aug. 2006 Page(s):524 – 527)
• “A Light-Weight e-Voting System with Distributed Trust” ( Aneta Zwierko and Zbigniew Kotulski Electronic Notes in Theoretical Computer Science Volume 168, 8 February 2007, Pages 109-126 Proceedings of the Second International Workshop on Views on Designing Complex Architectures (VODCA 2006) )
• “An Unconditionally Secure Multi-round Revocation Scheme Using Secret Sharing” (Ming Yang; TENCON 2005 IEEE Region 10 21-24 Nov. 2005 Page(s):1 – 6 )

・2008

• “A Matrix-Based Secret Sharing Scheme for Images” (A. Martín del Rey ; Progress in Pattern Recognition, Image Analysis and Applications -CIARP 2008; Springer LNCS, Volume 5197/2008, 635-642)
• “A New ( k , n )-Threshold Secret Sharing Scheme and Its Extension” (Jun Kurihara, Shinsaku Kiyomoto, Kazuhide Fukushima and Toshiaki Tanaka ; Information Security- ISC 2008; Springer LNCS, Volume 5222/2008, 455-470 )
• “A Secret Sharing Scheme for Digital Images Based on Two-Dimensional Linear Cellular Automata” (Angel Martín del Rey ; Combinatorial Image Analysis -IWCIA 2008; Springer LNCS, Volume 4958/2008, 318-329)
• “A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem” (Kamer Kaya and Ali Aydın Selçuk ; Progress in Cryptology – INDOCRYPT 2008 ; Springer LNCS, Volume 5365/2008, 414-425)
• “Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes” (Tiancheng Lou and Christophe Tartary ; Cryptology and Network Security -CANS 2008; Springer LNCS, Volume 5339/2008, 196-213)
• “Alternative Protocols for Generalized Oblivious Transfer” (Bhavani Shankar, Kannan Srinathan and C. Pandu Rangan  ; Distributed Computing and Networking -ICDCN 2008 ; Springer LNCS, Volume 4904/2008, 304-309)
• “Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors” (Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró and Daniel Wichs ; Advances in Cryptology – EUROCRYPT 2008 ;Springer LNCS, Volume 4965/2008, 471-488 )
• “Cryptography and Game Theory: Designing Protocols for Exchanging Information” (Gillat Kol and Moni Naor ; Theory of Cryptography -TCC 2008; Springer LNCS, Volume 4948/2008; 320-339)
• “How to Publicly Verifiably Expand a Member without Changing Old Shares in a Secret Sharing Scheme” (Jia Yu, Fanyu Kong, Rong Hao and Xuliang Li ; Intelligence and Security Informatics – IEEE ISI 2008 International Workshops: PAISI, PACCF, and SOCO 2008; Springer LNCS, Volume 5075/2008, 138-148)
• “Improved Data Hiding Technique for Shares in Extended Visual Secret Sharing Schemes” (Rabia Sirhindi, Saeed Murtaza and Mehreen Afzal ; Information and Communications Security -ICICS 2008 ; Springer LNCS, Volume 5308/2008, 376-386)
• “Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network” (Travis R. Beals and Barry C. Sanders ; Information Theoretic Security -ICITS 2008; Springer LNCS, Volume 5155/2008, 29-39)
• “Improving the Round Complexity of VSS in Point-to-Point Networks” (Jonathan Katz, Chiu-Yuen Koo and Ranjit Kumaresan ; Automata, Languages and Programming -ICALP 2008; Springer LNCS, Volume 5126/2008, 499-510)
• “Matroids Can Be Far from Ideal Secret Sharing” (Amos Beimel, Noam Livne and Carles Padró ; Theory of Cryptography -TCC 2008; Springer LNCS, Volume 4948/2008, 194-212)
• “On Linear Secret Sharing for Connectivity in Directed Graphs” (Amos Beimel and Anat Paskin ; Security and Cryptography for Networks -SCN 2008; Springer LNCS, Volume 5229/2008, 172-184)
• “Rational Secret Sharing with Repeated Games” (Shaik Maleka, Amjed Shareef and C. Pandu Rangan ; Information Security Practice and Experience -ISPEC 2008 ; Springer LNCS, Volume 4991/2008, 334-346)
• “Revisiting the Karnin, Greene and Hellman Bounds” (Yvo Desmedt, Brian King and Berry Schoenmakers ; Information Theoretic Security -ICITS 2008; Springer LNCS, Volume 5155/2008, 183-198)
• “Robust Threshold Schemes Based on the Chinese Remainder Theorem” (Kamer Kaya and Ali Aydın Selçuk ; Progress in Cryptology – AFRICACRYPT 2008 ;Springer LNCS,  Volume 5023/2008, 94-108)
• “Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes” (Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling and Huaxiong Wang ; Advances in Cryptology – ASIACRYPT 2008 ; Springer LNCS, Volume 5350/2008, 19-36)
• “Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures” (Christophe Tartary, Josef Pieprzyk and Huaxiong Wang ; Information Security and Cryptology -Inscrypt 2007; Springer LNCS, 167-181 )
• “A multi-stage secret sharing scheme with general access structures ” Wei, Y., Zhong, P., Xiong, G ;2008 International Conference on Wireless Communications, Networking
  and Mobile Computing, WiCOM 2008, art. no. 4681128
• “A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem” Kamer Kaya & Ali Aydın Selçuk; Progress in Cryptology – INDOCRYPT 2008, Lecture Notes in Computer Science , Springer- Berlin / Heidelberg, Volume 5365/2008, Pages- 414-425
• “A new (t, n) multi-secret sharing scheme” Tan, X.-Q., Wang, Z.-G.; Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008, art. no. 4741106, pp. 861-865
• “Dynamic threshold multi-secret sharing scheme using elliptic curve and bilinear maps” Wang, S.-J., Tsai, Y.-R., Shen, J.-J. Proceedings of the 2008 2nd International Conference on Future Generation Communication and Networking, FGCN 2008 2, art. no. 4734246, pp. 405-410
• “A hierarchical threshold multi-secret sharing scheme” Shi, R., Zhong, H.; 2nd International Conference on Anti-counterfeiting, Security and Identification, ASID 2008, art. no. 4688398, pp. 231-234
• “Sure interpolation and its application to hierarchical threshold secret sharing scheme ” Yanshuo, Z., Zhuojun, L., Guifang, H ;Proceedings – International Symposium on Computer Science and Computational Technology, ISCSCT 2008 1, art. no. 4731464, pp. 447-450
• “A new (t, n)-threshold secret sharing scheme” Tang, C., Yao, Z.-A. ;Proceedings – 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008, art. no. 4737091, pp. 920-924
• “A practical publicly verifiable secret sharing scheme based on bilinear pairing” Tian, Y., Peng, C., Zhang, R., Chen, Y; 2nd International Conference on Anti-counterfeiting, Security and Identification, ASID 2008, art. no. 4688348, pp. 71-75;
• “A secret sharing shuffling scheme based on polynomial” Xi Zhang; Lei Zhang; Quan Zhang; Chaojing Tang; Information and Automation, 2008. ICIA 2008. International Conference
  on 20-23 June 2008 Page(s):1746 – 1750
• “A Verifiable (t, n) Multiple Secret Sharing Scheme and Its Analyses” Liaojun Pang; Huixian Li; Ye Yao; Yumin Wang; Electronic Commerce and Security, 2008 International Symposium on 3-5,Aug. 2008 Page(s):22 – 26
• “New schemes for sharing points on an elliptic curve” Duo Liu, a, , Dongping Huanga, Ping Luoa and Yiqi Daia; Computers & Mathematics with Applications
  Volume 56, Issue 6, September 2008, Pages 1556-1561
• “An Efficient (t, n)-Threshold Multi-Secret Sharing Scheme” Shi Runhua; Huang Liusheng; Zhong Hong; Knowledge Discovery and Data Mining, 2008. WKDD 2008. International Workshop on 23-24 Jan. 2008 Page(s):580 – 583
• “Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves” ; Massoud Hadian Dehkordia, and Samaneh Mashhadi, a, Computer Communications Volume 31, Issue 9, 8 June 2008, Pages 1777-1784
• “Access Structures of Elliptic Secret Sharing Schemes” Hao Chen; San Ling; Chaoping Xing; Information Theory, IEEE Transactions on Volume 54,  Issue 2,  Feb. 2008 Page(s):850 – 852
• “A Recursive Threshold Visual Cryptography Scheme ” (Abhishek Parakh and Subhash Kak ; Cryptology ePrint 2008/535 )
• “Extended Access Structures and Their Cryptographic Applications ” (Vanesa Daza and Javier Herranz and Paz Morillo and Carla Rafols ;Cryptology ePrint 2008/502 )
• “Efficient Rational Secret Sharing in the Standard Communication Model ” (Georg Fuchsbauer and Jonathan Katz and Eric Levieil and David Naccache ;Cryptology ePrint 2008/488  )
• “Sharing DSS by the Chinese Remainder Theorem ” (Kamer Kaya and Ali Aydın Selçuk ; Cryptology ePrint 2008/483 )
• “A New $(k,n)$-Threshold Secret Sharing Scheme and Its Extension ” (Jun Kurihara and Shinsaku Kiyomoto and Kazuhide Fukushima and Toshiaki Tanaka ;Cryptology ePrint 2008/409 )
• “Dynamic Threshold Cryptosystem without Group Manager ” (Andreas Noack and Stefan Spitz ;Cryptology ePrint 2008/380 )
• “Using Commutative Encryption to Share a Secret” (Saied Hosseini Khayat ; Cryptology ePrint 2008/356 )
• “The Multireceiver Commitment Schemes ” (Shuhong Wang ; Cryptology ePrint 2008/213 )
• “Restricted Adaptive Oblivious Transfer ” (Javier Herranz ; Cryptology ePrint 2008/182)
• “Fairness with an Honest Minority and a Rational Majority ” (Shien Jin Ong and David Parkes and Alon Rosen and Salil Vadhan ; Cryptology ePrint  2008/097 )
• “Unidirectional Key Distribution Across Time and Space with Applications to RFID Security ” (Ari Juels and Ravikanth Pappu and Bryan Parno ; Cryptology ePrint 2008/044)
• “Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors ” ( Ronald Cramer and Yevgeniy Dodis and Serge Fehr and Carles Padr ‘o and Daniel Wichs ; Cryptology ePrint  2008/030)
• “Disjunctive Multi-Level Secret Sharing ” (Mira Belenkiy ;Cryptology ePrint 2008/018)

 2009

• “A Secret Sharing Scheme for Digital Images Based on Cellular Automata and Boolean Functions” (Ángel Martín del Rey and Gerardo Rodríguez Sánchez ;Bio-Inspired Systems: Computational and Ambient Intelligence -IWANN 2009; Springer LNCS, Volume 5517/2009, 1200-1207)
• “On Non-representable Secret Sharing Matroids” (Qi Cheng, Yong Yin, Kun Xiao and Ching-Fang Hsu ; Information Security Practice and Experience -ISPEC 2009 ; Springer LNCS, Volume 5451/2009, 124-135)
• “Practical Threshold Signatures with Linear Secret Sharing Schemes” (İlker Nadi Bozkurt, Kamer Kaya and Ali Aydın Selçuk ; Progress in Cryptology – AFRICACRYPT 2009 ; Springer LNCS,  Volume 5580/2009, 167-178)
• “An Improved Distributed Key Management Scheme in Wireless Sensor Networks” (Jun Zhou and Mingxing He ; Information Security Applications – WISA 2008; Springer LNCS, Volume 5379/2009, 305-319)
• “Fairness with an Honest Minority and a Rational Majority” (Shien Jin Ong, David C. Parkes, Alon Rosen and Salil Vadhan ; Theory of Cryptography -TCC 2009; Springer LNCS, Volume 5444/2009, 36-53 )
• “Purely Rational Secret Sharing (Extended Abstract)” (Silvio Micali and abhi shelat ; Theory of Cryptography -TCC 2009; Springer LNCS, Volume 5444/2009, 54-71)
• “Secret Sharing and Non-Shannon Information Inequalities” (Amos Beimel and Ilan Orlov ; Theory of Cryptography -TCC 2009; Springer LNCS, Volume 5444/2009, 539-557)
• “Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images” (Miyuki Uno and Mikio Kano ; Information Security and Cryptology – ICISC 2008 ;Springer LNCS, Volume 5461/2009, 84-97)
• “A Probabilistic Secret Sharing Scheme for a Compartmented Access Structure “(Yuyin Yu and Mingsheng Wang ; Cryptology ePrint ,2009/301 )
• “Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data ” (Rafael Dowsley and Jörn Müller-Quade and Akira Otsuka and Goichiro Hanaoka and Hideki Imai and Anderson C. A. Nascimento ;Cryptology ePrint 2009/273 )
• “Dealer-Free Threshold Changeability in Secret Sharing Schemes” (Mehrdad Nojoumian and Douglas R. Stinson ; Cryptology ePrint ,2009/268 )
• “General Error Decodable Secret Sharing Scheme and Its Application ” (Kaoru Kurosawa ;Cryptology ePrint , 2009/263)
• “Unconditionally Secure Social Secret Sharing Scheme “(Mehrdad Nojoumian and Douglas R. Stinson and Morgan Grainger ; Cryptology ePrint 2009/207 )
• “Ideal Hierarchical Secret Sharing Schemes ” (Oriol Farras and Carles Padro ;Cryptology ePrint 2009/141 )
• “Secret sharing on trees: problem solved ” (Laszlo Csirmaz and Gabor Tardos ;Cryptology ePrint 2009/071)
• “Framework for Analyzing Optimistic Fair Exchange with Distributed Arbiters ” (Alptekin Kupcu and Anna Lysyanskaya ;Cryptology ePrint 2009/069 )
• “On the impossibility of graph secret sharing ” (Laszlo Csirmaz ; Cryptology ePrint 2009/059 )

 

2010

• “An Efficient and Information Theoretically Secure Rational Secret Sharing Scheme based on Symmetric Bivariate Polynomials” (Zhang Yun and Christophe Tartary ; Cryptology ePrint 2010/635 )
• “Password-Protected Secret Sharing” (Stanislaw Jarecki and Ali Bagherzandi and Nitesh Saxena and Yanbin Lu ; Cryptology ePrint 2010/561 )
• “Rational Secret Sharing with Side Information in Point-to-Point Networks via Time-Delayed Encryption” (Anna Lysyanskaya and Aaron Segal ; Cryptology ePrint 2010/540 )
• “A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme” (Mahabir Prasad Jhanwar ; Cryptology ePrint 2010/495 )
• “Unconditionally Secure Rational Secret Sharing in Standard Communication Networks” (Zhifang Zhang ; Cryptology ePrint 2010/462 )
• “Linear Secret Sharing for Hierarchical Access Structures” (Ali Aydun Selquk and Ramazan Yulmaz ; Cryptology ePrint 2010/402 )
• “Lattice-theoretic Characterization of Secret Sharing Representable Connected Matroids” (A.N.Alekseychuk ; Cryptology ePrint 2010/348 )
• “Studies on Verifiable Secret Sharing Byzantine Agreement and Multiparty Computation” (Arpita Patra ; Cryptology ePrint 2010/280 )
• “Collusion Free Protocol for Rational Secret Sharing” (Amjed Shareef ; Cryptology ePrint 2010/250 )
• “Rational Secret Sharing without Broadcast” (Amjed Shareef ; Cryptology ePrint 2010/249 )
• “On Representable Matroids and Ideal Secret Sharing” (Ching-Fang Hsu and Qi Cheng ; Cryptology ePrint 2010/232 )
• “Rational Secret Sharing AS Extensive Games” (Zhifang Zhang ; Cryptology ePrint 2010/184 )
• “Secret Sharing Extensions based on the Chinese Remainder Theorem” (Kamer Kaya and Ali Aydun Selquk ; Cryptology ePrint 2010/096 )

 2011

• “On the Security of a Cheating Immune Visual Secret Sharing Scheme” (Yu-Chi Chen and Du-Shiau Tsai and Gwoboa Horng ; Cryptology ePrint 2011/631 )
• “Protecting AES with Shamir’s Secret Sharing Scheme” (Louis Goubin and Ange Martinelli ; Cryptology ePrint 2011/516 )
• “On the Access Structures of Hyperelliptic Secret Sharing” (Lei Li and Siman Yang ; Cryptology ePrint 2011/415 )
• “An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem (Revised Version)” (Yun Zhang, Christophe Tartary and Huaxiong Wang ; Cryptology ePrint 2011/392 )
• “Socio-Rational Secret Sharing as a New Direction in Rational Cryptography” (Mehrdad Nojoumian ; Cryptology ePrint 2011/370 )
• “Simple and Asymptotically Optimal $t$-Cheater Identifiable Secret Sharing Scheme” (Ashish Choudhury ; Cryptology ePrint 2011/330 )
• “Computational Verifiable Secret Sharing Revisited” (Michael Backes and Anikei Kate and Arpita Patra ; Cryptology ePrint 2011/281 )
• “A Novel Adaptive Proactive Secret Sharing without a Trusted Party” (Xiuqun Wang ; Cryptology ePrint 2011/241 )
• “Some aspects of multi-variable secret sharing” (Umadevi Ganugula and Prabal Paul ; Cryptology ePrint 2011/186 )
• “On-line secret sharing” (Laszlo Csirmaz and Gabor Tardos ; Cryptology ePrint 2011/174 )
• “The Optimal Linear Secret Sharing Scheme for Any Given Access Structure” (Tang Chunming, Gao Shuhong Chengli ; Cryptology ePrint 2011/147 )
• “Rational Secret Sharing with Honest Players over an Asynchronous Channel” (William K. Moses Jr. and C. Pandu Rangan ; Cryptology ePrint 2011/068 )
• “Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme” (Ashish Choudhury and Arpita Patra ; Cryptology ePrint 2011/031 )

sakurai@csce.kyushu-u.ac.jpMaintained by Kouichi SAKURAI
Version 0.17
March 27, 2010

Introduction

Secret Sharing & Bibliography

Journal Article  1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009

Conference Article  1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009

Journal Article

1998

• “On Matroid Characterization of Ideal Secret Sharing Schemes“　(Jovan Dj. Golic; Journal of Cryptology; Volume 11, Number 2 / October, 1998)
• “How to Build Robust Shared Control Systems ” (Ross Anderson, Cunsheng Ding, Tor Helleseth and Torleiv Klove; Designs, Codes and Cryptography;  Volume 15, Number 2 / November, 1998)
• “Robust vector space secret sharing schemes ” (Padro C; INFORMATION PROCESSING LETTERS   Volume: 68   Issue: 3  Pages: 107-111   Published: November 1998)
• “A General Decomposition Construction for Incomplete Secret Sharing Schemes” (Marten van Dijk, Wen-Ai Jackson and Keith M. Martin; Designs, Codes and Cryptography; Volume 15, Number 3 / December, 1998)

1999

• “Detection of Cheaters in Vector Space Secret Sharing Schemes” (Carles Padro, Germán Sáez and Jorge Luis Villar; Designs, Codes and Cryptography; Volume 16, Number 1/ January, 1999)
• “An application of ramp schemes to broadcast encryption ” (Stinson DR, Wei R; INFORMATION PROCESSING LETTERS  Volume: 69   Issue: 3   Pages: 131-135 /February 12 1999)
• “Weighted threshold secret sharing schemes ” (Morillo P, Padro C, Saez G, et al.; INFORMATION PROCESSING LETTERS  Volume: 70   Issue: 5   Pages: 211-216 /June 1999)
• “Image size invariant visual cryptography ” (Ito R, Kuwakado H, Tanaka H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E82A   Issue: 10   Pages: 2172-2177/ October 1999)
• “Probability of shares in secret sharing schemes ” (Blundo C, De Santis A, Gaggia AG; INFORMATION PROCESSING LETTERS  Volume: 72   Issue: 5-6   Pages: 169-175  /December 1999)

2000

• “A share assignment method to maximize the probability of secret sharing reconstruction under the Internet ” (Lee CY, Yeh YS, Chen DJ, et al.; IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   Volume: E83D   Issue: 2   Pages: 190-199/February2000)
• “New Colored Visual Secret Sharing Schemes” (Ching-Nung Yang and Chi-Sung Laih; Designs, Codes and Cryptography; Volume 20, Number 3 / July, 2000)
• “A practical (t, n) multi-secret sharing scheme ” (Chien HY, Jan JK, Tseng YM; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E83A   Issue: 12   Pages: 2762-2765/December 2000)
• “Construction of visual secret sharing schemes with almost optimal contrast ” (Christian Kuhlmann, Hans Ulrich Simon ; Symposium on Discrete Algorithms archive Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms ; Pages: 263 – 272)
• “Computing Functions of a Shared Secret  ” (Amos Beimel, Mike Burmester, Yvo Desmedt, and Eyal Kushilevitz ;SIAM J. Discrete Math. 13 324 (2000)  )
• “(t,m) THRESHOLD AND GENERALIZED ID-BASED CONFERENCE KEY DISTRIBUTION SYSTEM” (Chih-Hung Wang; Tzonelih Hwang ; Cryptologia, 1558-1586, Volume 24, Issue 2, 2000, Pages 148 – 159 )

 2001

• “On the practical secret sharing scheme ” (Ogata W; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E84A   Issue: 1   Pages: 256-261/January 2001)
• “An analytic construction of the visual secret sharing scheme for color images ” (Koga H, Iwamoto M, Yamamoto H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E84A  Issue: 1   Pages: 262-272/January 2001)
• “Secret sharing schemes with cheating detection ” (Horng G; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E84A   Issue: 3   Pages: 845-850 /March 2001)
• “Improvement on the cheater identifiable threshold scheme ” (Kuwakado H, Tanaka H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E84A   Issue: 4   Pages: 957-960/April 2001)
• “On the Composition of Matroids and Ideal Secret Sharing Schemes” (Siaw-Lynn Ng and Michael Walker; Designs, Codes and Cryptography; Volume 24, Number 1/ September, 2001)
• “Secret sharing and visual cryptography schemes ” (Sec ’01: Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge Pages: 123 – 137)

 2002

• “New constructions of the lattice-based visual secret sharing scheme using mixture of colors ” (Ishihara T, Koga H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E85A  Issue: 1   Pages: 158-166/January 2002)
• “Secret Sharing Schemes with Detection of Cheaters for a General Access Structure” (Sergio Cabello, Carles Padró and Germán Sáez; Designs, Codes and Cryptography; Volume 25, Number 2 / February, 2002)
• “A simple approach to secretly sharing a factoring witness in a publicly-verifiable manner ” (Fujisaki E; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E85A   Issue: 5   Pages:1041-1049/May 2002)
• “Polynomial representation of a visual secret sharing scheme and its application” (Kuwakado H, Tanaka H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E85A  Issue: 6   Pages: 1379-1386 /June 2002)
• “Lower bounds on the information rate of secret sharing schemes with homogeneous access structure“(Padro C, Saez G;INFORMATION PROCESSING LETTERS   Volume: 83   Issue: 6   Pages: 345-351/September 2002)
• “The optimal n-out-of-n visual secret sharing scheme for gray-scale images ” (Iwamoto M, Yamamoto H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E85A   Issue: 10   Pages:2238-2247/October 2002)
• “Asynchronous verifiable secret sharing and proactive cryptosystems ” (Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, Reto Strobl ; CCS ’02: Proceedings of the 9th ACM conference on Computer and communications security Pages: 88 – 97 )

2003

• “A visual secret sharing scheme for color images based on meanvalue-color mixing ” (Ishihara T, Koga H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E86A   Issue: 1   Pages:194-197 /January 2003)
• “Providing Anonymity in Unconditionally Secure Secret Sharing Schemes” (Mida Guillermo, Keith M. Martin and Christine M. O’Keefe; Designs, Codes and Cryptography;     Volume 28, Number 3 / April, 2003)
• “A Representation of a Family of Secret Sharing Matroids” (Siaw-Lynn Ng; Designs, Codes and Cryptography; Volume 30, Number 1 / August, 2003)
• “A tempo-based t-out-of-n audio cryptography scheme ” (Chiou SY, Laih CS; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E86A   Issue: 8   Pages: 2091-2098/August 2003)
• “A construction method of visual secret sharing schemes for plural secret images ” (Iwamoto M, Yamamoto H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E86A  Issue: 10   Pages: 2577-2588/ October 2003)
• “Contrast Optimal Threshold Visual Cryptography Schemes  ” (C. Blundo, P. D’Arco, A. De Santis, and D. R. Stinson ; SIAM J. Discrete Math. 16 224 (2003) )
• “On identification secret sharing schemes” (Cai, N., Lam, K.Y. Information and Computation Volume 184, Issue 2, 1 August 2003, Pages 298-310 )
• “Sharing one secret vs. sharing many secrets” (Di Crescenzo, G. Theoretical Computer Science Volume 295, Issue 1-3, 24 February 2003, Pages 123-140 )

2004

• “A new visual cryptographic scheme using latin squares ” (Adhikari A, Bose M; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E87A   Issue: 5   Pages: 1198-1202 /May 2004 )
• “Efficient secret sharing schemes realizing general access structures ” (Tochikubo K; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E87A   Issue: 7   Pages: 1788-1797/July 2004)
• “A Linear Algebraic Approach to Metering Schemes ” (Carlo Blundo, Sebastià Martín, Barbara Masucci and CarlEs Padró; Designs, Codes and Cryptography; Volume 33, Number 3 / November, 2004)
• “Rational secret sharing and multiparty computation: extended abstract ” (Joseph Halpern, Vanessa Teague; STOC ’04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing Pages: 623 – 632)
• “On cheating immune secret sharing” (Pieprzyk, J., Zhang, X.-M.; Discrete Mathematics and Theoretical Computer Science Volume 6, Issue 2, 2004, Pages 253-264 )
• “Geometrical contributions to secret sharing theory” (Jackson, W.-A., Martin, K.M., O’Keefe, C.M. Journal of Geometry Volume 79, Issue 1-2, 2004, Pages 102-133 )
• “Linear secret sharing schemes and rearrangements of access structures” (Xiao, L.-L., Liu, M.-L. Acta Mathematicae Applicatae Sinica Volume 20, Issue 4, 2004, Pages 685-694 )
• “Characterisations of ideal threshold schemes ” (Pieprzyk, J., Zhang, X.-M. Discrete Mathematics and Theoretical Computer Science Volume 6, Issue 2, 2004, Pages 471-482 )
• “Secret image sharing with steganography and authentication” (Lin, C.-C., Tsai, W.-H. Journal of Systems and Software Volume 73, Issue 3, November 2004, Pages 405-414 )
• “Secret sharing scheme of secure vector space based on quadratic residue ” (Xiao, Q.-H., Ping, L.-D., Pan, X.-Z. Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science) Volume 38, Issue 11, November 2004, Pages 1408-1411+1421 )
• “Secret sharing schemes on sparse homogeneous access structures with rank three” (Martí-Farré, J., Padró, C. Electronic Journal of Combinatorics Volume 11, Issue 1 R, 7 October 2004, Pages 1-16 )
• “Threshold multiple secret sharing scheme” ( Xu, C.-X., Xiao, G.-Z. Tien Tzu Hsueh Pao/Acta Electronica Sinica Volume 32, Issue 10, October 2004, Pages 1688-1689+1687 )
• “Information-theoretical secure verifiable secret sharing on vector space access structures ” (Zhang, F.-T., Shi, J., Wang, Y.-M. Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology Volume 26, Issue 8, August 2004, Pages 1288-1293 )
• “Cheat-proof multi-secret sharing scheme based on factorization” ( Gan, Y.-J., Cao, G. Tiedao Xuebao/Journal of the China Railway Society Volume 26, Issue 4, August 2004, Page 79 )
• “A new visual cryptographic scheme using latin squares” (Adhikari, A., Bose, M. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume E87-A, Issue 5, May 2004, Pages 1198-1202 )
• “Colour image secret sharing” (Lukac, R., Plataniotis, K.N. Electronics Letters Volume 40, Issue 9, 29 April 2004, Pages 529-531 )
• “Randomness in secret sharing and visual cryptography schemes” (De Bonis, A., De Santis, A. Theoretical Computer Science Volume 314, Issue 3, 10 April 2004, Pages 351-374 )
• “A (t,n) multi-secret sharing scheme” (Yang, C.-C., Chang, T.-Y., Hwang, M.-S. Applied Mathematics and Computation Volume 151, Issue 2, 5 April 2004, Pages 483-490 )
• “New combinatorial designs and their applications to authentication codes and secret sharing schemes” ( Ogata, W., Kurosawa, K., Stinson, D.R., Saido, H. Discrete Mathematics Volume 279, Issue 1-3, 28 March 2004, Pages 383-405 )
• “Cheater detectable visual cryptography scheme” (Yan, H., Gan, Z., Chen, K.-F. Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University Volume 38, Issue 1, January 2004, Pages 107-110 )

2005

• “Secret Sharing Schemes with Three or Four Minimal Qualified Subsets” (Jaume Martí-Farré and Carles Padró; Designs, Codes and Cryptography; Volume 34, Number 1             / January, 2005)
• “Efficient secret sharing schemes based on authorized subsets ” (Tochikubo K, Uyematsu T, Matsumoto R; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E88A  Issue: 1   Pages: 322-326/January 2005)
• “Ideal contrast visual cryptography schemes with reversing ” (Cimato S, De Santis A, Ferrara AL, et al.; INFORMATION PROCESSING LETTERS   Volume: 93   Issue: 4   Pages: 199-206/ February 2005 )
• “Automatic repair mechanism of secret sharing storage system ” (Hayashi D, Miyamoto T, Kumagai S; IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   Volume: E88D   Issue: 5   Pages: 971-975/ MAY 2005 )
• “Size-adjustable visual secret sharing schemes ” (Yang CN, Chen TS; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E88A   Issue: 9   Pages: 2471-2474 /September 2005)
• “XOR-based Visual Cryptography Schemes ” (P. Tuyls, H. D. L. Hollmann, J. H. Van Lint and L. Tolhuizen; Designs, Codes and Cryptography; Volume 37, Number 1 / October, 2005)
• “A new multi-stage secret sharing scheme using one-way function ” (Ting-Yi Chang, Min-Shiang Hwang, Wei-Pang Yang ; SIGOPS Operating Systems Review , Volume 39 Issue 1 Pages: 48 – 55 )
• “An approach to enhance inter-provider roaming through secret sharing and its application to WLANs ” (Ulrike Meyer, Jared Cordasco, Susanne Wetzel; WMASH ’05: Proceedings of the 3rd ACM international workshop on Wireless mobile applications and services on WLAN hotspots, Pages: 1 – 13   )

 2006

• “Strongly secure ramp secret sharing schemes for general access structures “(Iwamoto M, Yamamoto H; INFORMATION PROCESSING LETTERS   Volume: 97   Issue: 2   Pages: 52-57 /January 2006 )
• “Cheating in Visual Cryptography” (Gwoboa Horng, Tzungher Chen and Du-shiau Tsai; Designs, Codes and Cryptography; Volume 38, Number 2 / February, 2006)
• “New size-reduced visual secret sharing schemes with half reduction of shadow size ” (Yang CN, Chen TS; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E89A  Issue: 2   Pages: 620-625/February 2006 )
• “Sharing Multiple Secrets: Models, Schemes and Analysis” (Barbara Masucci; Designs, Codes and Cryptography; Volume 39, Number 1 / April, 2006)
• “Visual secret sharing schemes for multiple secret images allowing the rotation of shares ” (Iwamoto M, Wang L, Yoneyama K, et al.;IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume:E89A   Issue: 5   Pages: 1382-1395/May 2006 )
• “Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels” (Hiroki Koga and Etsuyo Ueda; Designs, Codes and Cryptography; Volume 40, Number 1 / July, 2006)
• “A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes” (Mike J. Grannell, Terry S. Griggs and Anne Penfold Street; Designs, Codes and Cryptography; Volume 40, Number 2 / August, 2006)
• “Improved constructions of secret sharing schemes by applying (lambda, omega)-decompositions ” (van Dijk M, Kevenaar T, Schrijen GJ, et al.; INFORMATION PROCESSING LETTERS   Volume: 99   Issue: 4   Pages: 154-157/ August 2006 )
• “Generalised Cumulative Arrays in Secret Sharing” (Shoulun Long, Josef Pieprzyk, Huaxiong Wang and Duncan S. Wong; Designs, Codes and Cryptography; Volume 40, Number 2 / August, 2006)
• “Secret sharing schemes with partial broadcast channels” (Rei Safavi-Naini and Huaxiong Wang; Designs, Codes and Cryptography; Volume 41, Number 1 / October, 2006)
• “Vertical partitioning method for secret sharing distributed database system ” (Miyamoto T, Morita Y, Kumagai S; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E89A  Issue: 11   Pages: 3244-3249 /November 2006)
• “Improved efficiency for revocation schemes via Newton interpolation” (Kogan, N., Tassa, T ;ACM Transactions on Information and System Security Volume 9, Issue 4, 2006, Pages 461-486″
• “Secret sharing scheme with inherited characteristic “( Ye, Z., Meng, F ; Journal of Systems Engineering and Electronics Volume 17, Issue 4, December 2006, Pages 916-918)
• “Chinese remainder theorem-based secret sharing scheme” ( Xi, G.-B., Chen, H.-F., Zhao, W.-D.; Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, Volume 28, Issue 12, December 2006, Pages 2378-2381 )
• “Optimum secret sharing scheme secure against cheating ” ( Ogata, W., Kurosawa, K., Stinson, D.R. ;SIAM Journal on Discrete Mathematics Volume 20, Issue 1, 2006, Pages 79-95 )
• “Linear multi-secret sharing schemes based on multi-party computation” (Liu, M., Xiao, L. , Zhang, Z; Finite Fields and their Applications Volume 12, Issue 4, November 2006, Pages 704-713)
• “Lattice-based threshold-changeability for standard CRT secret-sharing schemes” ( Steinfeld, R., Pieprzyk, J., Wang, H. Finite Fields and their Applications
  Volume 12, Issue 4, November 2006, Pages 653-680)
• “Dynamic threshold secret sharing scheme” ( Huang, D., Wang, H., Huang, L., Dai, Y. ;Qinghua Daxue Xuebao/Journal of Tsinghua University Volume 46, Issue 1, January 2006, Pages 102-105)
• “Secret sharing schemes from three classes of linear codes” (Yuan, J., Ding, C. ;IEEE Transactions on Information Theory Volume 52, Issue 1, January 2006, Pages 206-212)
• “Security Analysis of Authentication of Images Using Recursive Visual Cryptography” (Ching-Nung Yang; Tse-Shih Chen ; Cryptologia, 1558-1586, Volume 32, Issue 2, 2008, Pages 131 – 136 )

2007

• “Optimal multiple assignments based on integer programming in secret sharing schemes with general access structures ” (Iwamoto M, Yamamoto H, Ogawa H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E90A   Issue: 1   Pages: 101-112/January 2007)
• “Hierarchical Threshold Secret Sharing” (Tamir Tassa; Journal of Cryptology; Volume 20, Number 2 / April, 2007)
• “Applications of partially balanced incomplete block designs in developing (2, n) visual cryptographic schemes” (Adhikari A, Bose M, Kumar D, et al.; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E90A   Issue: 5   Pages: 949-951/ May, 2007)
• “A note on secret sharing schemes with three homogeneous access structure ” (Marti-Farre J; INFORMATION PROCESSING LETTERS; Volume: 102 Issue: 4, Pages: 133-137   /MAY 2007)
• “Robust computational secret sharing and a unified account of classical secret-sharing goals ” (Phillip Rogaway, Mihir Bellare ; CCS ’07: Proceedings of the 14th ACM conference on Computer and communications security ,Pages: 172 – 184 )
• “Verifiable multi-secret sharing schemes applicable to arbitrary access structures ” (Zhang, F.-T., Wang, Y.-M.; Tongxin Xuebao/Journal on Communication 28 (11), pp. 58-64)
• “Secret sharing schemes on graphs” (László Csirmaz; Studia Scientiarum Mathematicarum Hungarica, Volume 44, Number 3/September 2007, Pages297-306 )
• “Threshold cryptography based on Asmuth-Bloom secret sharing” (Kamer Kaya, Ali Aydın Selçuk; Information Sciences Volume 177, Issue 19, 1 October 2007, Pages 4148-4160  )
• “New results on non-perfect sharing of multiple secrets” (Alfredo De Santis and Barbara Masucci; Journal of Systems and Software Volume 80, Issue 2, February 2007, Pages 216-223)
• “Dynamic and Verifiable Secret Sharing Among Weighted Participants” (Yanshuo Zhang and Zhuojun Liu; Journal of Systems Science and Complexity, Volume 20, Number 4 /December, 2007, pg- 481-485)

2008

• “A fast (3, n)-threshold secret sharing scheme using Exclusive-OR operations ” (IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 1   Pages: 127-138/January 2008)
• “On increasing the number of users in (t, n) threshold secret sharing schemes ” (Alexandrova T, Morita H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 8   Pages:2138-2150/August 2008)
• “On a fast (k,n)-threshold secret sharing scheme ” (Kurihara J, Kiyomoto S, Fukushima K, et al.; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 9   Pages: 2365-2378/September 2008)
• “Efficient Secret Sharing Schemes Based on Unauthorized Subsets ” (Tochikubo K; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 10   Pages:2860-2867 /October 2008 )
• “Strongly Secure Linear Network Coding “(Harada K, Yamamoto H; IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   Volume: E91A   Issue: 10   Pages: 2720-2728/October 2008)
• “Characterizing Ideal Weighted Threshold Secret Sharing  ” (Amos Beimel, Tamir Tassa, and Enav Weinreb ; SIAM J. Discrete Math. 22 360 (2008) )
• “Mobile proactive secret sharing ” (David A. Schultz, Barbara Liskov, Moses Liskov ; PODC ’08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing Pages 458-458)

 2009

• “Multipartite Secret Sharing by Bivariate Interpolation” (Tamir Tassa and Nira Dyn; Journal of Cryptology; Volume 22, Number 2 / April, 2009)
• “Detection and identification of cheaters in (t, n) secret sharing scheme” (Lein Harn and Changlu Lin; Designs, Codes and Cryptography; Volume 52, Number 1 / July, 2009)
• “Ideal secret sharing schemes whose minimal qualified subsets have at most three participants” (Jaume Martí-Farré and Carles Padró; Designs, Codes and Cryptography; Volume 52, Number 1 / July, 2009)
• “On proper secrets, ( t , k )-bases and linear codes” (Tamir Tassa and Jorge L. Villar; Designs, Codes and Cryptography; Volume 52, Number 2 / August, 2009)
• “An impossibility result on graph secret sharing” (László Csirmaz; Designs, Codes and Cryptography; )
• “A secret sharing scheme based on (t, n) threshold and adversary structure” (Huawang Qin, Yuewei Dai and Zhiquan Wang; International Journal of Information Security; )
• “A (t, n)-fair dynamic threshold secret sharing scheme “, Lin, T.-Y., Wu, T.-C., Lee, C.-I., Wu, T.-S.International ; Journal of Innovative Computing, Information and Control 5 (5), pp. 1395-1406.
• “Hypergraph decomposition and secret sharing” Di Crescenzo, G., Galdi, C; Discrete Applied Mathematics 157 (5), pp. 928-946
• “Weighted threshold secret image sharing” Shyu, S.J., Chuang, C.-C., Chen, Y.-R., Lai, A.-F; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5414 LNCS, pp. 988-998

Conference Article

1999

• “A Conference Key Multicasting Scheme Using Knapsack and Secret Sharing” (Shiuh-Jeng Wang and Jin-Fu Chang; Database and Expert Systems Applications: DEXA’99; Springer LNCS, Volume 1677/1999, 813 )
• “A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting” (Berry Schoenmakers; Advances in Cryptology — CRYPTO’ 99; Springer LNCS, Volume 1666/1999, 784 )
• “Changing Thresholds in the Absence of Secure Channels” (Keith M. Martin, Josef Pieprzyk, Rei Safavi-Naini and Huaxiong Wang; Information Security and Privacy:ACISP’99; Springer LNCS, Volume 1587/1999, 177-191)
• “Conference Key Agreement from Secret Sharing” (Chih-Hung Li and Josef Pieprzyk ;Information Security and Privacy:ACISP’99; Springer LNCS, Volume 1587/1999, 64-76)
• “Efficient Multiparty Computations Secure Against an Adaptive Adversary” (Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt and Tal Rabin ;Advances in Cryptology — EUROCRYPT ’99 ;Springer LNCS, Volume 1592/1999,311-326)
• “Formal Verification of Secret Sharing Protocol Using Coq” (Kok Meng Yew, M. Zahidur Rahman and Sai Peck Lee ;Advances in Computing Science — ASIAN’99 ;Springer LNCS, Volume 1742/1999, 790)
• “Secret sharing schemes with detection of cheaters for a general access structure” (Sergio Cabello, Carles Padró and Germán Sáez ;Fundamentals of Computation Theory:FCT’99; Springer LNCS, Volume 1684/1999, 828)
• “Introduction to Secure Computation” (Ronald Cramer ;Lectures on Data Security: Modern Cryptology in Theory and Practice; Springer LNCS, Volume 1561/1999; 16-62)
• “A New Approach to Efficient Verifiable Secret Sharing for Threshold KCDSA Signature” (Ho-Sun Yoon and Heung-Youl Youm ;Information Security and Cryptology – ICISC’99; Springer LNCS, Volume 1787/2000, 208-220)
• “Verifiable Secret Sharing and Time Capsules” (Josef Pieprzyk and Eiji Okamoto ;Information Security and Cryptology – ICISC’99 ;Springer LNCS, Volume 1787/2000,169-183)
• “Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery” (Fabrice Boudot and Jacques Traoré ;Information and Communication Security -ICICS’99,Springer LNCS,  Volume 1726/2004, 87-102)
• “Linear Secret Sharing with Divisible Shares” (Josef Pieprzyk ;Information and Communication Security -ICICS’99, Springer LNCS, Volume 1726/2004, 71-86)

2000

• “Cheating Prevention in Secret Sharing” (Hossein Ghodosi and Josef Pieprzyk ; Information Security and Privacy :ACISP 2000; Springer LNCS, Volume 1841/2000, 328-341)
• “Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography” (Matthias Krause and Hans Ulrich Simon ;LATIN 2000: Theoretical Informatics: 4th Latin American Symposium Proceedings ,Springer LNCS, Volume 1776/2000,280-291)
• “General Secure Multi-party Computation from any Linear Secret-Sharing Scheme” (Ronald Cramer, Ivan Damgård and Ueli Maurer ;Advances in Cryptology — EUROCRYPT 2000 ;Springer LNCS, Volume 1807/2000,316-334)
• “On Multiplicative Secret Sharing Schemes” (Huaxiong Wang, Kwok Yan Lam, Guo-Zhen Xiao and Huanhui Zhao ; Information Security and Privacy :ACISP 2000;Springer LNCS, Volume 1841/2000,342-351)
• “Light Weight Broadcast Exclusion Using Secret Sharing” (Natsume Matsuzaki, Jun Anzai and Tsutomu Matsumoto ;Information Security and Privacy :ACISP 2000; Springer LNCS ,Volume 1841/2000,313-327)
• “Provably Secure Metering Scheme” (Wakaha Ogata and Kaoru Kurosawa ;Advances in Cryptology — ASIACRYPT 2000 ;Springer LNCS, Volume 1976/2000, 388-398)
• “Sharing Block Ciphers” (Ernie Brickell, Giovanni Di Crescenzo and Yair Frankel ;Information Security and Privacy :ACISP 2000; Springer LNCS, Volume 1841/2000,457-470)
• “Mix and Match: Secure Function Evaluation via Ciphertexts” (Markus Jakobsson and Ari Juels ;Advances in Cryptology —ASIACRYPT 2000 ;Springer LNCS, Volume 1976/2000, 162-177)
• “Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures” (Douglas R. Stinson and R. Wei ;Selected Areas in Cryptography :SAC’99;Springer LNCS, Volume 1758/2000, 200-214)
• “Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation” (K. Srinathan and C. Pandu Rangan ;Progress in Cryptology —INDOCRYPT 2000 ;Springer LNCS, Volume 1977/2000,181-215)
• “Certificates of Recoverability with Scalable Recovery Agent Security” (Eric R. Verheul ;Public Key Cryptography-PKC 2000, Springer LNCS, Volume 1751/2004, 258-275)
• “On Symmetrically Private Information Retrieval ” (Sanjeev Kumar Mishra ; Cryptology ePrint 2000/041)
• “On the Complexity of Verifiable Secret Sharing and Multi-Party Computation ” (Ronald Cramer and Ivan Damg{\aa}rd and Stefan Dziembowski ;Cryptology ePrint 2000/038)
• “General Secure Multi-Party Computation from any Linear Secret Sharing Scheme ” (Ronald Cramer and Ivan Damg{\aa}rd and Ueli Maurer ; Cryptology ePrint 2000/037 )

 2001

• “A Generalized Secret Image Sharing and Recovery Scheme” (Chwei-Shyong Tsai and Chin-Chen Chang ;Advances in Multimedia Information Processing — PCM 2001 ;Springer LNCS, Volume 2195/2001,963-968)
• “A PVSS as Hard as Discrete Log and Shareholder Separability” (Adam Young and Moti Yung ;Public Key Cryptography :PKC 2001;Springer LNCS, Volume 1992/2001,287-299)
• “Cheating Immune Secret Sharing” (Xian-Mo Zhang and Josef Pieprzyk ;Information and Communications Security :ICICS 2001 ;Springer LNCS, Volume 2229/2001, 144-149)
• “Cheating Prevention in Secret Sharing over GF ( p ^t)” (Josef Pieprzyk and Zhang Xian-Mo ;Progress in Cryptology —INDOCRYPT 2001 ;Springer LNCS, Volume 2247/2001,79-90)
• “On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase” (Ronald Cramer, Ivan Damgård and Serge Fehr ; Advances in Cryptology — CRYPTO 2001 ;Springer LNCS, Volume 2139/2001,503-523)
• “Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio” (Giovanni Di Crescenzo ;Mathematical Foundations of Computer Science 2001 :MFCS 2001 ;Springer LNCS,  Volume 2136/2001,292-304)
• “Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group” (Brian King ;Information Security and Privacy :ACISP 2001 ;Springer LNCS, Volume 2119/2001,376-391)
• “Robust Forward-Secure Signature Schemes with Proactive Security” (Wen-Guey Tzeng and Zhi-Jia Tzeng ;Public Key Cryptography :PKC 2001 ;Springer LNCS, Volume 1992/2001,264-276 )
• “Forward-Secure Threshold Signature Schemes” (Michel Abdalla, Sara Miner and Chanathip Namprempre ;Topics in Cryptology— CT-RSA 2001 ;Springer LNCS, Volume 2020/2001,441-456)
• “Generalized Zig-zag Functions and Oblivious Transfer Reductions” (Paolo D’Arco and Douglas Stinson ;Selected Areas in Cryptography: SAC 2001 ; Springer LNCS, Volume 2259/2001, 87-102)
• “A Linear Algebraic Approach to Metering Schemes ” (C. Blundo and S. Martìn and B. Masucci and C. Padrò Cryptology ePrint 2001/087 )
• “On the Power of Nonlinear Secret-Sharing ” (Amos Beimel and Yuval Ishai ;Cryptology ePrint 2001/030)
• “On perfect secret sharing schemes and coalitional game forms ” (Stefano Vannucci ; Theoretical Aspects Of Rationality And Knowledge archive Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge; Pages: 183 – 192)

 2002

• “A General Formula of the ( t, n )-Threshold Visual Secret Sharing Scheme “　(Hiroki Koga ;Advances in Cryptology —ASIACRYPT 2002 ;Springer LNCS, Volume 2501/2002, 847-855)
• “A Distributed and Computationally Secure Key Distribution Scheme” (Vanesa Daza, Javier Herranz, Carles Padró and Germán S’aez ; Information Security :ISC 2002 ;Springer LNCS, Volume 2433/2002,342-356)
• “Cheating Prevention in Linear Secret Sharing” (Josef Pieprzyk and Xian-Mo Zhang ;Information Security and Privacy :ACISP 2002; Springer LNCS, Volume 2384/2002,148-156)
• “Constructions of Cheating Immune Secret Sharing” (Josef Pieprzyk and Zhang Xian-Mo ;Information Security and Cryptology —ICISC 2001 ;Springer LNCS, Volume 2288/2002, 159-204)
• “Efficient 1-Out-n Oblivious Transfer Schemes” (Wen-Guey Tzeng ;Public Key Cryptography :PKC 2002, Springer LNCS, Volume 2274/2002,359-362 )
• “Ideal Threshold Schemes from Orthogonal Arrays” (Josef Pieprzyk and Xiam-Mo Zhang ;Information and Communications Security :ICICS 2002 ;Springer LNCS,  Volume 2513/2002, 469-479)
• “Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks” (Fehr Serge and Maurer Ueli ;Advances in Cryptology — CRYPTO 2002 ,Springer LNCS, Volume 2442/2002, 201-219)
• “Non-perfect Secret Sharing over General Access Structures” (K. Srinathan, N. Tharani Rajan and C. Pandu Rangan ;Progress in Cryptology — INDOCRYPT 2002 ;Springer LNCS, Volume 2551/2002, 409-421)
• “Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments” (Masayuki Abe, Ronald Cramer and Serge Fehr ;Advances in Cryptology — ASIACRYPT 2002 ;Springer LNCS,  Volume 2501/2002, 206-224 )
• “On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure” (Ventzislav Nikov, Svetla Nikova, Bart Preneel and Joos Vandewalle ;Progress in Cryptology —INDOCRYPT 2002 ;Springer LNCS, Volume 2551/2002, 422-435)
• “On Unconditionally Secure Robust Distributed Key Distribution Centers” (Paolo D’Arco and Douglas R. Stinson ;Advances in Cryptology — ASIACRYPT 2002 ;Springer LNCS,  Volume 2501/2002, 181-189)
• “Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups” (Ronald Cramer and Serge Fehr ;Advances in Cryptology —CRYPTO 2002 ;Springer LNCS, Volume 2442/2002, 272-287)
• “Requirements for Group Independent Linear Threshold Secret Sharing Schemes” (Brian King ; Information Security and Privacy-ACISP 2002; Springer LNCS, Volume 2384/2002, 143-186  )
• “Trading Players for Efficiency in Unconditional Multiparty Computation” (B. Prabhu, K. Srinathan and C. Pandu Rangan ;Security in Communication Networks -SCN 2002 ; Springer LNCS, Volume 2576/2003, 342-353)
• “An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes ” (H.D.L. Hollmann, J.H.v. Lint, L. Tolhuizen, P. Tuyls ;Cryptology ePrint  2002/195 )
• “A polarisation based Visual Crypto System and its Secret Sharing Schemes ” (P. Tuyls, H.D.L. Hollmann, J.H.v. Lint, L. Tolhuizen ; Cryptology ePrint  2002/194 )
• “A Note on Ideal Tripartite Access Structures ” (Michael J. Collins ; 2002/193)
• “Applying General Access Structure to Proactive Secret Sharing Schemes ” (Ventzislav Nikov and Svetla Nikova and Bart Preneel and Joos Vandewalle ; Cryptology ePrint  2002/141)
• “Secret sharing schemes on access structures with intersection number equal to one ” (Jaume Marti-Farre and Carles Padro ;Cryptology ePrint  2002/106)
• “Applying General Access Structure to Metering Schemes ” (Ventzislav Nikov and Svetla Nikova and Bart Preneel and Joos Vandewalle ; Cryptology ePrint   2002/102 )
• “A Distributed and Computationally Secure Key Distribution Scheme ” (Vanesa Daza and Javier Herranz and Carles Padr ‘o and Germ\’an S ‘aez ;Cryptology ePrint  2002/069  )
• “Fully Distributed Proxy Signature Schemes “(Javier Herranz and Germ ‘an S ‘aez ; Cryptology ePrint  2002/051 )
• “Secret sharing schemes with three or four minimal qualified subsets ” (Jaume Martí-Farré and Carles Padró ; Cryptology ePrint  2002/050)
• “Partial Key Escrow Monitoring Scheme ” (Jiang Shaoquan and Zhang Yufeng ; 2002/039)
• “A Distributed RSA Signature Scheme for General Access Structures ” (Javier Herranz and Carles Padr\’o and Germ\’an S\’aez ; Cryptology ePrint  2002/038 )
• “Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups ” (Ronald Cramer and Serge Fehr ; Cryptology ePrint  2002/036 )

 2003

• “A Comment on Group Independent Threshold Sharing” (Brian King ; Information Security Applications ;Springer LNCS, Volume 2908/2003, 347-358)
• “A Secret Sharing Scheme Using Matrices” (Candelaria Hernández-Goya, Pino Caballero-Gil and Carlos Bruno-Castañeda ;Computational Science and Its Applications — ICCSA 2003 ;Springer LNCS, Volume 2669/2003, 986)
• “A Method for Sending Confidential Messages to a Group without Trusted Parties” (Ren-Junn Hwang and Chin-Chen Chang ;Parallel and Distributed Processing and Applications -ISPA 2003 ;Springer LNCS, Volume 2745/2003, 207-221)
• “A Signcryption Scheme Based on Secret Sharing Technique” (Mohamed Al-Ibrahim ;Computer Network Security -MMM-ACNS 2003; Springer LNCS, Volume 2776/2003, 279-288 )
• “Constructing General Dynamic Group Key Distribution Schemes with Decentralized User Join” (Vanesa Daza, Javier Herranz and Germán Sáez ;Information Security and Privacy -ACISP 2003 ;Springer LNCS, Volume 2727/2003, 217)
• “Computation of Cryptographic Keys from Face Biometrics” (Alwyn Goh and David C.L. Ngo ;Communications and Multimedia Security; Springer LNCS, Volume 2828/2003 ,1-13)
• “Covering and Secret Sharing with Linear Codes” (Cunsheng Ding and Jin Yuan ;Discrete Mathematics and Theoretical Computer Science -DMTCS 2003 ;Springer LNCS, Volume 2731/2003, 11-25)
• “Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes” (Yvo Desmedt, Kaoru Kurosawa and Tri Van Le ; Information Security -ISC 2003;Springer LNCS, Volume 2851/2003 ,396-407)
• “Hypergraph Decomposition and Secret Sharing” (Giovanni Di Crescenzo and Clemente Galdi ; Algorithms and Computation ;Springer LNCS, Volume 2906/2003, 645-654)
• “ID-Based Distributed “Magic Ink” Signature from Pairings” (Yan Xie, Fangguo Zhang, Xiaofeng Chen and Kwangjo Kim ;Information and Communications Security ;Springer LNCS, Volume 2836/2003, 249-259)
• “Ideal Threshold Schemes from MDS Codes” (Josef Pieprzyk and Xian-Mo Zhang ; Information Security and Cryptology — ICISC 2002 ;Springer LNCS, Volume 2587/2003, 253-263)
• “Multi-party Computation from Any Linear Secret Sharing Scheme Unconditionally Secure against Adaptive Adversary: The Zero-Error Case” (Ventzislav Nikov, Svetla Nikova and Bart Preneel ; Applied Cryptography and Network Security ;Springer LNCS, Volume 2846/2003, 1-15)
• “On Multiplicative Linear Secret Sharing Schemes” (Ventzislav Nikov, Svetla Nikova and Bart Preneel ; Progress in Cryptology – INDOCRYPT 2003 ;Springer LNCS,  Volume 2904/2003, 88-92)
• “On the Power of Computational Secret Sharing” (V. Vinod, Arvind Narayanan, K. Srinathan, C. Pandu Rangan and Kwangjo Kim ; Progress in Cryptology – INDOCRYPT 2003 ;Springer LNCS,  Volume 2904/2003, 265-293)
• “Redistribution of Mechanical Secret Shares” (Yvo Desmedt, Rei Safavi-Naini and Huaxiong Wang ; Financial Cryptography -FC 2002 ;Springer LNCS,  Volume 2357/2003, 238-252)
• “PLI: A New Framework to Protect Digital Content for P2P Networks” (Guofei Gu, Bin B. Zhu, Shipeng Li and Shiyong Zhang ;Applied Cryptography and Network Security ;Springer LNCS,  Volume 2846/2003, 206-216)
• “Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem” (Rui Zhang and Hideki Imai ;Applied Cryptography and Network Security ;Springer LNCS, Volume 2846/2003, 96-110)
• “Secret Sharing Schemes on Access Structures with Intersection Number Equal to One” (Jaume Martí-Farré and Carles Padró ; Security in Communication Networks -SCN 2002 ;Springer LNCS, Volume 2576/2003 ,354-363)
• “Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing” (Koutarou Suzuki and Makoto Yokoo ;Financial Cryptography -FC 2002 ;Springer LNCS, Volume 2357/2003, 44-56)
• “Threshold MACs” (Keith M. Martin, Josef Pieprzyk, Rei Safavi-Naini, Huaxiong Wang and Peter R. Wild ;Information Security and Cryptology — ICISC 2002 ;Springer LNCS,  Volume 2587/2003, 237-252)
• “Verifiable Secret Sharing for General Access Structures, with Application to Fully Distributed Proxy Signatures” (Javier Herranz and Germán Sáez ;Financial Cryptography ;Springer LNCS, Volume 2742, 286-302)
• “Group Oriented Cryptosystems Based on Linear Access Structures” (Wen Ping Ma and Moon Ho Lee ;Information Security and Cryptology -ICISC 2003 ;Springer LNCS, Volume 2971/2004, 370-376)
• “Public Watermark Detection Using Multiple Proxies and Secret Sharing” (Qiming Li and Ee-Chien Chang ;Digital Watermarking -IWDW 2003; Springer LNCS, Volume 2939/2004, 343-346 )
• “Secure Sessions from Weak Secrets” (Bruce Christianson, Michael Roe and David Wheeler ; Security Protocols -11th International Workshop; Springer LNCS, Volume 3364/2005, 190-205)
• “A Verifiable Secret Sharing Scheme with Statistical zero-knowledge ” (Chunming Tang and Zhuojun Liu and Mingsheng Wang ; Cryptology ePrint  2003/222)
• “On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes ” (Ventzislav Nikov and Svetla Nikova ;Cryptology ePrint  2003/210 )
• “Secret sharing schemes on sparse homogeneous access structures with rank three ” (Jaume Martí-Farré and Carles Padró ; Cryptology ePrint  2003/151 )
• “Secure Multiplication of Shared Secrets in the Exponent ” (Mario Di Raimondo and Rosario Gennaro ;Cryptology ePrint   2003/057 )
• “Compounding Secret Sharing Schemes ” (E. Martinez-Moro, J. Mozo-Fernandez, C. Munuera ;Cryptology ePrint   2003/048 )
• “On alternative approach for verifiable secret sharing ” (Kamil Kulesza and Zbigniew Kotulski and Josef Pieprzyk ; Cryptology ePrint  2003/035)
• “Multi-Party Computation from any Linear Secret Sharing Scheme Secure against Adaptive Adversary: The Zero-Error Case ” (Ventzislav Nikov, Svetla Nikova, Bart Preneel ; Cryptology ePrint  2003/006)
• “On fail-stop verifiable secret sharing schemes” (Susilo, W., Mu, Y. Proceedings of the International Conference on Security and Management Volume 2, 2003, Pages 663-667 )
• “Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions ” (Van Dijk, M., Kevenaar, T, Schrijen, G.-J., Tuyls, P. IEEE International Symposium on Information Theory – Proceedings 2003, Page 282 )

 2004

• “A { k, n}-Secret Sharing Scheme for Color Images” (Rastislav Lukac, Konstantinos N. Plataniotis and Anastasios N. Venetsanopoulos ; Computational Science – ICCS 2004 ;Springer LNCS, Volume 3039/2004, 72-79)
• “A Pair-Wise Key Agreement Scheme in Ad Hoc Networks” (Woosuck Cha, Gicheol Wang and Gihwan Cho ;Computational Science – ICCS 2004 ; Springer LNCS, Volume 3036/2004, 648-651)
• “A Quick Group Key Distribution Scheme with “Entity Revocation” (Jun Anzai, Natsume Matsuzaki and Tsutomu Matsumoto ;Advances in Cryptology – ASIACRYPT’99 ;Springer LNCS, Volume 1716/2004, 333-347)
• “A New Chameleon Multi-signature Based on Bilinear Pairing” (Chunbo Ma and Dake He ;Grid and Cooperative Computing – GCC 2004Workshops ;Springer LNCS, Volume 3252/2004, 329-334)
• “Broadcast Enforced Threshold Schemes with Disenrollment” (Mingyan Li and Radha Poovendran ;Selected Areas in Cryptography ;Springer LNCS, Volume 3006/2004, 101-116)
• “Asynchronous Proactive Cryptosystems Without Agreement” (Bartosz Przydatek and Reto Strobl ; Advances in Cryptology – ASIACRYPT 2004 ;Springer LNCS, Volume 3329/2004, 152-169)
• “Constant Round Authenticated Group Key Agreement via Distributed Computation” (Emmanuel Bresson and Dario Catalano ;Public Key Cryptography – PKC 2004 ;Springer LNCS, Volume 2947/2004, 115-129)
• “Hierarchical Threshold Secret Sharing” (Tamir Tassa ;Theory of Cryptography-TCC 2004 ;Springer LNCS, Volume 2951/2004, 473-490 )
• “Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes” (Ron Steinfeld, Huaxiong Wang and Josef Pieprzyk ;Advances in Cryptology – ASIACRYPT 2004 ;Springer LNCS, Volume 3329/2004, 170-186 )
• “Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty” (Rida A. Bazzi and Goran Konjevod ; Distributed Computing -DISC 2004; Springer LNCS,Volume 3274/2004, 420-434)
• “Multiparty Key Agreement Protocol with Cheater Identification Based on Shamir Secret Sharing” (Kee-Young Yoo, Eun-Kyung Ryu and Jae-Yuel Im ;Computational Science and Its Applications – ICCSA 2004 ;Springer LNCS, Volume 3046/2004, 655-664)
• “Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups” (Joseph K. Liu, Victor K. Wei and Duncan S. Wong ; Information Security and Privacy -ACISP 2004; Springer LNCS, Volume 3108/2004, 325-335)
• “Optimistic Fair Exchange Based on Publicly Verifiable Secret Sharing” (Gildas Avoine and Serge Vaudenay ;Information Security and Privacy-ACISP 2004 ; Springer LNCS, Volume 3108/2004, 74-85)
• “Unconditionally Non-interactive Verifiable Secret Sharing Secure against Faulty Majorities in the Commodity Based Model” (Anderson C.A. Nascimento, Joern Mueller-Quade, Akira Otsuka, Goichiro Hanaoka and Hideki Imai ;Applied Cryptography and Network Security -ACNS 2004; Springer LNCS, Volume 3089/2004, 355-368 )
• “Using Secret Sharing for Searching in Encrypted Data” (Richard Brinkman, Jeroen Doumen and Willem Jonker ; Secure Data Management-SDM 2004; Springer LNCS, Volume 3178/2004, 18-27)
• “Mobile Agents: Preserving Privacy and Anonymity” (Aneta Zwierko and Zbigniew Kotulski ; Intelligent Media Technology for Communicative Intelligence -IMTCI 2004; Springer LNCS, Volume 3490/2005, 246-258)
• “Security of Wang-Li Threshold Signature Scheme ” (Lifeng Guo ; Cryptology ePrint 2004/302)
• “Asynchronous Proactive RSA ” (Ruishan Zhang and Kefei Chen ;Cryptology ePrint  2004/292 )
• “New Monotone Span Programs from Old ” (Ventzislav Nikov and Svetla Nikova ; Cryptology ePrint  2004/282)
• “Cryptanalysis of Threshold-Multisignature schemes ” (Lifeng Guo ; Cryptology ePrint  2004/273)
• “Cryptanalysis of Threshold-Multisignature Schemes ” (Lifeng Guo ; Cryptology ePrint  2004/269 )
• “On codes, matroids and secure multi-party computation from linear secret sharing schemes ” (Ronald Cramer and Vanesa Daza and Ignacio Gracia and Jorge Jimenez Urroz and Gregor Leander and Jaume Marti-Farre and Carles Padro ;  Cryptology ePrint  2004/245 )
• “On the security of some nonrepudiable threshold proxy signature schemes with known signers ” (Zuo-Wen Tan and Zhuo-Jun Liu ; Cryptology ePrint  2004/234)
• “On Cheating Immune Secret Sharing ” (An Braeken, Svetla Nikova, Ventzislav Nikov ; Cryptology ePrint  2004/200 )
• “Optimal Updating of Ideal Threshold Schemes ” (S. G. Barwick and W.-A. Jackson and K. M. Martin and C. M. O’Keefe ; Cryptology ePrint   2004/178)
• “Updating the Parameters of a Threshold Scheme by Minimal Broadcast ” (S. G. Barwick and W.-A. Jackson and K. M. Martin ; Cryptology ePrint  2004/177 )
• “RDS: Remote Distributed Scheme for Protecting Mobile Agents ” (Asnat Dadon-Elichai ;Cryptology ePrint  2004/023)
• “An efficient construction of secret sharing for generalized adversary structure and its reduction ” (Guo, Y.-B., Shi, T.-J., Ma, J.-F. 2004 International Conference on Communications, Circuits and Systems Volume 1, 2004, Pages 6-10 )
• “Secret sharing with access structures in a hierarchy ” (Chang, C.-C., Lin, C.-H., Lee, W., Hwang, P.-C. Proceedings – International Conference on Advanced Information Networking and Application (AINA) Volume 2, 2004, Pages 31-34 )

 2005

• “A New (t, n)-Threshold Multi-secret Sharing Scheme” (HuiXian Li, ChunTian Cheng and LiaoJun Pang ; Computational Intelligence and Security -CIS 2005; Springer LNCS, Volume 3802/2005, 421-426)
• “A Cost-Effective Private-Key Cryptosystem for Color Image Encryption” (Rastislav Lukac and Konstantinos N. Plataniotis ; Computational Science – ICCS 2005 ;Springer LNCS, Volume 3514/2005, 679-686)
• “A New Black and White Visual Cryptographic Scheme for General Access Structures” (Avishek Adhikari, Tridib Kumar Dutta and Bimal Roy ;Progress in Cryptology – INDOCRYPT 2004 ; Springer LNCS, Volume 3348/2005, 399-413)
• “A New Secret Sharing Scheme for Images Based on Additive 2-Dimensional Cellular Automata” (Gonzalo Álvarez Marañón, Luis Hernández Encinas and Ángel Martín del Rey ;Pattern Recognition and Image Analysis -IbPRIA 2005; Springer LNCS, Volume 3522/2005, 411-418)
• “A Secure and Efficient (t, n) Threshold Verifiable Multi-secret Sharing Scheme” (Mei-juan Huang, Jian-zhong Zhang and Shu-cui Xie ; Computational Intelligence and Security -CIS 2005; Springer LNCS, Volume 3802/2005, 532-537 )
• “A Robust Coalition-Resistant Threshold Signature Scheme with Anonymous Signers” (Ming-wen Wang, Qing-xin Zhu and Li Qing ; Parallel and Distributed Processing and Applications – ISPA 2005 Workshops ;Springer LNCS, Volume 3759/2005, 315-322)
• “A Robust Double Auction Protocol Based on a Hybrid Trust Model” (JungHoon Ha, Jianying Zhou and SangJae Moon ; Information Systems Security -ICISS 2005;  Springer LNCS, Volume 3803/2005, 77-90)
• “A Scalable Mutual Authentication and Key Distribution Mechanism in a NEMO Environment” (Mihui Kim, Eunah Kim and Kijoon Chae ;Computational Science and Its Applications – ICCSA 2005 ;Springer LNCS, Volume 3480/2005, 591-600)
• “A Verifiable Fingerprint Vault Scheme” (Qiong Li, Xiamu Niu, Zhifang Wang, Yuhua Jiao and Sheng-He Sun ; Knowledge-Based Intelligent Information and Engineering Systems -KES 2005; Springer LNCS, Volume 3683/2005, 1072-1078)
• “A Study on Efficient Key Management in Real Time Wireless Sensor Network” (Sangchul Son, Miyoun Yoon, Kwangkyum Lee and Yongtae Shin ; Mobile Ad-hoc and Sensor Networks -MSN 2005; Springer LNCS,Volume 3794/2005, 745-752)
• “An Improved Multi-stage (t, n)-Threshold Secret Sharing Scheme” (Hui-Xian Li, Chun-Tian Cheng and Liao-Jun Pang ; Advances in Web-Age Information Management -WAIM 2005; Springer LNCS, Volume 3739/2005, 267-274)
• “Addressing New Challenges by Building Security Protocols Around Graphs” (Kamil Kulesza and Zbigniew Kotulski ; Security Protocols-11th International Workshop ;Springer LNCS, Volume 3364/2005, 301-306)
• “All Sail, No Anchor III: Risk Aggregation and Time’s Arrow” (Bob Blakley and G.R. Blakley ; Information Security and Privacy -ACISP 2005; Springer LNCS, Volume 3574/2005, 1-16)
• “Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes” (Claude Crépeau, Daniel Gottesman and Adam Smith ; Advances in Cryptology – EUROCRYPT 2005 ; Springer LNCS, Volume 3494/2005, 285-301)
• “Audio Secret Sharing for 1-Bit Audio” (Ryouichi Nishimura, Norihiro Fujita and Yôiti Suzuki ; Knowledge-Based Intelligent Information and Engineering Systems-KES 2005 ; Springer LNCS, Volume 3682/2005, 1152-1158 )
• “Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields” (Ronald Cramer, Serge Fehr and Martijn Stam ; Ronald Cramer, Serge Fehr and Martijn Stam ; Springer LNCS, 344-360)
• “Characterizing Ideal Weighted Threshold Secret Sharing” (Amos Beimel, Tamir Tassa and Enav Weinreb ; Theory of Cryptography -TCC 2005; Springer LNCS, Volume 3378/2005, 600-619)
• “Classification of Universally Ideal Homomorphic Secret Sharing Schemes and Ideal Black-Box Secret Sharing Schemes” (Zhanfei Zhou ; Information Security and Cryptology -CISC 2005; Springer LNCS, Volume 3822/2005 , 370-383)
• “Cryptographic Protocol Design Concept with Genetic Algorithms” (Kyeongmo Park and Chuleui Hong ; Knowledge-Based Intelligent Information and Engineering Systems- KES 2005; Springer LNCS, Volume 3682/2005, 483-489)
• “Error-Set Codes and Related Objects” (An Braeken, Ventzislav Nikov and Svetla Nikova ; Computing and Combinatorics -COCOON 2005; Springer LNCS, Volume 3595/2005, 577-585)
• “Extended Visual Secret Sharing Schemes with High-Quality Shadow Images Using Gray Sub Pixels” (Ching-Nung Yang and Tse-Shih Chen ; Image Analysis and Recognition -ICIAR 2005; Springer LNCS, Volume 3656/2005, 1184-1191)
• “Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation” (Vladimir Kolesnikov ; Advances in Cryptology – ASIACRYPT 2005 ; Springer LNCS, Volume 3788/2005, 136-155 )
• “New Aspect Ratio Invariant Visual Secret Sharing Schemes Using Square Block-Wise Operation“　(Ching-Nung Yang and Tse-Shih Chen ; Image Analysis and Recognition- ICIAR 2005; Springer LNCS, Volume 3656/2005, 1167-1174 )
• “Multi-proxy Signatures Based on Diffie-Hellman Problems Allowing Repeated Delegations” (So-Young Park and Sang-Ho Lee ;Web and Communication Technologies and Internet-Related Social Issues – HSI 2005 ; Springer LNCS, Volume 3597/2005, 340-344)
• “New Methods to Construct Cheating Immune Multisecret Sharing Scheme” (Wen Ping Ma and Fu Tai Zhang ; Information Security and Cryptology -CISC 2005; Springer LNCS, Volume 3822/2005, 384-394)
• “New Size-Reduced Visual Secret Sharing Schemes with Half Reduction of Shadow Size” (Ching-Nung Yang and Tse-Shih Chen ; Computational Science and Its Applications – ICCSA 2005 ;Springer LNCS, Volume 3480/2005, 19-28 )
• “On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes” (Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré and Carles Padró ; Advances in Cryptology – CRYPTO 2005 ; Springer LNCS, Volume 3621/2005, 327-343)
• “On Proactive Secret Sharing Schemes” (Ventzislav Nikov and Svetla Nikova ; Selected Areas in Cryptography -SAC 2004; Springer LNCS, Volume 3357/2005, 308-325)
• “Optimization of Electronic First-Bid Sealed-Bid Auction Based on Homomorphic Secret Sharing” (Kun Peng, Colin Boyd and Ed Dawson ; Progress in Cryptology – Mycrypt 2005 ;Springer LNCS, Volume 3715/2005, 84-98)
• “On the Size of Monotone Span Programs” (Ventzislav Nikov, Svetla Nikova and Bart Preneel ; Security in Communication Networks -SCN 2004; Springer LNCS, Volume 3352/2005; 249-262 )
• “Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes” (Zhifang Zhang, Mulan Liu and Liangliang Xiao ; Advances in Cryptology – ASIACRYPT 2005 ; Springer LNCS, Volume 3788/2005, 156-173)
• “Perfect Reconstruction of Black Pixels Revisited” (Hans Ulrich Simon ; Fundamentals of Computation Theory -FCT 2005; Springer LNCS, Volume 3623/2005, 221-232)
• “Security Analysis of Three Cryptographic Schemes from Other Cryptographic Schemes” (Sherman S.M. Chow, Zhengjun Cao and Joseph K. Liu ;Information Security and Cryptology -CISC 2005; Springer LNCS, Volume 3822/2005, 290-301)
• “Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation” (Ronald Cramer, Ivan Damgård and Yuval Ishai ; Theory of Cryptography -TCC 2005; Springer LNCS, Volume 3378/2005, 342-362 )
• “Simple Threshold RSA Signature Scheme Based on Simple Secret Sharing” (Shaohua Tang ; Computational Intelligence and Security -CIS 2005; Springer LNCS,  Volume 3802/2005, 186-191)
• “The Role of Secret Sharing in the Distributed MARE Protocols” (Kyeongmo Park ; Computational Science and Its Applications –ICCSA 2005 ; Springer LNCS, Volume 3481/2005, 264-273)
• “Self-configurable Key Pre-distribution in Mobile Ad Hoc Networks” (Claude Castelluccia, Nitesh Saxena and Jeong Hyun Yi ; NETWORKING 2005-4th International IFIP-TC6 Networking Conference; Springer LNCS, Volume 3462/2005, 1083-1095)
• “Self-healing Key Distribution Schemes with Sponsorization” (Germán Sáez ; Communications and Multimedia Security -CMS 2005; Springer LNCS, Volume 3677/2005, 22-31)
• “Self-organized Security Architecture for MANET” (Panneer Pandi Gnana Durai and Ranjani Parthasarathy ; Intelligent Information Technology -CIT 2004; Springer LNCS, Volume 3356/2005, 169-179)
• “Visual Cryptographic Protocols Using the Trusted Initializer” (Hidenori Kuwakado, Masakatu Morii and Hatsukazu Tanaka Information and Communications Security -ICICS 2005; Springer LNCS,  Volume 3783/2005, 112-122)
• “Universally Composable DKG with Linear Number of Exponentiations” (Douglas Wikström ; Security in Communication Networks -SCN 2004; Springer LNCS, Volume 3352/2005, 263-277)
• “An Efficient Fingerprinting Scheme with Secret Sharing” (Seunglim Yong and Sang-Ho Lee ; Digital Rights Management. Technologies, Issues, Challenges and Systems -DRMTICS 2005; Springer LNCS, Volume 3919/2006, 192-202)
• “On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes” (Ventzislav Nikov and Svetla Nikova ; Coding and Cryptography -WCC 2005; Springer LNCS, Volume 3969/2006, 275-290  )
• “Compartmented Secret Sharing Based on the Chinese Remainder Theorem ” (Sorin Iftene ;Cryptology ePrint 2005/408)
• “Representing small identically self-dual matroids by self-dual codes ” (Carles Padro and Ignacio Gracia ; Cryptology ePrint 2005/376 )
• “Secret color images sharing schemes based on XOR operation ” (Dao-Shun Wang, Lei Zhang, Ning Ma and Lian-Sheng Huang ; Cryptology ePrint 2005/372  )
• “Statistical Multiparty Computation Based on Random Walks on Graphs ” (Liangliang Xiao, Mulan Liu, and Zhifang Zhang ; Cryptology ePrint 2005/337)
• “A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment ” (Raylin Tso and Ying Miao and Takeshi Okamoto and Eiji Okamoto ;Cryptology ePrint 2005/239)
• “A Secret Sharing Scheme for Preventing the Cheaters from Acquiring the Secret ” (Hassan Jameel and Sungyoung Lee ; Cryptology ePrint 2005/216 )
• “Secret sharing on the $d$-dimensional cube ” (Laszlo Csirmaz ; 2005/177 )
• “Multiparty Computation Based on Connectivity of Graphs ” (Liangliang Xiao and Mulan Liu and Zhifang Zhang ; Cryptology ePrint 2005/143)
• “How to Split a Shared Secret into Shared Bits in Constant-Round ” (Ivan Damg{\aa}rd and Matthias Fitzi and Jesper Buus Nielsen and Tomas Toft ; Cryptology ePrint 2005/140)
• “Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation ” (Eike Kiltz ; Cryptology ePrint 2005/066 )
• “Secret sharing schemes on graphs ” (Laszlo Csirmaz ; Cryptology ePrint 2005/059 )

 

・2006

• “A Proactive Secret Sharing for Server Assisted Threshold Signatures” (Jong-Phil Yang, Kyung Hyune Rhee and Kouichi Sakurai ; High Performance Computing and Communications -Second International Conference, HPCC 2006; Springer LNCS, Volume 4208/2006, 250-259)
• “A Protocol of Member-Join in a Secret Sharing Scheme” (Xiao Li and Mingxing He ; Information Security Practice and Experience -ISPEC 2006; Springer LNCS, Volume 3903/2006, 134-141)
• “A Novel Key Release Scheme from Biometrics” (Ong Thian Song, Andrew B.J. Teoh and David C.L. Ngo ; Intelligence and Security Informatics -ISI 2006; Springer LNCS, Volume 3975/2006, 764-765)
• “A New Key Management Scheme for Distributed Encrypted Storage Systems” (Myungjin Lee, Hyokyung Bahn and Kijoon Chae ; Computational Science and Its Applications – ICCSA 2006 ;Springer LNCS, Volume 3980/2006, 1072-1079)
• “A Secure and Efficient Secret Sharing Scheme with General Access Structures” (Liao-Jun Pang, Hui-Xian Li and Yu-Min Wang ; Fuzzy Systems and Knowledge Discovery -FSKD 2006; Springer LNCS, Volume 4223/2006, 646-649)
• “A Revocation Scheme Preserving Privacy” (Łukasz Krzywiecki, Przemysław Kubiak and Mirosław Kutyłowski ; Information Security and Cryptology -Inscrypt 2006; Springer LNCS, Volume 4318/2006, 130-143)
• “Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields” (Hao Chen and Ronald Cramer ;Advances in Cryptology – CRYPTO 2006 ; Springer LNCS, Volume 4117/2006, 521-536)
• “Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution” (Satoshi Obana and Toshinori Araki ; Advances in Cryptology – ASIACRYPT 2006 ;Springer LNCS, Volume 4284/2006, 364-379)
• “An Ideal and Robust Threshold RSA” (Hossein Ghodosi and Josef Pieprzyk ;Progress in Cryptology – VIETCRYPT 2006 ;Springer LNCS, Volume 4341/2006, 312-321)
• “Cheating Immune (2,n)-Threshold Visual Secret Sharing” (Roberto De Prisco and Alfredo De Santis ; Security and Cryptography for Networks -SCN 2006;  Springer LNCS, Volume 4116/2006, 216-228)
• “Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme” (Christophe Tartary and Huaxiong Wang ; Information Security and Cryptology -Inscrypt 2006; Springer LNCS, Volume 4318/2006, 103-117)
• “Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants” (Jaume Martí-Farré and Carles Padró ;Security and Cryptography for Networks -SCN 2006; Springer LNCS, Volume 4116/2006, 201-215)
• “Energy-Efficient and Non-interactive Self-certification in MANETs” (Jeong Hyun Yi ;Stabilization, Safety, and Security of Distributed Systems -SSS 2006; Springer LNCS, Volume 4280/2006, 533-547)
• “Linear Integer Secret Sharing and Distributed Exponentiation” (Ivan Damgård and Rune Thorbek ; Public Key Cryptography – PKC 2006 ;Springer LNCS, Volume 3958/2006, 75-90 )
• “Multipartite Secret Sharing by Bivariate Interpolation” (Tamir Tassa and Nira Dyn ; Automata, Languages and Programming -ICALP 2006,Springer LNCS, Volume 4052/2006, 288-299)
• “On Matroids and Non-ideal Secret Sharing” (Amos Beimel and Noam Livne ;Theory of Cryptography – TCC 2006 ;Springer LNCS, Volume 3876/2006, 482-501)
• “Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng” (Yvo Desmedt and Tanja Lange ; Financial Cryptography and Data Security -FC 2006 ; Springer LNCS,  Volume 4107/2006, 154-159)
• “Rational Secret Sharing, Revisited” (S. Dov Gordon and Jonathan Katz ;Security and Cryptography for Networks -SCN 2006; Springer LNCS, Volume 4116/2006, 229-241)
• “Real Perfect Contrast Visual Secret Sharing Schemes with Reversing” (Ching-Nung Yang, Chung-Chun Wang and Tse-Shih Chen ; Applied Cryptography and Network Security -ACNS 2006; Springer LNCS, Volume 3989/2006, 433-447)
• “Round-Optimal and Efficient Verifiable Secret Sharing” (Matthias Fitzi, Juan Garay, Shyamnath Gollakota, C. Pandu Rangan and Kannan Srinathan ; Theory of Cryptography -TCC 2006; Springer LNCS, 329-342)
• “Separating Sources for Encryption and Secret Sharing” (Yevgeniy Dodis, Krzysztof Pietrzak and Bartosz Przydatek ; Theory of Cryptography -TCC 2006; Springer LNCS, Volume 3876/2006, 601-616)
• “Secure Cryptographic Workflow in the Standard Model” (M. Barbosa and P. Farshim ; Progress in Cryptology – INDOCRYPT 2006 ;Springer LNCS, Volume 4329/2006, 379-393)
• “Threshold Cryptography Based on Asmuth-Bloom Secret Sharing” (Kamer Kaya, Ali Aydın Selçuk and Zahir Tezcan ; Computer and Information Sciences – ISCIS 2006 ; Springer LNCS, Volume 4263/2006, 935-942)
• “Threshold Implementations Against Side-Channel Attacks and Glitches” (Kamer Kaya, Ali Aydın Selçuk and Zahir Tezcan ; Information and Communications Security -ICICS 2006; Springer LNCS, Volume 4307/2006, 529-545)
• “Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation” (Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen and Tomas Toft ; Theory of Cryptography -TCC 2006; Springer LNCS, Volume 3876/2006, 285-304)
• “Visual Secret Sharing Scheme: Improving the Contrast of a Recovered Image Via Different Pixel Expansions” (Ching-Nung Yang and Tse-Shih Chen ; Image Analysis and Recognition -ICIAR 2006; Springer LNCS, Volume 4141/2006, 468-479)
• “ID-Based ( t , n ) Threshold Proxy Signcryption for Multi-agent Systems” (Fagen Li, Yupu Hu and Shuanggen Liu ; Computational Intelligence and Security -CIS 2006; Springer LNCS, Volume 4456/2007, 406-416)
• “Secure Cryptographic Workflow in the Standard Model ” (M. Barbosa and P. Farshim ; Cryptology ePrint 2006/450)
• “Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals ” (Mihir Bellare and Phillip Rogaway ; Cryptology ePrint 2006/449)
• “A New family of Ideal Multipartite Access Structure Based on MSP ” (Jun Xu and Jiwen Zeng and Xiaomin Zha ; Cryptology ePrint 2006/339)
• “Visual secret sharing scheme with autostereogram ” (Feng Yi and Daoshun Wang and Yiqi Dai ; Cryptology ePrint 2006/295)
• “Ideal Multipartite Secret Sharing Schemes ” (Oriol Farras and Jaume Marti-Farre and Carles Padro ; Cryptology ePrint 2006/292)
• “On Secret Sharing Schemes, Matroids and Polymatroids ” (Jaume Marti-Farre and Carles Padro ;Cryptology ePrint 2006/077 )
• “New Results on Multipartite Access Structures ” (Javier Herranz and German Saez ; Cryptology ePrint 2006/048)
• “An improved visual cryptography scheme for secret hiding” (Youmaran, R., Adler, A., Miri, A. 23rd Biennial Symposium on Communications ,2006 )
• “Simple multi-secret sharing schemes to achieve the optimal maximum improvement ratio” ( Wang, Y.-C., Juan, J.S.-T; Proceedings – IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing Volume 2006 I, 2006, Article number 1636253, Pages 58-63)
• “An image secret sharing method ” (Bai, L., Biswas, S., Ortiz, A., Dalessandro, D. 2006 9th International Conference on Information Fusion, FUSION 2006, Article number 4086091 )
• “A reliable (k, n) image secret sharing scheme” ( Bai, L; Proceedings – 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2006;  Article number 4030863, Pages 31-36)
• “A novel non-interactive verifiable secret sharing scheme” (Jun, A., Guisheng, L., Chunbo, M. ;International Conference on Communication Technology Proceedings, ICCT; 2006, Article number 4146627 )
• “Proposal of an asymptotically contrast-ideal (t, n)-threshold visual secret sharing scheme” (Koga, H., Ueda, E. ; IEEE International Symposium on Information Theory – Proceedings2006, Article number 4036097, Pages 912-916 )
• “DNA secret sharing “( Adhikari, A; 2006 IEEE Congress on Evolutionary Computation, CEC 2006; Article number 1688473, Pages 1407-1411)
• “Improved secret sharing with access structures in a hierarchy” (Yi, L., Ling, Z., Yumin, W. ;Proceedings of 2006 IEEE Asia-Pacific Conference on Services Computing, APSCC; 2006, Article number 4041206, Pages 18-25)
• “An efficient proactive share refreshing scheme for secret sharing in distributed systems” (Tang, C., Wu, D; GLOBECOM – IEEE Global Telecommunications Conference, 2006, Article number 4150916)
• “Ideal secret sharing schemes with multipartite access structures “( Ng, S.-L; IEE Proceedings: Communications Volume 153, Issue 2, April 2006, Pages 165-168 )

 2007

• “A New ( t , n ) −Threshold Scheme Based on Difference Equations ” (Chao-Wen Chan and Chin-Chen Chang ; Combinatorics, Algorithms, Probabilistic and Experimental Methodologies -ESCAPE 2007; Springer LNCS, Volume 4614/2007, 94-106 )
• “An Optimal Share Transfer Problem on Secret Sharing Storage Systems” (Toshiyuki Miyamoto and Sadatoshi Kumagai ; Parallel and Distributed Processing and Applications -ISPA 2007 ;Springer LNCS, Volume 4742/2007, 371-382)
• “Efficient ( k , n ) Threshold Secret Sharing Schemes Secure Against Cheating from n  − 1 Cheaters” (Toshinori Araki ; Information Security and Privacy -ACISP 2007; Springer LNCS, Volume 4586/2007, 133-142)
• “CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts” (Vanesa Daza, Javier Herranz, Paz Morillo and Carla Ràfols ; Provable Security- ProvSec 2007; Springer LNCS, Volume 4784/2007, 35-50)
• “Atomic Secure Multi-party Multiplication with Low Communication” (Ronald Cramer, Ivan Damgård and Robbert de Haan ; Advances in Cryptology – EUROCRYPT 2007 ;Springer LNCS, Volume 4515/2007, 329-346)
• “Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing” (Selim V. Kaya, Thomas B. Pedersen, Erkay Savaş and Yücel Saygıýn ; Emerging Technologies in Knowledge Discovery and Data Mining -PAKDD 2007 ;Springer LNCS, 280-291)
• “Flaws in Some Secret Sharing Schemes Against Cheating” (Toshinori Araki and Satoshi Obana ; Information Security and Privacy -ACISP 2007; Springer LNCS, Volume 4586/2007, 122-132)
• “Ideal Multipartite Secret Sharing Schemes” (Oriol Farràs, Jaume Martí-Farré and Carles Padró ; Advances in Cryptology – EUROCRYPT 2007 ;Springer LNCS, Volume 4515/2007, 448-465)
• “On Partial Anonymity in Secret Sharing” (Vanesa Daza and Josep Domingo-Ferrer ; Public Key Infrastructure -EuroPKI 2007; Springer LNCS, Volume 4582/2007, 193-202)
• “On Secret Sharing Schemes, Matroids and Polymatroids” (Jaume Martí-Farré and Carles Padró ; Theory of Cryptography -TCC 2007; Springer LNCS, Volume 4392/2007, 273-290)
• “Secret Swarm Unit Reactive k  −Secret Sharing” (Shlomi Dolev, Limor Lahiani and Moti Yung ; Progress in Cryptology –INDOCRYPT 2007 ; Springer LNCS, Volume 4859/2007, 123-137)
• “Secure Computation from Random Error Correcting Codes” (Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan and Vinod Vaikuntanathan ; Advances in Cryptology – EUROCRYPT 2007 ; Springer LNCS, Volume 4515/2007, 291-310)
• “Weakly-Private Secret Sharing Schemes” (Amos Beimel and Matthew Franklin ; Theory of Cryptography -TCC 2007; Springer LNCS, Volume 4392/2007, 253-272)
• “Combiner Driven Management Models and Their Applications” (Michael Beiter ; Research in Cryptology -WEWoRC 2007; Springer LNCS, Volume 4945/2008, 114-126)
• “Key Management Based on Hierarchical Secret Sharing in Ad-Hoc Networks” (Chuangui Ma and Rui Cheng ; Information Security and Cryptology -Inscrypt 2007; Springer LNCS, Volume 4990/2008, 182-191)
• “Multiple Watermarking in Visual Cryptography” (Hao Luo, Zhe-Ming Lu and Jeng-Shyang Pan ; Digital Watermarking -IWDW 2007 ; Springer LNCS, Volume 5041/2008, 60-70)
• “Probabilistic ( n , n ) Visual Secret Sharing Scheme for Grayscale Images” (Daoshun Wang, Xiaobo Li and Feng Yi ; Information Security and Cryptology -Inscrypt 2007;Springer LNCS,  Volume 4990/2008, 192-200 )
• “Fuzzy Private Matching (Extended Abstract) ” ({L}ukasz Chmielewski and Jaap-Henk Hoepman ;Cryptology ePrint 2007/363 )
• “Secret sharing on the infinite ladder ” (Laszlo Csirmaz ; Cryptology ePrint 2007/355)
• “Secret sharing on infinite graphs ” (Laszlo Csirmaz ;  Cryptology ePrint 2007/297)
• “CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts ” (Vanesa Daza and Javier Herranz and Paz Morillo and Carla R`afols ; Cryptology ePrint 2007/127  )
• “A generalization of Secret Sharing Scheme on the Basis of Recovering Algorithm, K-RA ” (Masao KASAHARA ; Cryptology ePrint 2007/106 )
• “Distributed privacy preserving k-means clustering with additive secret sharing ” (Mahir Can Doganay, Thomas B. Pedersen, Yücel Saygin, Erkay Savaş, Albert Levi ;ACM International Conference Proceeding Series; Vol. 331;Proceedings of the 2008 international workshop on Privacy and anonymity in information society table of contents Nantes, France SESSION: Distributed privacy protection and query auditing Pages 3-11 )
• “A New Dynamic Threshold Secret Sharing Scheme from Bilinear Maps“( Chen Wei; Long Xiang; Bai Yuebin; Gao Xiaopeng; Parallel Processing Workshops, 2007. ICPPW 2007. International Conference on 10-14 Sept. 2007 Page(s):19 – 19)
• “Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images” (Miyuki Uno , M. Kano; ISPEC 2007, Springer LNCS, Volume 4464/2007,344-359)
• “A verifiable multi-secret sharing scheme (VMSS)” (Pang, L., Jiao, L., Li, H., Wang, Y.; Proceedings – CIS Workshops 2007, International  Conference on Computational Intelligence and Security Workshops, art. no. 4425603, pp. 749-752)
• “Efficient Multiple Assignment Secret Sharing Schemes” (Tochikubo, Kouya; Information Theory, 2007. ISIT 2007. IEEE International Symposium on 24-29 June 2007 Page:461 – 465)
• “Secure Construction for Nonlinear Function Threshold Ramp Secret Sharing” (Yoshida, Maki; Fujiwara, Toru; Information Theory, 2007. ISIT 2007. IEEE International Symposium on 24-29 June 2007 Page:1041 – 1045)
• “A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP” (Runhua Shi; Hong Zhong; Liusheng Huang; Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on Volume 2, July 30 2007-Aug. 1 2007 Page(s):9 – 13)
• “A Proactive Secure Multisecret Sharing Threshold Scheme” (Feng Li; Jianwei Shang; Daxing Li; Software Engineering, Artificial Intelligence, Networking, and
  Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on Volume 1,  July 30 2007-Aug. 1 2007 Page(s):105 – 110)
• “General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting” (Sorin Iftene; Electronic Notes in Theoretical Computer Science
  Volume 186, 14 July 2007, Pages 67-84 Proceedings of the First Workshop in Information and Computer Security (ICS 2006))
• “A New Multi-secret Sharing Scheme with Multi-policy” (Geng Yong-Jun; Fan Xiao-Hong; Hong Fan; Advanced Communication Technology, The 9th International Conference on Volume 3,  12-14 Feb. 2007 Page(s):1515 – 1517)
• “An ECC based vector space key sharing scheme” (Shichun Pang; Shufen Liu; Pervasive Computing and Applications, 2006 1st International Symposium on
  3-5 Aug. 2006 Page(s):524 – 527)
• “A Light-Weight e-Voting System with Distributed Trust” ( Aneta Zwierko and Zbigniew Kotulski Electronic Notes in Theoretical Computer Science Volume 168, 8 February 2007, Pages 109-126 Proceedings of the Second International Workshop on Views on Designing Complex Architectures (VODCA 2006) )
• “An Unconditionally Secure Multi-round Revocation Scheme Using Secret Sharing” (Ming Yang; TENCON 2005 IEEE Region 10 21-24 Nov. 2005 Page(s):1 – 6 )

2008

• “A Matrix-Based Secret Sharing Scheme for Images” (A. Martín del Rey ; Progress in Pattern Recognition, Image Analysis and Applications -CIARP 2008; Springer LNCS, Volume 5197/2008, 635-642)
• “A New ( k , n )-Threshold Secret Sharing Scheme and Its Extension” (Jun Kurihara, Shinsaku Kiyomoto, Kazuhide Fukushima and Toshiaki Tanaka ; Information Security- ISC 2008; Springer LNCS, Volume 5222/2008, 455-470 )
• “A Secret Sharing Scheme for Digital Images Based on Two-Dimensional Linear Cellular Automata” (Angel Martín del Rey ; Combinatorial Image Analysis -IWCIA 2008; Springer LNCS, Volume 4958/2008, 318-329)
• “A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem” (Kamer Kaya and Ali Aydın Selçuk ; Progress in Cryptology – INDOCRYPT 2008 ; Springer LNCS, Volume 5365/2008, 414-425)
• “Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes” (Tiancheng Lou and Christophe Tartary ; Cryptology and Network Security -CANS 2008; Springer LNCS, Volume 5339/2008, 196-213)
• “Alternative Protocols for Generalized Oblivious Transfer” (Bhavani Shankar, Kannan Srinathan and C. Pandu Rangan  ; Distributed Computing and Networking -ICDCN 2008 ; Springer LNCS, Volume 4904/2008, 304-309)
• “Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors” (Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró and Daniel Wichs ; Advances in Cryptology – EUROCRYPT 2008 ;Springer LNCS, Volume 4965/2008, 471-488 )
• “Cryptography and Game Theory: Designing Protocols for Exchanging Information” (Gillat Kol and Moni Naor ; Theory of Cryptography -TCC 2008; Springer LNCS, Volume 4948/2008; 320-339)
• “How to Publicly Verifiably Expand a Member without Changing Old Shares in a Secret Sharing Scheme” (Jia Yu, Fanyu Kong, Rong Hao and Xuliang Li ; Intelligence and Security Informatics – IEEE ISI 2008 International Workshops: PAISI, PACCF, and SOCO 2008; Springer LNCS, Volume 5075/2008, 138-148)
• “Improved Data Hiding Technique for Shares in Extended Visual Secret Sharing Schemes” (Rabia Sirhindi, Saeed Murtaza and Mehreen Afzal ; Information and Communications Security -ICICS 2008 ; Springer LNCS, Volume 5308/2008, 376-386)
• “Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network” (Travis R. Beals and Barry C. Sanders ; Information Theoretic Security -ICITS 2008; Springer LNCS, Volume 5155/2008, 29-39)
• “Improving the Round Complexity of VSS in Point-to-Point Networks” (Jonathan Katz, Chiu-Yuen Koo and Ranjit Kumaresan ; Automata, Languages and Programming -ICALP 2008; Springer LNCS, Volume 5126/2008, 499-510)
• “Matroids Can Be Far from Ideal Secret Sharing” (Amos Beimel, Noam Livne and Carles Padró ; Theory of Cryptography -TCC 2008; Springer LNCS, Volume 4948/2008, 194-212)
• “On Linear Secret Sharing for Connectivity in Directed Graphs” (Amos Beimel and Anat Paskin ; Security and Cryptography for Networks -SCN 2008; Springer LNCS, Volume 5229/2008, 172-184)
• “Rational Secret Sharing with Repeated Games” (Shaik Maleka, Amjed Shareef and C. Pandu Rangan ; Information Security Practice and Experience -ISPEC 2008 ; Springer LNCS, Volume 4991/2008, 334-346)
• “Revisiting the Karnin, Greene and Hellman Bounds” (Yvo Desmedt, Brian King and Berry Schoenmakers ; Information Theoretic Security -ICITS 2008; Springer LNCS, Volume 5155/2008, 183-198)
• “Robust Threshold Schemes Based on the Chinese Remainder Theorem” (Kamer Kaya and Ali Aydın Selçuk ; Progress in Cryptology – AFRICACRYPT 2008 ;Springer LNCS,  Volume 5023/2008, 94-108)
• “Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes” (Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling and Huaxiong Wang ; Advances in Cryptology – ASIACRYPT 2008 ; Springer LNCS, Volume 5350/2008, 19-36)
• “Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures” (Christophe Tartary, Josef Pieprzyk and Huaxiong Wang ; Information Security and Cryptology -Inscrypt 2007; Springer LNCS, 167-181 )
• “A multi-stage secret sharing scheme with general access structures ” Wei, Y., Zhong, P., Xiong, G ;2008 International Conference on Wireless Communications, Networking
  and Mobile Computing, WiCOM 2008, art. no. 4681128
• “A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem” Kamer Kaya & Ali Aydın Selçuk; Progress in Cryptology – INDOCRYPT 2008, Lecture Notes in Computer Science , Springer- Berlin / Heidelberg, Volume 5365/2008, Pages- 414-425
• “A new (t, n) multi-secret sharing scheme” Tan, X.-Q., Wang, Z.-G.; Proceedings of the 2008 International Conference on Computer and Electrical Engineering, ICCEE 2008, art. no. 4741106, pp. 861-865
• “Dynamic threshold multi-secret sharing scheme using elliptic curve and bilinear maps” Wang, S.-J., Tsai, Y.-R., Shen, J.-J. Proceedings of the 2008 2nd International Conference on Future Generation Communication and Networking, FGCN 2008 2, art. no. 4734246, pp. 405-410
• “A hierarchical threshold multi-secret sharing scheme” Shi, R., Zhong, H.; 2nd International Conference on Anti-counterfeiting, Security and Identification, ASID 2008, art. no. 4688398, pp. 231-234
• “Sure interpolation and its application to hierarchical threshold secret sharing scheme ” Yanshuo, Z., Zhuojun, L., Guifang, H ;Proceedings – International Symposium on Computer Science and Computational Technology, ISCSCT 2008 1, art. no. 4731464, pp. 447-450
• “A new (t, n)-threshold secret sharing scheme” Tang, C., Yao, Z.-A. ;Proceedings – 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008, art. no. 4737091, pp. 920-924
• “A practical publicly verifiable secret sharing scheme based on bilinear pairing” Tian, Y., Peng, C., Zhang, R., Chen, Y; 2nd International Conference on Anti-counterfeiting, Security and Identification, ASID 2008, art. no. 4688348, pp. 71-75;
• “A secret sharing shuffling scheme based on polynomial” Xi Zhang; Lei Zhang; Quan Zhang; Chaojing Tang; Information and Automation, 2008. ICIA 2008. International Conference
  on 20-23 June 2008 Page(s):1746 – 1750
• “A Verifiable (t, n) Multiple Secret Sharing Scheme and Its Analyses” Liaojun Pang; Huixian Li; Ye Yao; Yumin Wang; Electronic Commerce and Security, 2008 International Symposium on 3-5,Aug. 2008 Page(s):22 – 26
• “New schemes for sharing points on an elliptic curve” Duo Liu, a, , Dongping Huanga, Ping Luoa and Yiqi Daia; Computers & Mathematics with Applications
  Volume 56, Issue 6, September 2008, Pages 1556-1561
• “An Efficient (t, n)-Threshold Multi-Secret Sharing Scheme” Shi Runhua; Huang Liusheng; Zhong Hong; Knowledge Discovery and Data Mining, 2008. WKDD 2008. International Workshop on 23-24 Jan. 2008 Page(s):580 – 583
• “Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves” ; Massoud Hadian Dehkordia, and Samaneh Mashhadi, a, Computer Communications Volume 31, Issue 9, 8 June 2008, Pages 1777-1784
• “Access Structures of Elliptic Secret Sharing Schemes” Hao Chen; San Ling; Chaoping Xing; Information Theory, IEEE Transactions on Volume 54,  Issue 2,  Feb. 2008 Page(s):850 – 852
• “A Recursive Threshold Visual Cryptography Scheme ” (Abhishek Parakh and Subhash Kak ; Cryptology ePrint 2008/535 )
• “Extended Access Structures and Their Cryptographic Applications ” (Vanesa Daza and Javier Herranz and Paz Morillo and Carla Rafols ;Cryptology ePrint 2008/502 )
• “Efficient Rational Secret Sharing in the Standard Communication Model ” (Georg Fuchsbauer and Jonathan Katz and Eric Levieil and David Naccache ;Cryptology ePrint 2008/488  )
• “Sharing DSS by the Chinese Remainder Theorem ” (Kamer Kaya and Ali Aydın Selçuk ; Cryptology ePrint 2008/483 )
• “A New $(k,n)$-Threshold Secret Sharing Scheme and Its Extension ” (Jun Kurihara and Shinsaku Kiyomoto and Kazuhide Fukushima and Toshiaki Tanaka ;Cryptology ePrint 2008/409 )
• “Dynamic Threshold Cryptosystem without Group Manager ” (Andreas Noack and Stefan Spitz ;Cryptology ePrint 2008/380 )
• “Using Commutative Encryption to Share a Secret” (Saied Hosseini Khayat ; Cryptology ePrint 2008/356 )
• “The Multireceiver Commitment Schemes ” (Shuhong Wang ; Cryptology ePrint 2008/213 )
• “Restricted Adaptive Oblivious Transfer ” (Javier Herranz ; Cryptology ePrint 2008/182)
• “Fairness with an Honest Minority and a Rational Majority ” (Shien Jin Ong and David Parkes and Alon Rosen and Salil Vadhan ; Cryptology ePrint  2008/097 )
• “Unidirectional Key Distribution Across Time and Space with Applications to RFID Security ” (Ari Juels and Ravikanth Pappu and Bryan Parno ; Cryptology ePrint 2008/044)
• “Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors ” ( Ronald Cramer and Yevgeniy Dodis and Serge Fehr and Carles Padr ‘o and Daniel Wichs ; Cryptology ePrint  2008/030)
• “Disjunctive Multi-Level Secret Sharing ” (Mira Belenkiy ;Cryptology ePrint 2008/018)

 2009

• “A Secret Sharing Scheme for Digital Images Based on Cellular Automata and Boolean Functions” (Ángel Martín del Rey and Gerardo Rodríguez Sánchez ;Bio-Inspired Systems: Computational and Ambient Intelligence -IWANN 2009; Springer LNCS, Volume 5517/2009, 1200-1207)
• “On Non-representable Secret Sharing Matroids” (Qi Cheng, Yong Yin, Kun Xiao and Ching-Fang Hsu ; Information Security Practice and Experience -ISPEC 2009 ; Springer LNCS, Volume 5451/2009, 124-135)
• “Practical Threshold Signatures with Linear Secret Sharing Schemes” (İlker Nadi Bozkurt, Kamer Kaya and Ali Aydın Selçuk ; Progress in Cryptology – AFRICACRYPT 2009 ; Springer LNCS,  Volume 5580/2009, 167-178)
• “An Improved Distributed Key Management Scheme in Wireless Sensor Networks” (Jun Zhou and Mingxing He ; Information Security Applications – WISA 2008; Springer LNCS, Volume 5379/2009, 305-319)
• “Fairness with an Honest Minority and a Rational Majority” (Shien Jin Ong, David C. Parkes, Alon Rosen and Salil Vadhan ; Theory of Cryptography -TCC 2009; Springer LNCS, Volume 5444/2009, 36-53 )
• “Purely Rational Secret Sharing (Extended Abstract)” (Silvio Micali and abhi shelat ; Theory of Cryptography -TCC 2009; Springer LNCS, Volume 5444/2009, 54-71)
• “Secret Sharing and Non-Shannon Information Inequalities” (Amos Beimel and Ilan Orlov ; Theory of Cryptography -TCC 2009; Springer LNCS, Volume 5444/2009, 539-557)
• “Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images” (Miyuki Uno and Mikio Kano ; Information Security and Cryptology – ICISC 2008 ;Springer LNCS, Volume 5461/2009, 84-97)
• “A Probabilistic Secret Sharing Scheme for a Compartmented Access Structure “(Yuyin Yu and Mingsheng Wang ; Cryptology ePrint ,2009/301 )
• “Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data ” (Rafael Dowsley and Jörn Müller-Quade and Akira Otsuka and Goichiro Hanaoka and Hideki Imai and Anderson C. A. Nascimento ;Cryptology ePrint 2009/273 )
• “Dealer-Free Threshold Changeability in Secret Sharing Schemes” (Mehrdad Nojoumian and Douglas R. Stinson ; Cryptology ePrint ,2009/268 )
• “General Error Decodable Secret Sharing Scheme and Its Application ” (Kaoru Kurosawa ;Cryptology ePrint , 2009/263)
• “Unconditionally Secure Social Secret Sharing Scheme “(Mehrdad Nojoumian and Douglas R. Stinson and Morgan Grainger ; Cryptology ePrint 2009/207 )
• “Ideal Hierarchical Secret Sharing Schemes ” (Oriol Farras and Carles Padro ;Cryptology ePrint 2009/141 )
• “Secret sharing on trees: problem solved ” (Laszlo Csirmaz and Gabor Tardos ;Cryptology ePrint 2009/071)
• “Framework for Analyzing Optimistic Fair Exchange with Distributed Arbiters ” (Alptekin Kupcu and Anna Lysyanskaya ;Cryptology ePrint 2009/069 )
• “On the impossibility of graph secret sharing ” (Laszlo Csirmaz ; Cryptology ePrint 2009/059 )

sakurai@csce.kyushu-u.ac.jp