Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS

Chiesa, Alessandro; Hu, Yuncong; Maller, Mary; Mishra, Pratyush; Vesely, Noah; Ward, Nicholas P.

doi:10.1007/978-3-030-45721-1_26

Cited by 182 publications

(56 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Maller et al presented Sonic [32], which improved this to a linear CRS by exploiting the reduction of [10]. Several works [20,15,19] have tried to improve the efficiency of Sonic concretely. However, all of these, including Sonic, are secure either in the Algebraic Group Model, or under knowledge type assumptions (apart from the Random Oracle Model).…”

Section: Related Workmentioning

confidence: 99%

Updateable Inner Product Argument with Logarithmic Verifier and Applications

Daza

Ràfols

Zacharakis

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We propose an improvement for the inner product argument of Bootle et al. (EUROCRYPT'16). The new argument replaces the unstructured common reference string (the commitment key) by a structured one. We give two instantiations of this argument, for two different distributions of the CRS. In the designated verifier setting, this structure can be used to reduce verification from linear to logarithmic in the circuit size. The argument can be compiled to the publicly verifiable setting in asymmetric bilinear groups. The new common reference string can easily be updateable. The argument can be directly used to improve verification of Bulletproofs range proofs (IEEE SP'18). On the other hand, to use the improved argument to prove circuit satisfiability with logarithmic verification, we adapt recent techniques from Sonic (ACM CCS'19) to work with the new common reference string. The resulting argument is secure under standard assumptions (in the Random Oracle Model), in contrast with Sonic and recent works that improve its efficiency (Plonk, Marlin, AuroraLight), which, apart from the Random Oracle Model, need either the Algebraic Group Model or Knowledge Type assumptions.

show abstract

Section: Related Workmentioning

confidence: 99%

Updateable Inner Product Argument with Logarithmic Verifier and Applications

Daza

Ràfols

Zacharakis

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…While these proof systems are promising, the size of their proofs are magnitudes larger than the current trusted setup, making them impractical for a blockchain setting (varying from tens to hundreds of KB for each proof, the current trusted setup SNArKs is 127 bytes [87], [88]). A group of proof systems exists between the transparent and the trusted setup, namely the SNORKs (PLONK [89], Sonic [90] and Marlin [91]). While SNORKs improve on the SNArK, in the sense that setups can be reused for multiple circuits, incentivising thus the one-off creation of a larger setup, they still require a trusted setup.…”

Section: A Possible Research Directions 1) Transactions Propagation mentioning

confidence: 99%

Privacy and Cryptocurrencies—A Systematic Literature Review

2020

View full text Add to dashboard Cite

Our transaction history in the current centralized banking system has the ability to reveal a lot of private information for each spender, both to the banking system itself, but also to those entities that surround it (e.g., governments, industry etc). Examples of leaking information constitute the amounts spent, the goods on which the amounts were spent, the spending locations and the users we exchange money with. This knowledge is powerful in the hands of those who have it, and can be used in multiple ways, not always to our benefit. Cryptocurrencies, such as the famous Bitcoin, were proposed as a means to address the limitations of centralized banking systems and to offer its users privacy with regards to their transactional data. In this work, we perform a systematic literature review on the realm of privacy for electronic currencies. We present the development of digital money from electronic cash to cryptocurrencies and focus on the techniques that are employed to enhance user-privacy. Furthermore, we present flaws of the current cryptocurrency systems, which reduce the privacy of the cryptocurrency users. Finally, we describe three research directions to enhance privacy for cryptocurrencies: transaction propagation mechanisms, succinct ZK proof systems without a trusted setup, and specialised trustless zero-knowledge proofs. INDEX TERMS Anonymity, bitcoin, confidentiality, cryptocurrencies, electronic cash, privacy, zero-knowledge.

show abstract

“…Because of this, we use instead the scheme proposed in [10], an improvement to [11], that allows multiple univariate polynomial commitments for a single degree bound and a single evaluation over a field family F.…”

Section: A Verifiable Weighted Threshold Secret Sharing Schemementioning

confidence: 99%

“…The first is a weighted threshold secret sharing scheme based on Shamir's secret sharing scheme [8] which is used to generate, in a distributed way, a secret that will be a private key of an additive ElGamal cryptosystem over elliptic curves (EC-EG) [9], which is additive homomorphic. The second scheme is the polynomials commitment scheme presented in [10], which is an improvement of [11], and is used to make the previous scheme verifiable, i.e., without the need for a trusted dealer. Finally, the third scheme is used to decrypt a ciphertext of the EC-EG cryptosystem without reconstructing the private key, which, because of that, can be used multiple times.…”

Section: Introductionmentioning

confidence: 99%

A Tool for Implementing Privacy in Nano

Morais

Crocker

Sousa

2020

2020 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)

View full text Add to dashboard Cite

We present a work in progress strategy for implementing privacy in Nano at the consensus level, that can be of independent interest. Nano is a cryptocurrency that uses an Open Representative Voting (ORV) as a consensus mechanism, a variant of Delegated Proof of Stake. Each transaction on the network is voted on by representatives and each vote has a weight equal to the percentage of their total delegated balance. Every account can delegate their stake to any other account (including itself) and change it anytime it wants. The fundamental goal of this paper is to construct a tool for the consensus algorithm to function without knowing the individual balances of each account. The tool is composed of three different schemes. The first is a weighted threshold secret sharing scheme based on Shamir's secret sharing scheme, used to generate a secret amongst a set of distributed parties, which will be a private key of an additive homomorphic ElGamal cryptosystem over elliptic curves. The second is a polynomials commitment scheme used to make the previous scheme verifiable, i.e., without the need for a trusted dealer. Finally, the third scheme is used to decrypt an ElGamal ciphertext without reconstructing the private key, which, because of this, can be used multiple times.

show abstract

Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS

Cited by 182 publications

References 35 publications

Updateable Inner Product Argument with Logarithmic Verifier and Applications

Updateable Inner Product Argument with Logarithmic Verifier and Applications

Privacy and Cryptocurrencies—A Systematic Literature Review

A Tool for Implementing Privacy in Nano

Contact Info

Product

Resources

About