MatRiCT

Esgin, Muhammed F.; Zhao, Raymond K.; Steinfeld, Ron; Liu, Joseph K.; Liu, Dongxi

doi:10.1145/3319535.3354200

Cited by 73 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, it would be interesting to study blockchain-based e-voting using postquantum algorithms that can resist quantum attacks [136,164]. According to Fernández-Caramés and Fraga-Lamas [165], the challenges of post-quantum blockchain include the key size required for post-quantum cryptosystems which is larger than that required for public-key cryptosystems, typically between 128 and 4096 bits.…”

Section: Potential Research Directionsmentioning

confidence: 99%

“…Consequently, continuous generation of new keys is required, which leads to high computational resource consumption and slacking of certain blockchain processes.Therefore, further research is required to balance the efficiency of blockchain and key generation and key size issues. Esgin et al [164] suggested that their proposed post-quantum blockchain scheme can be implemented in privacy preserving applications such as e-voting systems. Gao et al [136] constructed their scheme with code-based cryptography proposed by McEliece [166], which has not been broken so far, to be secure against quantum attacks.…”

Section: Potential Research Directionsmentioning

confidence: 99%

See 1 more Smart Citation

A Review of Cryptographic Electronic Voting

2022

View full text Add to dashboard Cite

A vast number of e-voting schemes including mix-net-based e-voting, homomorphic e-voting, blind signature-based e-voting, blockchain-based e-voting, post-quantum e-voting, and hybrid e-voting have been proposed in the literature for better security and practical implementation. In this paper, we review various e-voting approaches to date. We first compare the structures, advantages, and disadvantages of the different e-voting approaches. We then summarise the security properties of the e-voting approaches in terms of their functional requirements and security requirements. In addition, we provide a comprehensive review of various types of e-voting approaches in terms of their security properties, underlying tools, distinctive features, and weaknesses. We also discuss some practical considerations in the design of e-voting systems. Subsequently, some potential research directions are suggested based on our observations.

show abstract

Section: Potential Research Directionsmentioning

confidence: 99%

Section: Potential Research Directionsmentioning

confidence: 99%

A Review of Cryptographic Electronic Voting

2022

View full text Add to dashboard Cite

show abstract

“…We use a standard variant of M-LWE where both the error and secret coefficients are sampled uniformly from {−1, 0, 1}. This variant is commonly used in many recent proposals such as [12,13,14].…”

Section: Security Assumptions: Module-sis and Module-lwementioning

confidence: 99%

“…This parameter setting yields δ < 1.0045 for both M-SIS and M-LWE. δ ≈ 1.0045 has been used in recent works, e.g., [12,13,14] for targeting 128-bit post-quantum security. From here, we can compute the concrete signature length as…”

Section: Parameter Setting and Performance Analysismentioning

confidence: 99%

“…Beyond basic cryptographic schemes such as encryption and signature, lattice-based cryptography also supports advanced schemes such as zero-knowledge proofs (ZKP), which play a crucial role in blockchain applications. For example, advanced ZKPs have recently been studied in [12,13] and there are even recent efforts in constructing blockchain-specific applications based on lattice assumptions [14,30].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Post-Quantum Adaptor Signatures and Payment Channel Networks

Esgin

Ersoy

Erkin

2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Adaptor signatures, also known as scriptless scripts, have recently become an important tool in addressing the scalability and interoperability issues of blockchain applications such as cryptocurrencies. An adaptor signature extends a digital signature in a way that a complete signature reveals a secret based on a cryptographic condition. It brings about various advantages such as (i) low on-chain cost, (ii) improved fungibility of transactions, and (iii) advanced functionality beyond the limitation of the blockchain's scripting language. In this work, we introduce the first post-quantum adaptor signature, named LAS. Our construction relies on the standard lattice assumptions, namely Module-SIS and Module-LWE. There are certain challenges specific to the lattice setting, arising mainly from the so-called knowledge gap in lattice-based proof systems, that makes the realization of an adaptor signature and its applications difficult. We show how to overcome these technical difficulties without introducing additional on-chain costs. Our evaluation demonstrates that LAS is essentially as efficient as an ordinary lattice-based signature in terms of both communication and computation. We further show how to achieve post-quantum atomic swaps and payment channel networks using LAS.

show abstract