FPGA implementations for data encryption and decryption via concurrent and parallel computation: A review
AA Yazdeen, SRM Zeebaree… - Qubahan Academic …, 2021 - journal.qubahan.com
In recent days, increasing numbers of Internet and wireless network users have helped
accelerate the need for encryption mechanisms and devices to protect user data sharing …
accelerate the need for encryption mechanisms and devices to protect user data sharing …
zkbridge: Trustless cross-chain bridges made practical
Blockchains have seen growing traction with cryptocurrencies reaching a market cap of over
1 trillion dollars, major institution investors taking interests, and global impacts on …
1 trillion dollars, major institution investors taking interests, and global impacts on …
Hyperplonk: Plonk with linear-time prover and high-degree custom gates
Plonk is a widely used succinct non-interactive proof system that uses univariate polynomial
commitments. Plonk is quite flexible: it supports circuits with low-degree “custom” gates as …
commitments. Plonk is quite flexible: it supports circuits with low-degree “custom” gates as …
Marlin: Preprocessing zkSNARKs with universal and updatable SRS
We present a methodology to construct preprocessing zkSNARKs where the structured
reference string (SRS) is universal and updatable. This exploits a novel use of holography …
reference string (SRS) is universal and updatable. This exploits a novel use of holography …
Transparent SNARKs from DARK compilers
B Bünz, B Fisch, A Szepieniec - … on the Theory and Applications of …, 2020 - Springer
We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
State of the art of zero-knowledge proofs in blockchain
D Čapko, S Vukmirović, N Nedić - 2022 30th …, 2022 - ieeexplore.ieee.org
Blockchain technology promises a decentralized ecosystem for building apps with
decentralized ownership and high security level. One of the most adopted blockchain …
decentralized ownership and high security level. One of the most adopted blockchain …
Orion: Zero knowledge proof with linear prover time
Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …
applications in the real world. However, existing schemes with succinct proof size suffer from …
Ligero: Lightweight sublinear arguments without a trusted setup
We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …
communication complexity is proportional to the square-root of the verification circuit size …
Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
Themis: Fast, strong order-fairness in byzantine consensus
We introduce Themis, a scheme for introducing fair ordering of transactions into
(permissioned) Byzantine consensus protocols with at most ƒ faulty nodes among n≥ 4ƒ+ 1 …
(permissioned) Byzantine consensus protocols with at most ƒ faulty nodes among n≥ 4ƒ+ 1 …