The welch-gong stream cipher - evolutionary path

Zidarič, N.; Mandal, K.; Gong, G.; Aagaard, M.

doi:10.1007/s12095-023-00656-0

Cited by 3 publications

(1 citation statement)

References 64 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to the NIST lightweight cryptography standards, there are also lightweight ciphers that include error detection mechanisms that can detect errors in the ciphertext caused by transmission errors or fault attacks. For example, the WAGE stream cipher (Zidarič et al, 2023), the Camellia block cipher (Aoki et al, 2000), the Midori cipher (Banik et al, 2015), and the QARMA block cipher (Avanzi et al, 2023) all include error detection mechanisms.…”

Section: Overview For Post-quantum Cryptographymentioning

confidence: 99%

The metaverse digital environments: a scoping review of the challenges, privacy and security issues

Tukur,

Schneider,

Househ

et al. 2023

Front. Big Data

View full text Add to dashboard Cite

The concept of the “metaverse” has garnered significant attention recently, positioned as the “next frontier” of the internet. This emerging digital realm carries substantial economic and financial implications for both IT and non-IT industries. However, the integration and evolution of these virtual universes bring forth a multitude of intricate issues and quandaries that demand resolution. Within this research endeavor, our objective was to delve into and appraise the array of challenges, privacy concerns, and security issues that have come to light during the development of metaverse virtual environments in the wake of the COVID-19 pandemic. Through a meticulous review and analysis of literature spanning from January 2020 to December 2022, we have meticulously identified and scrutinized 29 distinct challenges, along with 12 policy, privacy, and security matters intertwined with the metaverse. Among the challenges we unearthed, the foremost were concerns pertaining to the costs associated with hardware and software, implementation complexities, digital disparities, and the ethical and moral quandaries surrounding socio-control, collectively cited by 43%, 40%, and 33% of the surveyed articles, respectively. Turning our focus to policy, privacy, and security issues, the top three concerns that emerged from our investigation encompassed the formulation of metaverse rules and principles, the encroachment of privacy threats within the metaverse, and the looming challenges concerning data management, all mentioned in 43%, 40%, and 33% of the examined literature. In summation, the development of virtual environments within the metaverse is a multifaceted and dynamically evolving domain, offering both opportunities and hurdles for researchers and practitioners alike. It is our aspiration that the insights, challenges, and recommendations articulated in this report will catalyze extensive dialogues among industry stakeholders, governmental bodies, and other interested parties concerning the metaverse's destiny and the world they aim to construct or bequeath to future generations.

show abstract

Section: Overview For Post-quantum Cryptographymentioning

confidence: 99%

The metaverse digital environments: a scoping review of the challenges, privacy and security issues

Tukur,

Schneider,

Househ

et al. 2023

Front. Big Data

View full text Add to dashboard Cite

show abstract

Uni/multi variate polynomial embeddings for zkSNARKs

Gong

2024

Cryptogr. Commun.

View full text Add to dashboard Cite

A zero-knowledge proof is a cryptographic primitive that enables a prover to convince a verifier the validity of a mathematical statement (an NP statement) without revealing any secret inputs to the verifier. A special case, called zero-knowledge Succinct Non-interactive ARgument of Knowledge (zkSNARK) is particularly designed for arithmetic circuit proof systems which have important applications in blockchain privacy. The major computations in this type of zkSNARK proofs with post-quantum security are polynomial evaluations and Lagrange interpolations over finite fields. Given a sequence over a finite field, in the field of coding and sequences research, we understand that there are two representations of the sequence, one is a univariate polynomial and the other, a multivariate polynomial. This is exactly what is done in those zero-knowledge proof systems to transform the proof of a R1CS relation to evaluate uni/multi variate polynomials at some random points in the finite field. In this paper, we present a comparative analysis on how to convert a rank 1 constrained satisfiability (R1CS) system (more general than a circuit system) into a polynomial equality and provide analysis on the concrete complexities of provers, proof sizes and verifiers. We use two concrete zkSNARK schemes, i.e., Polaris, univariate polynomial encodings and Spartan, multivariate polynomial encodings, as examples to show our analysis. Secondly, we propose to select interpolating sets as subfields instead of affine spaces of a large field for Lagrange interpolation. This new method has improved the performance of R1CS encodings largely. We comment that post-quantum secure zkSNARKs yield post-quantum digital signatures with security only depending on symmetric-key schemes. Some open problems are proposed at the end of the paper.

show abstract