找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Advances in Cryptology – CRYPTO 2024; 44th Annual Internat Leonid Reyzin,Douglas Stebila Conference proceedings 2024 International Associat

[复制链接]
楼主: 搭话
发表于 2025-3-25 04:38:35 | 显示全部楼层
Adaptive Security in SNARGs via iO and Lossy Functionsdomizable one way functions (in addition to obfuscation). Such functions are only currently known to be realizable from assumptions such as discrete log or factoring that are known to not hold in a quantum setting.
发表于 2025-3-25 08:35:07 | 显示全部楼层
Conference proceedings 2024VI: Cryptanalysis; new primitives; side-channels and leakage;..Part VII: Quantum cryptography; threshold cryptography;..Part VIII: Multiparty computation;..Part IX: Multiparty computation; private information retrieval; zero-knowledge;..Part X: Succinct arguments... .
发表于 2025-3-25 13:53:27 | 显示全部楼层
0302-9743 4. The conference took place at Santa Barbara, CA, USA, during August 18-22, 2024...The 143 full papers presented in the proceedings were carefully reviewed and selected from a total of 526 submissions. The papers are organized in the following topical sections:..Part I: Digital signatures;..Part II
发表于 2025-3-25 19:53:34 | 显示全部楼层
发表于 2025-3-25 23:04:06 | 显示全部楼层
M. Heberer,A. Bodoky,M. Dürig,F. Harder through an exhaustive parameter search. Polymath’s prover does not output . elements, aiding in batch verification, SNARK aggregation, and recursion. Polymath’s properties make it highly suitable to be the final SNARK in SNARK compositions.
发表于 2025-3-26 01:04:04 | 显示全部楼层
Friedrich Wilhelm Ahnefeld,A. Grünertals of degree at most ., the scheme produces evaluation proofs of size 53KB, which is more than . times smaller than the recent lattice-based framework, called . (EUROCRYPT 2024), and around three orders of magnitude smaller than Ligero (CCS 2017) and Brakedown (CRYPTO 2023).
发表于 2025-3-26 06:43:45 | 显示全部楼层
Rechnerarchitekturen und Betriebssysteme,IR achieves an improvement in argument size that ranges from . to . depending on the chosen parameters, with similar prover and verifier running times. For example, in order to achieve 128 bits of security for degree . and rate 1/4, STIR has argument size 114 KiB, compared to 211 KiB for FRI.
发表于 2025-3-26 11:07:20 | 显示全部楼层
发表于 2025-3-26 14:12:58 | 显示全部楼层
Polymath: Groth16 Is Not the Limit through an exhaustive parameter search. Polymath’s prover does not output . elements, aiding in batch verification, SNARK aggregation, and recursion. Polymath’s properties make it highly suitable to be the final SNARK in SNARK compositions.
发表于 2025-3-26 17:55:48 | 显示全部楼层
Greyhound: Fast Polynomial Commitments from Latticesals of degree at most ., the scheme produces evaluation proofs of size 53KB, which is more than . times smaller than the recent lattice-based framework, called . (EUROCRYPT 2024), and around three orders of magnitude smaller than Ligero (CCS 2017) and Brakedown (CRYPTO 2023).
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 13:19
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表