Zero Proof Knowledge
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
ZK-Flex: A Flexible and Scalable Framework for Accelerating Zero-Knowledge Proofs
arXiv:2606.03046v1 Announce Type: new Abstract: Zero-knowledge proofs (ZKP) allows a prover to convince a verifier of computational correctness without revealing private data, ensuring both privacy and verifiability. However, proof generation is highly compute-intensive, dominated by polynomial (POLY) and elliptic-curve (EC) operations. These workloads pose two key challenges for hardware acceleration: (1) efficiently supporting diverse large-precision modular multiplications, and (2)...
Zero knowledge verification for frontier AI training is possible
arXiv:2606.05433v1 Announce Type: new Abstract: Frontier AI governance frameworks increasingly use cumulative training compute as the primary criterion for designating high-impact models, but enforcement rests on self-reporting because no technical verification primitive for training exists. Any future international agreement on frontier AI faces the same problem at higher stakes: coordinated regulation of technologies with significant externalities has historically rested on technical...
Security of the Fischlin Transform in Quantum Random Oracle Model
arXiv:2602.17307v2 Announce Type: replace Abstract: The Fischlin transform yields non-interactive zero-knowledge proofs with straight-line extractability in the classical random oracle model. This is done by forcing a prover to generate multiple accepting transcripts through a proof-of-work mechanism. Whether the Fischlin transform is straight-line extractable against quantum adversaries has remained open due to the difficulty of reasoning about the likelihood of query transcripts in the...
$\pi$Creds: Privately Inferred Credentials
arXiv:2606.03771v1 Announce Type: new Abstract: Decentralized verifiable credential systems have seen limited deployment in practice. Existing constructions, built on zero-knowledge proofs, are complex, application-specific, and largely restricted to predicates over structured data. We present Privately Inferred Credentials ($\pi$Creds): privacy-preserving, legacy-compatible, decentralized verifiable credentials generated by trusted LLM inference over authenticated data.
I-(OT)^2: A Client-optimal Oblivious Transfer Protocol for IoT Devices
Announce Type: new Abstract: Oblivious Transfer (OT) is a fundamental cryptographic primitive enabling privacy-preserving computation and constitutes a core building block for secure multi-party computation while supporting a wide range of security-sensitive applications: private information retrieval, zero-knowledge proofs, and password-authenticated key exchange, to cite a few. While recent advances in OT extension have significantly reduced amortised costs, their reliance on batches of...
LPOR: A Layered Proof of Reserves Framework for Usable and Publicly Auditable Solvency Verification
arXiv:2606.08211v1 Announce Type: new Abstract: Proof of Reserves (PoR) enables centralized crypto exchanges to demonstrate that on-chain reserves are sufficient to cover customer liabilities. However, existing approaches, including Merkle-tree-based proofs and zero-knowledge PoR systems, remain difficult for everyday users to verify in practice, resulting in limited participation and weakened transparency. We introduce LPOR, a layered, usability-focused PoR framework that separates...
Age verification for social media, the beginning of the end for a free internet?
Age verification for social media – the beginning of the end for a free internet? So-called age verification for social media is spreading across the world, framed as an effort to create a safer internet for children. In reality, age verification lays the foundation for a fully government controlled internet.
ZX-Calculus:Trace-Indexed Dependent Types and Epistemic Semantics
Announce Type: new Abstract: We propose ZX-Calculus (Knowledge Evolution Calculus), a conservative extension of Martin-Lof Dependent Type Theory (MLTT) integrating trace-indexed types, presheaf non-monotone semantics, and constructive AGM belief revision. A Coq mechanisation accompanies the paper (34 complete proofs; zero admits for the two central results). FinTrace(s0,sn) is an inductive family of typed execution traces.
Mechanism Design Without Disclosure: Committing to and Running Hidden Mechanisms
arXiv:2302.05590v3 Announce Type: replace-cross Abstract: A central tenet in mechanism design is the ability to irrevocably commit to a mechanism. Commitment is achieved by public declaration, letting players verify incentive properties in advance and the outcome in retrospect. However, public declaration can reveal superfluous information that is private to the mechanism designer, such as her target function or costs.
Google Wallet ID passes will be available in select EU states this summer
Google Wallet ID passes will be available in select EU states this summer The company is also introducing a new age verification process in partnership with a European bank. Google has announced that Google Wallet will support digital IDs from select European Union states starting this summer.