TY - GEN
T1 - SodsMPC
T2 - 19th IEEE International Symposium on Network Computing and Applications, NCA 2020
AU - Dolev, Shlomi
AU - Wang, Ziyu
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/11/24
Y1 - 2020/11/24
N2 - SodsMPC is a quantum-safe smart contract system. SodsMPC permissioned servers (verification nodes) execute contracts by secure multi-party computation (MPC) protocols. MPC ensures the contract execution correctness while trivially keeping the data privacy. Moreover, SodsMPC accomplishes the contract business logic privacy while protecting the contract user anonymous identity simultaneously. We express the logic of a contract by a finite state machine (FSM). A state transition of the FSM is represented by a blind polynomial with secret-shared coefficients. When using MPC to compute this blind polynomial, the contract business logic privacy is obtained. These coefficients which control the logic are binary secret shares. We also propose a base conversion method among binary and integer secret shares by MPC. Our contract anonymity comes from the 'mixing-then-contract' paradigm. The online phase of the SodsMPC mixing is a multiplication between a preprocessed permutation matrix and an input vector in the form of secret sharing, which accomplishes a fully randomized shuffle of the inputs and keeps the secret share form for the following contract execution. All SodsMPC components, including a verifiable secret sharing scheme, are quantum-safe, asynchronous, coping with t < n/3 compromised servers, and robust (tolerates Byzantine servers) in both preprocessing and online phases.
AB - SodsMPC is a quantum-safe smart contract system. SodsMPC permissioned servers (verification nodes) execute contracts by secure multi-party computation (MPC) protocols. MPC ensures the contract execution correctness while trivially keeping the data privacy. Moreover, SodsMPC accomplishes the contract business logic privacy while protecting the contract user anonymous identity simultaneously. We express the logic of a contract by a finite state machine (FSM). A state transition of the FSM is represented by a blind polynomial with secret-shared coefficients. When using MPC to compute this blind polynomial, the contract business logic privacy is obtained. These coefficients which control the logic are binary secret shares. We also propose a base conversion method among binary and integer secret shares by MPC. Our contract anonymity comes from the 'mixing-then-contract' paradigm. The online phase of the SodsMPC mixing is a multiplication between a preprocessed permutation matrix and an input vector in the form of secret sharing, which accomplishes a fully randomized shuffle of the inputs and keeps the secret share form for the following contract execution. All SodsMPC components, including a verifiable secret sharing scheme, are quantum-safe, asynchronous, coping with t < n/3 compromised servers, and robust (tolerates Byzantine servers) in both preprocessing and online phases.
KW - Anonymous Mixing
KW - Finite State Machine
KW - Multi-party Computation
KW - Private Smart Contract
KW - Quantum-safety
UR - http://www.scopus.com/inward/record.url?scp=85099729503&partnerID=8YFLogxK
U2 - 10.1109/NCA51143.2020.9306699
DO - 10.1109/NCA51143.2020.9306699
M3 - Conference contribution
AN - SCOPUS:85099729503
T3 - 2020 IEEE 19th International Symposium on Network Computing and Applications, NCA 2020
BT - 2020 IEEE 19th International Symposium on Network Computing and Applications, NCA 2020
A2 - Gkoulalas-Divanis, Aris
A2 - Marchetti, Mirco
A2 - Avresky, Dimiter R.
PB - Institute of Electrical and Electronics Engineers
Y2 - 24 November 2020 through 27 November 2020
ER -