Pulmonary-Veins
发表于 2025-3-23 11:19:12
http://reply.papertrans.cn/17/1673/167242/167242_11.png
熔岩
发表于 2025-3-23 16:54:39
http://reply.papertrans.cn/17/1673/167242/167242_12.png
Shuttle
发表于 2025-3-23 18:16:05
http://reply.papertrans.cn/17/1673/167242/167242_13.png
IRK
发表于 2025-3-23 23:42:39
Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setupcurity of the aforementioned lattice constructions against quantum adversaries was never formally discussed..In this work, we bridge the gap and propose the first (asymptotically and concretely) efficient lattice-based polynomial commitment with transparent setup and post-quantum security. Our inter
Enervate
发表于 2025-3-24 06:12:13
http://reply.papertrans.cn/17/1673/167242/167242_15.png
骚扰
发表于 2025-3-24 07:21:58
http://reply.papertrans.cn/17/1673/167242/167242_16.png
Diatribe
发表于 2025-3-24 13:09:47
HyperNova: Recursive Arguments for Customizable Constraint Systemsenting the instruction invoked by the program step (“a la carte” cost profile). Third, we show how to achieve zero-knowledge for “free” and . the need to employ . SNARKs: we use a folding scheme to “randomize” IVC proofs. This highlights a new application of folding schemes. Fourth, we show how to e
eardrum
发表于 2025-3-24 14:57:27
Concretely Efficient Lattice-Based Polynomial Commitment from Standard Assumptionsown (CRYPTO 2023), a recent code-based construction, our scheme offers comparable performance across all metrics. Furthermore, its proof size is approximately 4.1 times smaller than SLAP (EUROCRYPT 2024), a recent lattice-based construction.
卜闻
发表于 2025-3-24 21:16:24
http://reply.papertrans.cn/17/1673/167242/167242_19.png
relieve
发表于 2025-3-25 01:03:12
Information aus kybernetischer Sicht,domizable 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.