Hello World
This is a demo of the Delegation-oriented FedCM Devtrials. Step 0) Download and open chrome canaries Step 1) Enable necessary development flags. Type chrome://flags in the url bar and enable the following flags #fedcm-without-well-known-enforcement #fedcm-delegation (in devtrials) Step 2) Use my own test issuer or enter yours: https://issuer.sgo.to/fedcm.json Step 3) Click on this button Sign-in…
This is a demo page for https://github.com/fedidcg/login-element Click on the following element: Sign-in with my IdP
Verified email sign-in Sign in with your verified email Use browser autofill to prove control of your email address and continue without leaving this page. Signed by your email provider Bound to this browser session No emailed code to copy One-time code Verify code Log out Email address Sign in When your browser supports EVP, autofill adds a signed verification token before sign-in submits.…
This is an interactive explanation of the protocol described here . Alice wants to prove that it knows x = such that g ^ x mod p = y without revealing to Bob the value of x , having agreed ahead of time on a large prime number p = , a primitive root g = and an integer y = . The way they accomplish that is by: Alice generates a random number r = and commits to it by computing C = g ^ r mod p = ^…
This is a compilation of a series of discussions I had with Dirk Balfanz. It is also based on things I learned from Dick Hardt. TL;DR; Identity Verification is not Authentication. Passkeys are great. Use the former for Sign-Up and the later for Sign-In. For the last couple of years, I get asked a variation of "Sam, what's your opinion on passkeys?" in relationship to OpenID/SAML and FedCM . My…
Context Moses Schönfinkel's inspiration came from the recently discovered result that all of the known operators in propositional logic ( ~a , a && b , a || b , a => b and a <=> b ) could be reduced to / derived from a single operator: nand . Notation Notation: a tree (xy) can be thought as a function x applied to an argument y . When evaluated, the tree returns a value. The function, argument or…
Loading and verifying set.mm . 0% Downloading and parsing
This is a client-side exploration of metamath's set.mm , which is verified here . This downloads a 40MB file, which takes a while to load and parse. But once it is parsed, you can navigate the database below:
This is an open study of RSA Signatures from here and here . Signatures Alice wants to send a m = to Bob and prove that the message came from her Alice constructs her public and private keys ( how and why? ): Alice starts by picking two large prime numbers p = and q = Alice then computes n = n Alice selects an e = . Alice finally d = d . Alice has then a public key e = e , n = = n and private key…