default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID45th CRYPTO 2025, Santa Barbara, CA, USA - Part VII
- Yael Tauman Kalai, Seny F. Kamara:
Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part VII. Lecture Notes in Computer Science 16006, Springer 2025, ISBN 978-3-032-01906-6
Obfuscation
- Yao-Ching Hsieh, Aayush Jain, Huijia Lin:
Lattice-Based Post-quantum iO from Circular Security with Random Opening Assumption. 3-38 - Valerio Cini
, Russell W. F. Lai, Ivy K. Y. Woo:
Lattice-Based Obfuscation from NTRU and Equivocal LWE. 39-72 - Nico Döttling, Abhishek Jain, Giulio Malavolta, Surya Mathialagan, Vinod Vaikuntanathan:
Simple and General Counterexamples for Private-Coin Evasive LWE. 73-92
Proof Systems
- Lior Rotem, Stefano Tessaro:
Straight-Line Knowledge Extraction for Multi-Round Protocols. 95-127 - Benedikt Bünz, Pratyush Mishra, Wilson Nguyen, William Wang:
Arc: Accumulation for Reed-Solomon Codes. 128-160 - Ziyi Guan, Artur Riazanov, Weiqiang Yuan:
Breaking Verifiable Delay Functions in the Random Oracle Model. 161-191 - Gal Arnon, Jesko Dujmovic, Yuval Ishai:
Designated-Verifier SNARGs with One Group Element. 192-224 - Christian Badertscher, Matteo Campanelli, Michele Ciampi, Luigi Russo, Luisa Siniscalchi:
Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle. 225-258 - Albert Garreta, Hendrik Waldner, Ilia Vlasov, Katerina Hristova, Luca Dall'Ava, Marko Cupic, Matthew Klein:
sfZinc: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers. 259-291 - Brent Waters, David J. Wu:
A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for sfNP. 292-326 - Dan Boneh, Binyi Chen:
LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems. 327-361 - Helger Lipmaa, Roberto Parisella, Janno Siim:
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions. 362-395 - Sanjam Garg, Aarushi Goel, Abhishek Jain, Bhaskar Roberts, Sruthi Sekar:
Malicious Security in Collaborative zk-SNARKs: More than Meets the Eye. 396-428 - Yanyi Liu, Noam Mazor, Rafael Pass:
On Witness Encryption and Laconic Zero-Knowledge Arguments. 429-461 - Benny Applebaum, Eliran Kachlon:
NIZK Amplification via Leakage-Resilient Secure Computation. 462-479 - Benny Applebaum, Eliran Kachlon:
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs. 480-513 - Pedro Branco, Nico Döttling, Akshayaram Srinivasan:
Rate-1 Statistical Non-interactive Zero-Knowledge. 514-547 - Tomer Gewirtzman, Ron Rothblum:
Zero-Knowledge in Streaming Interactive Proofs. 548-579 - Suvradip Chakraborty, James Hulett, Dakshita Khurana:
On Weak NIZKs, One-Way Functions and Amplification. 580-610 - Pratish Datta, Abhishek Jain, Zhengzhong Jin, Alexis Korb, Surya Mathialagan, Amit Sahai:
Incrementally Verifiable Computation for NP from Standard Assumptions. 611-642 - Ignacio Cascudo, Anamaria Costache, Daniele Cozzo, Dario Fiore, Antonio Guimarães, Eduardo Soria-Vazquez:
Verifiable Computation for Approximate Homomorphic Encryption Schemes. 643-677
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-06-12 21:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
