Anastassios Voudouris
ABSTRACT
In secret sharing, a dealer knows the secret it shares. In a distributed key generation (DKG) protocol, a shared secret is collectively generated in a group in a completely distributed way such that any subset of size greater than a threshold can reveal or use the shared secret, while smaller subsets do not have any knowledge about it. The most important aspect is that there is no dealer or trusted party. The core idea of secret sharing schemes is Shamir’s secret sharing method, which uses Lagrange’s interpolation to reconstruct the shared secret key. This paper investigates an alternative method, called Newton’s interpolation and it cites the probability of implementing it on current DKG protocols.
- Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. 2021. Reaching consensus for asynchronous distributed key generation. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. 363–373.Google Scholar
Digital Library
- Charles Asmuth and John Bloom. 1983. A modular approach to key safeguarding. IEEE transactions on information theory 29, 2 (1983), 208–210.Google ScholarDigital Library
- Jean-Paul Berrut and Lloyd N Trefethen. 2004. Barycentric lagrange interpolation. SIAM review 46, 3 (2004), 501–517.Google Scholar
- Sergey Bezzateev, Vadim Davydov, and Aleksandr Ometov. 2020. On Secret Sharing with Newton’s Polynomial for Multi-Factor Authentication. Cryptography 4, 4 (2020), 34.Google ScholarCross Ref
- Richard E Blahut. 2012. Algebraic methods for signal processing and communications coding. Springer Science & Business Media.Google Scholar
- Roland Bulirsch, Josef Stoer, and J Stoer. 2002. Introduction to numerical analysis. Vol. 3. Springer.Google Scholar
- Ran Canetti, Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk, and Tal Rabin. 1999. Adaptive security for threshold cryptosystems. In Annual International Cryptology Conference. Springer, 98–116.Google ScholarCross Ref
- Samuel Daniel Conte and Carl De Boor. 2017. Elementary numerical analysis: an algorithmic approach. SIAM.Google Scholar
- Sourav Das, Zhuolun Xiang, and Ling Ren. 2021. Asynchronous data dissemination and its applications. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. 2705–2721.Google ScholarDigital Library
- Sourav Das, Tom Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, and Ling Ren. 2021. Practical asynchronous distributed key generation. Cryptology ePrint Archive(2021).Google Scholar
- Information Technology Laboratory Computer Security Division. 2010 (accessed May 2, 2022). Multi-party threshold cryptography: CSRC. https://csrc.nist.gov/Projects/threshold-cryptography.Google Scholar
- Pierre-Alain Fouque and Jacques Stern. 2001. One round threshold discrete-log key generation without private channels. In International Workshop on Public Key Cryptography. Springer, 300–316.Google ScholarCross Ref
- Tatyana Galibus and Genadii Matveev. 2007. Generalized mignotte’s sequences over polynomial rings. Electronic Notes in Theoretical Computer Science 186 (2007), 43–48.Google ScholarDigital Library
- Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2021. Efficient asynchronous byzantine agreement without private setups. arXiv preprint arXiv:2106.07831(2021).Google Scholar
- Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk, and Tal Rabin. 1999. Secure distributed key generation for discrete-log based cryptosystems. In International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 295–310.Google ScholarCross Ref
- Jens Groth. 2021. Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive(2021).Google Scholar
- Kobi Gurkan, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. 2021. Aggregatable distributed key generation. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 147–176.Google ScholarDigital Library
- Timo Hanke, Mahnush Movahedi, and Dominic Williams. 2018. Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548(2018).Google Scholar
- Sorin Iftene. 2007. General secret sharing based on the chinese remainder theorem with applications in e-voting. Electronic Notes in Theoretical Computer Science 186 (2007), 67–84.Google ScholarDigital Library
- Aniket Kate, Yizhou Huang, and Ian Goldberg. 2012. Distributed key generation in the wild. Cryptology ePrint Archive(2012).Google Scholar
- Noam Kogan and Tamir Tassa. 2006. Improved efficiency for revocation schemes via Newton interpolation. ACM Transactions on Information and System Security (TISSEC) 9, 4(2006), 461–486.Google ScholarDigital Library
- Eleftherios Kokoris Kogias, Dahlia Malkhi, and Alexander Spiegelman. 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. 1751–1767.Google ScholarDigital Library
- Maurice Mignotte. 1982. How to share a secret. In Workshop on cryptography. Springer, 371–375.Google Scholar
- Diego Munuera-Merayo. 2021. On Mignotte secret sharing schemes over Gaussian integers. arXiv preprint arXiv:2104.06361(2021).Google Scholar
- Wafa Neji, Kaouther Blibech, and Narjes Ben Rajeb. 2016. Distributed key generation protocol with a new complaint management strategy. Security and communication networks 9, 17 (2016), 4585–4595.Google Scholar
- Orbs Network. 2018. DKG for BLS threshold signature scheme on the EVM using solidity.Google Scholar
- Ibrahim Ozbek, Fatih Temiz, and SİAP İrfan. 2019. A generalization of the Mignotte’s scheme over Euclidean domains and applications to secret image sharing. Journal of Algebra Combinatorics Discrete Structures and Applications 6, 3(2019), 147–161.Google ScholarCross Ref
- Torben Pryds Pedersen. 1991. A threshold cryptosystem without a trusted party. In Workshop on the Theory and Application of of Cryptographic Techniques. Springer, 522–526.Google ScholarCross Ref
- Philipp Schindler. 2020. Ethereum-based Distributed Key Generation Protocol.Google Scholar
- Philipp Schindler, Aljosha Judmayer, Nicholas Stifter, and Edgar Weippl. 2019. Ethdkg: Distributed key generation with ethereum smart contracts. Cryptology ePrint Archive(2019).Google Scholar
- Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612–613.Google ScholarDigital Library
- Alin Tomescu, Robert Chen, Yiming Zheng, Ittai Abraham, Benny Pinkas, Guy Golan Gueta, and Srinivas Devadas. 2020. Towards scalable threshold cryptosystems. In 2020 IEEE Symposium on Security and Privacy (SP). IEEE, 877–893.Google ScholarCross Ref
- Güzin Ulutaş, Mustafa Ulutaş, and Vasif Nabiyev. 2011. Secret sharing scheme based on mignotte’s scheme. In 2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU). IEEE, 291–294.Google ScholarCross Ref
Index Terms
- Secret sharing a key in a distributed way, Lagrange vs Newton
Recommendations
Multi-layer progressive secret image sharing
ISCGAV'07: Proceedings of the 7th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial VisionThis paper proposes a special type secret image sharing method. Based on the theories of secret image sharing and frequency domain transform, a multi-threshold secret image sharing is achieved. The method contains more properties compared with ...
Ideal Perfect Multilevel Threshold Secret Sharing Scheme
IAS '09: Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 02Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification, each shareholder keeps both $x$-coordinate ...
A secret sharing scheme with a short share realizing the (t,n) threshold and the adversary structure
On the basis of the properties of the Jordan matrix, we proposed a secret sharing scheme which can realize both the (t,n) threshold and the adversary structure and share a large secret while each participant has a short share. At the same time, the ...
Comments