BLUE
Login
CP
Christopher Patton
@cjpatton.bsky.social
cjpatton.net
126 followers94 following75 posts
OverviewPostsReplies
CPcjpatton.bsky.social

Hey, I don't know which of you nerds needs to hear this, but: please, please, please, please, pretty please, please vote, and tell your friends to vote.

0
Reposted by Christopher Patton
DCdurumcrustulum.com

eprint.iacr.org/2024/1229

0
Reposted by Christopher Patton
WEworfemail.bsky.social

Father, Is there a voting guide for our local elections? I cannot tell from their statements which candidates have more honor. Worf

3
CPcjpatton.bsky.social

The currency type

1
CPcjpatton.bsky.social

Dang it feels like crypto Twitter is coming for bluesky :(

1
Reposted by Christopher Patton
AOannoyedobrien.bsky.social

Would someone care to EXPLAIN why there is a TRAIL OF TOILET PLUNGERS leading DIRECTLY TO MY QUARTERS

21
Reposted by Christopher Patton
EUeprint.bsky.social

The Concrete Security of Two-Party Computation: Simple Definitions, and Tight Proofs for PSI and OPRFs (Mihir Bellare, Rishabh Ranjan, Doreen Riepel, Ali Aldakheel) ia.cr/2024/1476

Abstract. This paper initiates a concrete-security treatment of two-party secure computation. The first step is to propose, as target, a simple, indistinguishability-based definition that we call InI. This could be considered a poor choice if it were weaker than standard simulation-based definitions, but it is not; we show that for functionalities satisfying a condition called invertibility, that we define and show is met by functionalities of practical interest like PSI and its variants, the two definitions are equivalent. Based on this, we move forward to study the concrete security of a canonical OPRF-based construction of PSI, giving a tight proof of InI security of the constructed PSI protocol based on the security of the OPRF. This leads us to the concrete security of OPRFs, where we show how different DH-style assumptions on the underlying group yield proofs of different degrees of tightness, including some that are tight, for the well-known and efficient 2H-DH OPRF, and thus for the corresponding DH PSI protocol. We then give a new PSI protocol, called salted-DH PSI, that is as efficient as DH-PSI, yet enjoys tighter proofs.
0
Reposted by Christopher Patton
CGcoachgowron.bsky.social

Do not be discouraged when you fail at something new. If it was easy, its value would be as low as the effort spent to obtain it. A true warrior knows that sometimes you have to work hard to make it easy.

8
CPcjpatton.bsky.social

That's too blue

1
CPcjpatton.bsky.social

Hell yeah 👍

0
CP
Christopher Patton
@cjpatton.bsky.social
cjpatton.net
126 followers94 following75 posts
HomePopularExplore