Legosnark: Modular design and composition of succinct zero-knowledge proofs
We study the problem of building non-interactive proof systems modularly by linking small
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
Non-interactive zero-knowledge for blockchain: A survey
We survey the state-of-the-art non-interactive zero-knowledge argument schemes and their
applications in confidential transactions and private smart contracts on blockchain. The main …
applications in confidential transactions and private smart contracts on blockchain. The main …
Zombie: Middleboxes that {Don't} Snoop
Zero-knowledge middleboxes (ZKMBs) are a recent paradigm in which clients get privacy
and middleboxes enforce policy: clients prove in zero knowledge that the plaintext …
and middleboxes enforce policy: clients prove in zero knowledge that the plaintext …
Rinocchio: SNARKs for ring arithmetic
C Ganesh, A Nitulescu, E Soria-Vazquez - Journal of Cryptology, 2023 - Springer
Succinct non-interactive arguments of knowledge (SNARKs) enable non-interactive efficient
verification of NP computations and admit short proofs. However, all current SNARK …
verification of NP computations and admit short proofs. However, all current SNARK …
CCAP: a complete cross-domain authentication based on blockchain for Internet of Things
F Tong, X Chen, K Wang… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
The increasing diversity of Internet-of-Things (IoT) application scenarios and explosive
growth of access devices have brought more frequent exchanges of resources between …
growth of access devices have brought more frequent exchanges of resources between …
Zero-knowledge proofs for set membership: Efficient, succinct, modular
D Benarroch, M Campanelli, D Fiore, K Gurkan… - Designs, Codes and …, 2023 - Springer
We consider the problem of proving in zero knowledge that an element of a public set
satisfies a given property without disclosing the element, ie, for some u,“u∈ S and P (u) …
satisfies a given property without disclosing the element, ie, for some u,“u∈ S and P (u) …
Proof-of-stake protocols for privacy-aware blockchains
Abstract Proof-of-stake (PoS) protocols are emerging as one of the most promising
alternative to the wasteful proof-of-work (PoW) protocols for consensus in Blockchains (or …
alternative to the wasteful proof-of-work (PoW) protocols for consensus in Blockchains (or …
Secure and efficient distributed network provenance for IoT: A blockchain-based approach
Network provenance is essential for Internet-of-Things (IoT) network administrators to
conduct the network diagnostics and identify root causes of network errors. However, the …
conduct the network diagnostics and identify root causes of network errors. However, the …
Batching, aggregation, and zero-knowledge proofs in bilinear accumulators
An accumulator is a cryptographic primitive that allows a prover to succinctly commit to a set
of values while being able to provide proofs of (non-) membership. A batch proof is an …
of values while being able to provide proofs of (non-) membership. A batch proof is an …
Balancing privacy and accountability in blockchain identity management
The lack of privacy in the first generation of cryptocurrencies such as Bitcoin, Ethereum, etc.
is a well known problem in cryptocurrency research. To overcome this problem, several new …
is a well known problem in cryptocurrency research. To overcome this problem, several new …