Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments-Reference-Cited by-全球学者库

登录注册会员服务联系我们

Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments

Published:2021 Issue: Volume: Page:649-680
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2021
language:
Short-container-title:

Author:

Boneh Dan,Drake Justin,Fisch Ben,Gabizon Ariel

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-84242-0_23

Reference65 articles.

1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC, pp. 99–108 (1996)

2. Lecture Notes in Computer Science;T Attema,2020

3. Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite groups. In: 23rd ACM STOC, pp. 164–174 (May 1991)

4. Lecture Notes in Computer Science;C Baum,2018

5. Lecture Notes in Computer Science;C Baum,2016

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Blockchain-based fake news traceability and verification mechanism;Heliyon;2023-07

2. Folding Schemes with Selective Verification;Progress in Cryptology – LATINCRYPT 2023;2023

3. Multilinear Schwartz-Zippel Mod N and Lattice-Based Succinct Arguments;Theory of Cryptography;2023

4. From Polynomial IOP and Commitments to Non-malleable zkSNARKs;Theory of Cryptography;2023

5. NFT Trades in Bitcoin with Off-Chain Receipts;Lecture Notes in Computer Science;2023

全球学者库

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"全球学者库"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前全球学者库共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP