Citation: | SHI Liucheng and GUO Zhaozhong, “Baguena: A Practical Proof of Stake Protocol with a Robust Delegation Mechanism,” Chinese Journal of Electronics, vol. 29, no. 5, pp. 887-898, 2020, doi: 10.1049/cje.2020.08.004 |
S. Nakamoto, "Bitcoin:A peer-to-peer electronic cash system:March 23, 2008", https://bitcoin.org/bitcoin.pdf,2018-3-10.
|
Y. Sompolinsky and A. Zohar, "Secure high-rate transaction processing in bitcoin", Proceedings of the 19th International Conference for Financial Cryptography and Data Security, San Juan, Puerto Rico, pp.507-527, 2015.
|
I. Bentov, A. Gabizon and A. Mizrahi, "Cryptocurrencies without proof of work", Proceedings of the 2016 Financial Cryptography and Data Security Conference, Christ Church, Barbados, pp.142-157, 2016.
|
I. Bentov, C. Lee, A. Mizrahi, et al., "Proof of activity:Extending bitcoin's proof of work via proof of stake", SIGMETRICS Performance Evaluation Review, Vol.42, No.3, pp.34-37, 2014.
|
G. Ateniese, I. Bonacina, A. Faonio, et al., "Proofs of space:When space is of the essence", Proceedings of the 9th International Conference of Security and Cryptography for Networks, Amalfi, Italy, pp.538-557, 2014.
|
S. Dziembowski, S. Faust, V. Kolmogorov, et al., "Proofs of space", Proceedings of the 35th Annual Cryptology Conference, Santa Barbara, CA, USA, pp.585-605, 2015.
|
S. Micali, "ALGORAND:The efficient and democratic ledger", Cryptology ePrint Archive, https://arxiv.org/abs/1607.01341,2016.
|
S. Micali, M. Rabin and S. Vadhan, "Verifiable random functions", Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, Los Alamitos, CA, USA, pp.120-130, 1999.
|
A. Kiayias, A. Russell, B. David, et al., "Ouroboros:A provably secure proof-of-stake blockchain protocol", Advances in Cryptology-CRYPTO 2017, Lecture Notes in Computer Science, Vol.10401, pp.357-388, 2017.
|
B. David, G. Peter, A. Kiayias, et al., "Ouroboros praos:An adaptively-secure, semi-synchronous proof-of-stake blockchain", Advances in Cryptology-EUROCRYPT 2018, Lecture Notes in Computer Science, Vol.10821, pp.66-98, 2018.
|
C. Badertscher, P. Gazi, A. Kiayias, et al., "Ouroboros genesis:Composable proof-of-stake blockchains with dynamic availability", Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, pp.913-930, 2018.
|
A. Kiayias and A. Russell, "Ouroboros-BFT:A simple byzantine fault tolerant consensus protocol", Cryptology ePrint Archive, https://eprint.iacr.org/2018/1049,2018.
|
T. Hanke, M. Movahedi and D. Williams, "DFINITY technology overview series, consensus system", Cryptology ePrint Archive, https://arxiv.org/abs/1805.04548,2018.
|
M. O. Rabin, "Transaction protection by beacons", Journal of Computer and System Sciences, Vol.27, No.2, pp.256-267, 1983.
|
R. Gennaro, S. Jarecki, H. Krawczyk, et al., "Secure distributed key generation for discrete-log based cryptosystems", Advances in Cryptology-EUROCRYPT 1999, Lecture Notes in Computer Science, Vol.1592, pp.295-310, 1999.
|
A. Shamir, "How to share a secret", Communications of the ACM, Vol.24, No.11, pp.612-613, 1979.
|
B. Chor, S. Goldwasser, S. Micali, et al., "Verifiable secret sharing and achieving simultaneity in the presence of faults", Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, Portland, Oregon, USA, pp.383-395, 1985.
|
R.L. Rivest, A. Shamir and Y. Tauman, "How to leak a secret", Advances in Cryptology-ASIACRYPT 2001, Lecture Notes in Computer Science, Vol.2248, pp.552-565, 2001.
|
V. Shoup, "Practical threshold signatures", Advances in Cryptology-EUROCRYPT 2000, Lecture Notes in Computer Science, Vol.1807, pp.207-220, 2000.
|
D. Boneh, C. Gentry, B. Lynn, et al., "Aggregate and verifiably encrypted signatures from bilinear maps", Advances in Cryptology-EUROCRYPT 2003, Lecture Notes in Computer Science, Vol.2656, pp.416-432, 2003.
|
D. Boneh, B. Lynn and H. Shacham, "Short signatures from the weil pairing", Advances in Cryptology-ASIACRYPT 2001, Lecture Notes in Computer Science, Vol.2248, pp.514-532, 2001.
|
R.J. Mceliece and D.V. Sarwate, "On sharing secrets and reedsolomon codes", Communications of the ACM, Vol.24, No.9, pp.583-584, 1981.
|
D. Chaum and T. Pedersen, "Wallet databases with observers", Advances in Cryptology-CRYPTO 1992, Lecture Notes in Computer Science, Vol.740, pp.89-105, 1992.
|
A. Boldyreva, A. Palacio and B. Warinschi, "Secure proxy signature schemes for delegation of signing rights", Journal of Cryptology, Vol.25, No.1, pp.57-115, 2003.
|
NIST, Federal Information Processing Standards Publication 186:1994, Revision (To include ECDSA) 1862:2000, Digital Signature Standard (DSS).
|
I. Bentov, A. Gabizon and D. Zuckerman, "Bitcoin beacon", Cryptology ePrint Archive, https://arxiv.org/abs/1605.04559,2016.
|
J. Bonneau, J. Clark and S. Goldfeder, "On bitcoin as a public randomness source", Cryptology ePrint Archive, https://eprint.iacr.org/2015/1015,2015.
|
S. Azouvi, P. Mccorry and S. Meiklejohn, "Winning the caucus race:Continuous leader election via public randomness", Cryptology ePrint Archive, https://arxiv.org/abs/1801.07965,2018.
|
E. Syta, P. Jovanovic, E.K. Kogias, et al., "Scalable biasresistant distributed randomness", 2017 IEEE Symposium on Security and Privacy (SP), San Jose, CA, USA, pp.444-460, 2017.
|
T. Rabin and M. Ben-Or, "Verifiable secret sharing and multiparty protocols with honest majority", Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, Washigton, USA, pp.73-85, 1989.
|
S. Philipp, J. Aljosha, S. Nicholas, et al., "HydRand:Efficient continuous distributed randomness", Cryptology ePrint Archive, https://eprint.iacr.org/2018/319,2018.
|
I. Cascudo and B. David, "SCRAPE:Scalable randomness attested by public entities", Applied Cryptography and Network Security, ACNS 2017, Lecture Notes in Computer Science, Vol.10355, pp.537-556, 2017.
|
C. Baum, D. Ivan and C. Orlandi, "Publicly auditable secure multi-party computation", Security and Cryptography for Networks, SCN 2014, Lecture Notes in Computer Science, Vol.8642, pp.175-196, 2014.
|
B. Schoenmakers and M. Veeningen, "Universally verifiable multiparty computation from threshold homomorphic cryptosystems", Applied Cryptography and Network Security, ACNS 2015, Lecture Notes in Computer Science, Vol.9092, pp.3-22, 2015.
|
M.H. Chang, I.T. Chen and M.T. Chen, "Design of proxy signature in ECDSA", Proceedings of the 2008 Eighth International Conference on Intelligent Systems Design and Applications, Washington, DC, USA, pp.17-22, 2008.
|
WONDERNETWORK, Global Ping Statistics:Ping Times Between WonderNetworkservers, https://wondernetwork.com/pings,2019-9-1.
|