Sunscreen/sunscreen_docs/src/SUMMARY.md at main · Sunscreen-tech/Sunscreen

google/heir

A compiler for homomorphic encryption

HEIR: Homomorphic Encryption Intermediate Representation

HEIR is a compiler toolchain for fully homomorphic encryption (FHE). We aim to be the industry-standard compiler for FHE. Application developers, compiler engineers, hardware designers, and cryptography researchers can build upon HEIR to accelerate the research and development of production-strength privacy-first software systems.

Homomorphically Encrypting CRDTs | jakelazaroff.com

Homomorphic encryption allows a computer to run programs on encrypted data. Learn how homomorphic encryption works through interactive examples, build a homomorphically encrypted CRDT and see whether it has promise for local-first software.

Proposal: standard.site.declaration

Proposal: standard.site.declaration Draft for Discussion Abstract AT Protocol provides portable identity, portable content, and portable social graphs. What it currently lacks is a standard mechanism for discovering machine-readable declarations associated with digital content. Today, creators and organisations publish declarations about digital assets through websites, registries, the C2PA provenance framework, and other systems. These declarations may describe provenance, copyright ownership...

roc-advent-2025.md

roc-advent-2025.md · GitHub

CIDs: What You Need to Know and Why, Part 1 - Nick's Blog

A deep dive into Content Identifiers, the self-describing cryptographic fingerprints that form the foundation of ATProtocol’s data model.

gavischneider/awesome-llm-wiki

A curated list of foundational blueprints, functional frameworks, and technical guides for building compounding, AI-compiled knowledge bases.

Reapplying knowledge on sunscreen and photoprotection: A narrative review

google/longfellow-zk

Implementation of the Google Zero-Knowledge library for Identity Protocols.

graham.systems/cistern

Encrypted, ephemeral, private memos on atproto

CE Labs

Secure systems engineering, verified all the way down to the cryptography.

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.

Cryptographic Autonomy License

1. Purpose This License gives You unlimited permission to use and modify the software to which it applies (the “Work”), either as-is or in modified form, for Your private purposes, while protecting…

Permissioned Data Diary 1: To Encrypt or Not to Encrypt - Daniel's Leaflets

The first in a series of posts about major design decisions along the way to a permissioned data protocol for atproto.