Cryptography is an important tool in the design and implementation of e-voting schemes since it can provide verifiability, which is not provided in the traditional voting. But in the real life, most voters can neither...Cryptography is an important tool in the design and implementation of e-voting schemes since it can provide verifiability, which is not provided in the traditional voting. But in the real life, most voters can neither understand the profound theory of cryptography nor perform the complicated cryptographic computation. An e-voting system is presented in this paper to leverage the use of cryptography. It combines the advantages of voting scheme of Moran-Naor and voting scheme based on homomorphic encryption. It makes use of the cryptographic technique, but it hides the details of cryptographic computation from voters. Compared with voting scheme of Moran-Naor, the new system has three advantages: the ballots can be recovered when the voting machine breaks down, the costly cut-and-choose zero-knowledge proofs for shuffling votes made by the voting machine are avoided and the partial tally result in each voting machine can be kept secret.展开更多
Blockchain is a shared database with excellent characteristics,such as high decentralization and traceability.However,data leakage is still a major problem for blockchain transactions.To address this issue,this work i...Blockchain is a shared database with excellent characteristics,such as high decentralization and traceability.However,data leakage is still a major problem for blockchain transactions.To address this issue,this work introduces KPH(Paillier Homomorphic Encryption with Variable k),a privacy protection strategy that updates the transaction amount using the enhanced Paillier semihomomorphic encryption algorithm and verifies the transaction using the FO commitment.Unlike the typical Paillier algorithm,theKPHscheme’s Paillier algorithm includes a variable k and combines the L function and the Chinese remainder theorem to reduce the time complexity of the algorithm from O(|n|2+e)to O(logn),making the decryption process more efficient.展开更多
基金the National Natural Science Foundation of China (No. 60673076)the National High Technology Research and Development Program (863)of China (No. 2008AA01Z403)
文摘Cryptography is an important tool in the design and implementation of e-voting schemes since it can provide verifiability, which is not provided in the traditional voting. But in the real life, most voters can neither understand the profound theory of cryptography nor perform the complicated cryptographic computation. An e-voting system is presented in this paper to leverage the use of cryptography. It combines the advantages of voting scheme of Moran-Naor and voting scheme based on homomorphic encryption. It makes use of the cryptographic technique, but it hides the details of cryptographic computation from voters. Compared with voting scheme of Moran-Naor, the new system has three advantages: the ballots can be recovered when the voting machine breaks down, the costly cut-and-choose zero-knowledge proofs for shuffling votes made by the voting machine are avoided and the partial tally result in each voting machine can be kept secret.
基金funded by the Emerging Interdisciplinary Project of CUFE,the National Natural Science Foundation of China (No.61906220)Ministry of Education of Humanities and Social Science project (No.19YJCZH178).
文摘Blockchain is a shared database with excellent characteristics,such as high decentralization and traceability.However,data leakage is still a major problem for blockchain transactions.To address this issue,this work introduces KPH(Paillier Homomorphic Encryption with Variable k),a privacy protection strategy that updates the transaction amount using the enhanced Paillier semihomomorphic encryption algorithm and verifies the transaction using the FO commitment.Unlike the typical Paillier algorithm,theKPHscheme’s Paillier algorithm includes a variable k and combines the L function and the Chinese remainder theorem to reduce the time complexity of the algorithm from O(|n|2+e)to O(logn),making the decryption process more efficient.
