A tutorial Formal Verification using Lean for cryptographic engineers. Implement and prove correctness of the One-Time pad following a cryptography book.
Automated Verification of Proofs in the Universal Composability Framework with Markov Decision Processes
Designing cryptographic protocols and proving these rigorously secure is an arduous and challenging task. Among the methods commonly used to prove security of cryptographic protocols, formalizing it in Canneti's Universal Composability (UC) Framework offers several benefits: (1) Modular design, (2) demonstrating that security remains under arbitrary composition and concurrent execution, (3) the security against any computationally polynomially bound adversary. However, working within the UC Framework can be cumbersome, requires a long time commitment by the prover, and it is prone to errors. While utilization of proof assistants in Cryptography and IT Security is a prominent research area, proof assistants for UC are still in their infancy. Here we show our ongoing work to utilize model checking for verification of proofs in the UC Framework, which to the best of our knowledge is the first attempt to do so. In this work we (1) formally create a Markov Decision Process (MDP) encoding a given proof in the UC Framework, (2) define and proof notions of soundness and completeness for the constructed MDP, (3) implement a proof of concept and (4) demonstrate practical feasibility through experimental evaluation. In summary, in this work we lay out the formal foundations for model checking UC proofs and create a tool that can not only be used for proof verification but also as an assistant for developing proofs in the UC Framework.
. · openai/ten-proofs@d0e1ae7
Lean certificates accompanying proofs in mathematics and theoretical computer science - . · openai/ten-proofs@d0e1ae7
. · openai/ten-proofs@5a102c1
Lean certificates accompanying proofs in mathematics and theoretical computer science - . · openai/ten-proofs@5a102c1
Formal Verification Reference - Aura
This document describes the formal verification infrastructure that provides mathematical guarantees for Aura protocols through Quint model checking, Lean theorem proving, and Telltale session type verification.
. · openai/ten-proofs@94bc0fe
Lean certificates accompanying proofs in mathematics and theoretical computer science - . · openai/ten-proofs@94bc0fe
. · openai/ten-proofs@e9dce9a
Lean certificates accompanying proofs in mathematics and theoretical computer science - . · openai/ten-proofs@e9dce9a
attested.network — Proof of Payment for ATProtocol
An open specification for decentralized, cryptographically verifiable proof of payments.
ATProtocol Attestations: Cryptographic Signatures for the Decentralized Web - Nick's Blog
This post introduces the formal ATProtocol attestation specification, a framework for adding cryptographic signatures to ATProto records through two complementary patterns: inline attestations that embed signatures directly in records, and remote attestations that store proof in separate repository records. The specification prevents replay attacks through repository binding, uses CID-based content addressing for integrity, and provides the cryptographic foundation for verified credentials, trusted content, and authenticated interactions in the decentralized ATProtocol ecosystem.
badge.blue — CID-First Attestation Specification
Specification for CID-first attestations on AT Protocol records. Inline and remote cryptographic signatures with replay-attack prevention.
Decentralized Identity Verification using Zero-Knowledge Proofs: A Privacy-Preserving Authentication Framework
In the contemporary online interaction, digital iden- tity is central, but most systems follow a centralized provider like Google or Facebook. Although convenient, these models pose ma- jor risks to data breach, surveillance, and single point of failure. The proposed paper proposes a privacy-sensitive decentralized identity verification system that uses Zero-Knowledge Proofs (ZKPs) to allow users to make it through claims (e.g., age, citizen- ship, or enrollment) without any personal data being provided, thereby solving the challenges outlined in the paper. Our architecture integrates verifiable credentials, zero-knowledge-SNARKs and an issuer trust registry that is maintained on blockchain smart contracts to guarantee trustless verification and eliminate dependence on centralized authorities. Its system gives its users full control over credentials, allows reuse across applications, and does not expose data.A proof-of-concept implementation has shown the approach to be feasible with Circom and SnarkJS to generate proof, Solidity smart contracts to verify them, and a user interface implemented in React. Results of the evaluations showed that determination of the verification latency is low, the overhead to generate proofs is moderate, and no privacy leakage occurs. It can be used in potential applications such as education, e-governance, healthcare, finance, and online voting.
In Search of Hardness
Protocol studies, the next crypto cycle, and the next age of the world
Encrypted Spaces — Research preview
An architecture for collaborative applications where data is encrypted and operations are cryptographically verifiable.
google/longfellow-zk
Implementation of the Google Zero-Knowledge library for Identity Protocols.
Blink: Intent to Experiment: Signature-based Integrity
Blink: Intent to Experiment: Signature-based Integrity
groups.google.com
