Polylog on Oblivious Transfer and Zero Knowledge Protocols

My comment:

That was a really clear explanation, thank you. Can you talk sometime about how it is that these protocols are not used for basic data protection? I mean why is age verification such a big deal? Can't a zero knowledge protocol be used to verify someone's age without divulging their full identity? I know there is probably a different motive behind the age verification thing, but why does nobody talk about alternative solutions that don't involve personal identity data?

I think it has much wider application though.

For example, say I want to order and pay for something and have it delivered to me without divulging my identity or the delivery address or my bank details. One would think that it would be possible for my bank to give me some proof that I have commited to pay a certain amount to some entity, a sort of single use cheque, which I could then commit to using to pay the supplier, who then commits to send the goods via a chain of carriers who each similary commit to collecting and delivering the parcel. The supplier could then validate the cheque with their bank, again without knowing my name or account number or even the name of my bank. This is the sort of thing that drug traffickers can do, so why can't the rest of us use it to prevent big businesses ripping us off? See their blog post related to the following video: https://vasekrozhon.wordpress.com/2025/03/17/zero-knowledge-proofs/ and also my post Ways to Do Telecommunications.

The reason they're so good is they beta test their videos on their Patreon sponsors! 

Subscribe to Polylog. 

Subscribe to Polylog2.

Comments

Post a Comment

Popular posts from this blog

Steven Johnson - So You Think You Know How to Take Derivatives?

Image
A derivative is linearisation, and differential calculus is essentially linear algebra, ...  See  Freya Holmér - Why Can't You Multiply Vectors?  and  Freya Holmér on Continuity of Splines . See also the MIT OCW page:  Matrix Calculus For Machine Learning And Beyond  (Alan Edelman, Steven G. Johnson) Subscribe to The Julia Programming Language . Alan Edelman talking about expressing mathematics as computer code. The idea is that you can use computer languages to communicate mathematical ideas precisely to other people. See my comments about functional programming languages here:  https://prooftoys.org/ian-grant/hm/ Subscribe to TEDx Talks .
Read more

How Could One Unify CMU and MIT

Image
I mean, how to get the best of the two different philosophies of computation. One is based on typed programming languages and the other on engineering with diagrams . This is about practical computing and the cost and feasibility of software development in general. Here is the problem: We have a lot of algorithms which can all be described abstractly using some sort of pseudocode, or perhaps using some particular language (usually Python!). These algorithms are often well-studied and a lot is known about them in terms of their computational complexity in time and space. Substantive practical software systems invariably employ many such algorithms, often implemented in libraries with more or less well-specified APIs. But very few of these libraries are capable of interoperating because they are either packages written in some specific programming language like Java or Haskell, say, or they are written in C and used as object code, or they are written in an interpreted language like Sc...
Read more

Tensor Fields and Simplicial Complexes

Image
Listening to Freya Holmér last night I started to get glimmers of an idea I had long ago about how to represent vector spaces in computational processes using this recursive abstract type :  abstype 'a point = POINT   of {getx :  'a vector,       diff :  'a point -> 'a point,       move :  'a point -> 'a point,       scale : 'a -> 'a point,       proj :  'a point -> 'a} with    fun new i (op +) (op -) (op * ) dot =    let fun self x =  POINT       {getx = x,        move = fn (POINT pr) =>           (self (x + (#getx pr))),        diff = fn (POINT pr) =>          self (x - (#getx pr)),        scale = fn i =>          (self (x * i)),        proj = fn (POINT pr) =>     ...
Read more