-
Previous Article
Self-dual $\mathbb{F}_q$-linear $\mathbb{F}_{q^t}$-codes with an automorphism of prime order
- AMC Home
- This Issue
-
Next Article
Another look at security definitions
On dealer-free dynamic threshold schemes
1. | Department of Computer Science, Southern Illinois University, Carbondale, IL 62901, United States |
2. | David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada |
Therefore, we first provide the first comprehensive study of threshold modification techniques in both the passive and active adversary models. We first review an existing method for threshold modification based on resharing shares of a secret; this method is secure in the setting of a passive adversarial coalition. We then discuss two methods, termed public evaluation (for threshold reduction) and zero addition (for threshold increase) that can be used in both the passive and active adversarial setting. In the case of an active adversary, the techniques make use of verifiable secret sharing schemes, whereas the schemes considered in the passive adversary model are all based on the Shamir scheme. As an application, we discuss how the threshold and the secret can be changed multiple times to arbitrary values after the scheme's initialization.
References:
[1] |
IEEE Trans. Inform. Theory, 51 (2005), 620-633.
doi: 10.1109/TIT.2004.840857. |
[2] |
in "9th Annual International Cryptology Conference, CRYPTO,'' Springer, (1989), 560-572. Google Scholar |
[3] |
in "20th Annual ACM Symposium on Theory of Computing, STOC,'' (1988), 1-10. Google Scholar |
[4] |
in "CRYPTO,'' (1992), 540-548. |
[5] |
in "National Computer Conference,'' AFIPS Press, (1979), 313-317. Google Scholar |
[6] |
Theoret. Comp. Sci., 165 (1996), 407-440. |
[7] |
in "26th Annual IEEE Symposium on Foundations of Computer Science, FOCS,'' (1985), 383-395. Google Scholar |
[8] |
in "8th Int. Conf. on the Theory and Application of Cryptology and Info. Security, ASIACRYPT,'' Springer, (2002), 346-363. |
[9] |
in "Technical Report ISSE TR-97-01,'' George Mason Univ., 1997. Google Scholar |
[10] |
in "33th Annual ACM Symposium on Theory of Computing, STOC,'' (2001), 580-589. |
[11] |
in "17th annual ACM symposium on Principles of Distributed Computing, PODC,'' (1998), 101-111. Google Scholar |
[12] |
in "15th Annual International Cryptology Conference, CRYPTO,'' Springer, (1995), 339-352. Google Scholar |
[13] |
in "EUROCRYPT'' (I. Damgård), Springer, (1990), 266-282. |
[14] |
J. Cryptology, 10 (1997), 261-289.
doi: 10.1007/s001459900031. |
[15] |
in "6th Australasian Conference Information Security and Privacy, ACISP,'' Springer, (2001), 403-416. Google Scholar |
[16] |
in "Proceedings of IEEE Information Theory Workshop (ITW 2005),'' IEEE, (2005), 61-66. Google Scholar |
[17] |
in "4th Australasian Conference Information Security and Privacy, ACISP,'' Springer, (1999), 177-191. Google Scholar |
[18] |
Computer J., 42 (1999), 638-649. Google Scholar |
[19] |
in "11th International Workshop on Selected Areas in Cryptography, SAC,'' Springer, (2004), 308-325. |
[20] |
IET Inform. Secur., 4 (2010), 202-211.
doi: 10.1049/iet-ifs.2009.0098. |
[21] |
in "21st Annual ACM Symposium on Theory of Computing, STOC,'' (1989), 73-85. Google Scholar |
[22] |
Commun. ACM, 22 (1979), 612-613.
doi: 10.1145/359168.359176. |
[23] |
in "10th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT,'' Springer, (2004), 170-186. |
[24] |
in "6th Annual Int. Workshop on Selected Areas in Cryptography, SAC,'' Springer, (1999), 200-214. |
[25] |
in "2nd SKLOIS Conference on Information Security and Cryptology, Inscrypt,'' Springer, (2006), 103-117.
doi: 10.1007/11937807_9. |
show all references
References:
[1] |
IEEE Trans. Inform. Theory, 51 (2005), 620-633.
doi: 10.1109/TIT.2004.840857. |
[2] |
in "9th Annual International Cryptology Conference, CRYPTO,'' Springer, (1989), 560-572. Google Scholar |
[3] |
in "20th Annual ACM Symposium on Theory of Computing, STOC,'' (1988), 1-10. Google Scholar |
[4] |
in "CRYPTO,'' (1992), 540-548. |
[5] |
in "National Computer Conference,'' AFIPS Press, (1979), 313-317. Google Scholar |
[6] |
Theoret. Comp. Sci., 165 (1996), 407-440. |
[7] |
in "26th Annual IEEE Symposium on Foundations of Computer Science, FOCS,'' (1985), 383-395. Google Scholar |
[8] |
in "8th Int. Conf. on the Theory and Application of Cryptology and Info. Security, ASIACRYPT,'' Springer, (2002), 346-363. |
[9] |
in "Technical Report ISSE TR-97-01,'' George Mason Univ., 1997. Google Scholar |
[10] |
in "33th Annual ACM Symposium on Theory of Computing, STOC,'' (2001), 580-589. |
[11] |
in "17th annual ACM symposium on Principles of Distributed Computing, PODC,'' (1998), 101-111. Google Scholar |
[12] |
in "15th Annual International Cryptology Conference, CRYPTO,'' Springer, (1995), 339-352. Google Scholar |
[13] |
in "EUROCRYPT'' (I. Damgård), Springer, (1990), 266-282. |
[14] |
J. Cryptology, 10 (1997), 261-289.
doi: 10.1007/s001459900031. |
[15] |
in "6th Australasian Conference Information Security and Privacy, ACISP,'' Springer, (2001), 403-416. Google Scholar |
[16] |
in "Proceedings of IEEE Information Theory Workshop (ITW 2005),'' IEEE, (2005), 61-66. Google Scholar |
[17] |
in "4th Australasian Conference Information Security and Privacy, ACISP,'' Springer, (1999), 177-191. Google Scholar |
[18] |
Computer J., 42 (1999), 638-649. Google Scholar |
[19] |
in "11th International Workshop on Selected Areas in Cryptography, SAC,'' Springer, (2004), 308-325. |
[20] |
IET Inform. Secur., 4 (2010), 202-211.
doi: 10.1049/iet-ifs.2009.0098. |
[21] |
in "21st Annual ACM Symposium on Theory of Computing, STOC,'' (1989), 73-85. Google Scholar |
[22] |
Commun. ACM, 22 (1979), 612-613.
doi: 10.1145/359168.359176. |
[23] |
in "10th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT,'' Springer, (2004), 170-186. |
[24] |
in "6th Annual Int. Workshop on Selected Areas in Cryptography, SAC,'' Springer, (1999), 200-214. |
[25] |
in "2nd SKLOIS Conference on Information Security and Cryptology, Inscrypt,'' Springer, (2006), 103-117.
doi: 10.1007/11937807_9. |
[1] |
Juliang Zhang, Jian Chen. Information sharing in a make-to-stock supply chain. Journal of Industrial & Management Optimization, 2014, 10 (4) : 1169-1189. doi: 10.3934/jimo.2014.10.1169 |
[2] |
Palash Sarkar, Subhadip Singha. Verifying solutions to LWE with implications for concrete security. Advances in Mathematics of Communications, 2021, 15 (2) : 257-266. doi: 10.3934/amc.2020057 |
[3] |
Roberto Civino, Riccardo Longo. Formal security proof for a scheme on a topological network. Advances in Mathematics of Communications, 2021 doi: 10.3934/amc.2021009 |
[4] |
Palash Sarkar, Subhadip Singha. Classical reduction of gap SVP to LWE: A concrete security analysis. Advances in Mathematics of Communications, 2021 doi: 10.3934/amc.2021004 |
[5] |
Xianjun Wang, Huaguang Gu, Bo Lu. Big homoclinic orbit bifurcation underlying post-inhibitory rebound spike and a novel threshold curve of a neuron. Electronic Research Archive, , () : -. doi: 10.3934/era.2021023 |
[6] |
Zhikun She, Xin Jiang. Threshold dynamics of a general delayed within-host viral infection model with humoral immunity and two modes of virus transmission. Discrete & Continuous Dynamical Systems - B, 2021, 26 (7) : 3835-3861. doi: 10.3934/dcdsb.2020259 |
2019 Impact Factor: 0.734
Tools
Metrics
Other articles
by authors
[Back to Top]