Abstract
SodsBC is the first asynchronous permissioned blockchain consensus (asynchronous BFT, aBFT in short) utilizing the concurrent preprocessing model to achieve post-quantum security while keeping high performance simultaneously. SodsBC concurrently preprocesses common random coins (from a global secret sharing pool) for the consensus necessary randomness usage, and also preprocesses symmetric encryption keys for considerable censorship resilience. The finalization of a stage of the global secret sharing pool utilizes the aBFT itself, as a transaction in the new block. SodsBC (and its followed work SodsBC++) is faster than the quantum-sensitive aBFT competitors. SodsMPC is a post-quantum smart contract system, in which all participants execute a contract by secure multi-party computation (MPC) protocols. MPC ensures the contract execution correctness while keeping the data privacy. Moreover, SodsMPC expresses the logic of a contract by a blind polynomial with secret-shared coefficients, and utilizes a finite state machine (FSM) to simplify the blind polynomial for better efficiency. When using MPC to compute this blind polynomial, the contract business logic privacy is obtained. SodsMPC participants also preprocess random permutation matrices to hide the real contract input relation, which protects the contract user anonymous identity.
This brief announcement introduces the published work SodsBC [6] (with a full version [8]) and SodsMPC [7].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
\(\lambda \) is the security parameter for SodsBC symmetric cryptography schemes and Honeybadger/BEAT asymmetric and quantum-sensitive schemes.
References
Backes, M., Kate, A., Patra, A.: Computational verifiable secret sharing revisited. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 590–609. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25385-0_32
Baek, J., Zheng, Y.: Simple and efficient threshold cryptosystem from the gap Diffie-Hellman group. In: GLOBECOM 2003, pp. 1491–1495 (2003)
Bitan, D., Dolev, S.: Optimal-round preprocessing-MPC via polynomial representation and distributed random matrix (extended abstract). IACR Cryptology ePrint Archive, p. 1024 (2019)
Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., Wu, H.: ZEXE: enabling decentralized private computation. In: S&P 2020, pp. 947–964 (2020)
Bünz, B., Agrawal, S., Zamani, M., Boneh, D.: Zether: towards privacy in a smart contract world. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 423–443. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-51280-4_23
Dolev, S., Wang, Z.: SodsBC: stream of distributed secrets for quantum-safe blockchain. In: IEEE Blockchain 2020, pp. 247–256 (2020)
Dolev, S., Wang, Z.: SodsMPC: FSM based anonymous and private quantum-safe smart contracts. In: NCA 2020, pp. 1–10 (2020)
Dolev, S., Wang, Z.: SodsBC: a post-quantum by design asynchronous blockchain framework. IACR Cryptology ePrint Archive, p. 205 (2020)
Duan, S., Reiter, M.K., Zhang, H.: BEAT: asynchronous BFT made practical. In: CCS 2018, pp. 2028–2041 (2018)
Guo, B., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo: faster asynchronous BFT protocols. In: CCS 2020, pp. 803–818 (2020) (2020)
Mavridou, A., Laszka, A.: Designing secure ethereum smart contracts: a finite state machine based approach. In: Meiklejohn, S., Sako, K. (eds.) FC 2018. LNCS, vol. 10957, pp. 523–540. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-662-58387-6_28
Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: CCS 2016, pp. 31–42 (2016)
Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 1–16. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0054113
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Dolev, S., Wang, Z. (2021). SodsBC/SodsBC++ & SodsMPC: Post-quantum Asynchronous Blockchain Suite for Consensus and Smart Contracts. In: Johnen, C., Schiller, E.M., Schmid, S. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2021. Lecture Notes in Computer Science(), vol 13046. Springer, Cham. https://doi.org/10.1007/978-3-030-91081-5_39
Download citation
DOI: https://doi.org/10.1007/978-3-030-91081-5_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91080-8
Online ISBN: 978-3-030-91081-5
eBook Packages: Computer ScienceComputer Science (R0)