iiinova — where your digital self keeps evolving

Reposted by socrates1024

ePrint Updates @eprint.ing.bot · 23/12/2025

A New Approach to Large Party Beaver-Style MPC with Small Computational Overhead (Aayush Jain, Huijia Lin, Nuozhou Sun) ia.cr/2025/2305

Abstract. Secure multi-party computation (MPC) enables N parties to jointly evaluate any function over their private inputs while preserving confidentiality. While decades of research have produced concretely efficient protocols for small to moderate numbers of participants, scaling MPC to thousands of parties remains a central challenge. Most of the existing approaches either incur per-party costs linear in N, due to pairwise computations, or rely on heavy cryptographic tools such as homomorphic encryption, which introduces prohibitive overheads when evaluating Boolean circuits.

In this work, we introduce a new lightweight approach to designing semi-honest MPC protocols with per-party, per-gate computation and communication costs that are independent of N. Our construction leverages the Sparse Learning Parity with Noise (Sparse LPN) assumption in the random oracle model to achieve per-gate costs of O(k² ⋅ c(λ)) computation and O(c(λ)) communication, where k is the sparsity parameter for the Sparse LPN assumption and c(λ) is an arbitrarily small super-constant in the security parameter λ. Assuming Sparse LPN remains hard for any super-constant sparsity, this yields the first semi-honest MPC protocol in the dishonest-majority setting with per-party per-gate costs bounded by an arbitrarily small super-constant overhead in λ.

Structurally, our MPC instantiates a Beaver style MPC with the required correlations generated efficiently. Departing from prior approaches that generate Beaver triples silently (Boyle et al., 2019; 2020; 2022) or using homomorphic computation (Damgård et al., 2012) for Beaver style MPC, the focus of this work rests on efficiently generating a weaker correlation. In particular, using Sparse LPN we show that if we relax the correctness requirement in generating random Beaver triples to permit a tunably small inverse-polynomial error probability, such triples can be silently generated with arbitrarily small super-constant per-party computation. We then show that such correlations can be used in an efficient online phase similar to Beaver’s protocol (with a tiny super-constant factor blow-up in communication).

021

Reposted by socrates1024

ePrint Updates @eprint.ing.bot · 28/08/2025

Constraint-Friendly Map-to-Elliptic-Curve-Group Relations and Their Applications (Jens Groth, Harjasleen Malvai, Andrew Miller, Yi-Nuo Zhang) ia.cr/2025/1503

Abstract. Hashing to elliptic curve groups is a fundamental operation used in many cryptographic applications, including multiset hashing and BLS signatures. With the recent rise of zero-knowledge applications, they are increasingly used in constraint programming settings. For example, multiset hashing enables memory consistency checks in zkVMs, while BLS signatures are used in proof of stake protocols. In such cases, it becomes critical for hash-to-elliptic-curve-group constructions to be constraint-friendly such that one can efficiently generate succinct proofs of correctness. However, existing constructions rely on cryptographic hash functions that are expensive to represent in arithmetic constraint systems, resulting in high proving costs.

We propose a constraint-efficient alternative: a map-to-elliptic-curve-group relation that bypasses the need for cryptographic hash functions and can serve as a drop-in replacement for hash-to-curve constructions in practical settings, including the aforementioned applications. Our relation naturally supports non-deterministic map-to-curve choices making them more efficient in constraint programming frameworks and enabling efficient integration into zero-knowledge proofs. We formally analyze the security of our approach in the elliptic curve generic group model (EC-GGM).

Our implementation in Noir/Barretenberg demonstrates the efficiency of our construction in constraint programming: it achieves over 23× fewer constraints than the best hash-to-elliptic-curve-group alternatives, and, enables 50-100× faster proving times at scale.

043

Reposted by socrates1024

ePrint Updates @eprint.ing.bot · 10/06/2025

Fairness in the Wild: Secure Atomic Swap with External Incentives (Hao Chung, Elisaweta Masserova, Elaine Shi, Sri AravindaKrishnan Thyagarajan) ia.cr/2025/1086

Abstract. Atomic swaps enable asset exchanges across blockchains without relying on trusted intermediaries, and are a key component of decentralized finance (DeFi) ecosystems. Recently, Chung, Masserova, Shi, and Thyagarajan introduced Rapidash (Financial Cryptography 2025), an atomic swap protocol that remains incentive compatible under user-miner collusion, by ensuring that the honest strategy forms a coalition-resistant Nash equilibrium. However, their model assumes a closed system where players act solely based on internal protocol incentives. In practice, participants may be influenced by external incentives such as off-chain rewards or adversarial bribes, which can undermine such equilibrium guarantees.

In this work, we introduce a new game-theoretic notion, bounded maximin fairness, which ensures that honest participants remain protected against rational adversaries with arbitrary but bounded external incentives. We construct an atomic swap protocol that satisfies this notion, while preserving the equilibrium properties of prior work in the absence of external influence.

As we show, our protocol is easy to implement and can be instantiated even in Bitcoin’s limited scripting language.

132

Reposted by socrates1024

Graze Social @graze.social · 05/05/2025

We've been given an amazing opportunity with our round of funding to build out the next generation of the social web. Today, we're starting an experiment in paying that forward. Introducing Graze Grants, a project to help get other ATProto projects off the ground.

Announcement post for Graze Grants (Beta) - we're funding new ATProto work, visit Graze.social (or really the link below in the next post) to apply

518459

Reposted by socrates1024

KOJAMF🤘🖤🤘 @kojamf.bsky.social · 28/05/2025

River Bandit Wildlife Rescue

42852103

socrates1024 @socrates1024.bsky.social · 04/06/2025

whenever I'm up early I make sure to send a lot of emails

110

socrates1024 @socrates1024.bsky.social · 17/05/2025

cops have their own distinct verb tense... like "I'm gonna have to ask you to step out of the vehicle" well go on then

170

Reposted by socrates1024

guille @lmao.bsky.social · 13/05/2025

what makes a good abstraction? (and other weird thoughts and tangents) Blogpost here: lmao.bearblog.dev/minimal-abst...

011

socrates1024 @socrates1024.bsky.social · 13/05/2025

pilots address the cabin "the winds are from the east at 3 knots and the cloud layer starts at 7000 feet" like that means anything to the passengers. I think theyre just pretending to be so unselfaware as to think everyone else is as obsessed with the weather too, affected hyper focus

000

socrates1024 @socrates1024.bsky.social · 13/05/2025

up late making slides for a conference that doesn't exist

010

Reposted by socrates1024

business goose🪿 @goose.art · 25/04/2025

good terminology clarity for people who are still confused by the idea of an "AppView"

121

Reposted by socrates1024

Sophie Greenwood @sjgreenwood.bsky.social · 10/03/2025

As such, we’re excited about this opportunity to put into practice the research ideas around individual and societal recommendation quality that our team has been thinking about (proceedings.neurips.cc/paper_files/..., dl.acm.org/doi/10.1145/...)

1192

Reposted by socrates1024

Nikhil Garg @nkgarg.bsky.social · 10/03/2025

Our vision is state-of-the-art paper recommendation that takes the best of "social" (what made academic twitter great) and "content-based" (using modern NLP). Overtime, we will add (optional!) features using follower graph, interactions, text… Only possible using Bluesky algorithmic feed features

1384

Reposted by socrates1024

Sophie Greenwood @sjgreenwood.bsky.social · 10/03/2025

While right now the feed is based only on users you follow, over time we plan to build opt-in algorithmic recommendations to help you discover paper-related content matching your interests from across #academicsky

1212

socrates1024 @socrates1024.bsky.social · 16/03/2025

firefly is kind of an "authentication methods" playground, android app is my favorite though

010

Reposted by socrates1024

Patton Oswalt @pattonoswalt.bsky.social · 29/12/2024

Who was in charge of font spacing for this episode of MR. ED?

1552255502549

Reposted by socrates1024

Lizzi Rust @lizzirust.bsky.social · 30/12/2024

Beavis and Butt-Head go to Silent Hill

84200005823

Reposted by socrates1024

marlo @marlo.ooo · 30/12/2024

6408

Reposted by socrates1024

wint @dril.bsky.social · 29/12/2024

Carter has passed. An accomplished man. A brilliant legacy. Although for many of us he died years ago when he refused to condemn, gamer gate

211227713032

Reposted by socrates1024

Shriram Krishnamurthi @shriram.bsky.social · 29/12/2024

"I contend that my knowledge is complete!" "Per what?!?" "Per Martin-Löf."

072

Reposted by socrates1024

ePrint Updates @eprint.ing.bot · 18/11/2024

Field-Agnostic SNARKs from Expand-Accumulate Codes (Alexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang) ia.cr/2024/1871

$Abstract. Efficient realizations of succinct non-interactive arguments of knowledge (SNARKs) have gained popularity due to their practical applications in various domains. Among existing schemes, those based on error-correcting codes are of particular interest because of their good concrete efficiency, transparent setup, and plausible post-quantum security. However, many existing code-based SNARKs suffer from the disadvantage that they only work over specific finite fields. In this work, we construct a code-based SNARK that does not rely on any specific underlying field; i.e., it is field-agnostic. Our construction follows the framework of Brakedown (CRYPTO ’23) and builds a polynomial commitment scheme (and hence a SNARK) based on recently introduced expand-accumulate codes. Our work generalizes these codes to arbitrary finite fields; our main technical contribution is showing that, with high probability, these codes have constant rate and constant relative distance (crucial properties for building efficient SNARKs), solving an open problem from prior work. As a result of our work we obtain a SNARK where, for a statement of size M , the prover time is O(MlogM) and the proof size is $O(\sqrt{M} )$. We demonstrate the concrete efficiency of our scheme empirically via experiments. Proving ECDSA verification on the secp256k1 curve requires only 0.23s for proof generation, 2 orders of magnitude faster than SNARKs that are not field-agnostic. Compared to the original Brakedown result (which is also field-agnostic), we obtain proofs that are 1.9–2.8× smaller due to the good concrete distance of our underlying error-correcting code, while introducing only a small overhead of 1.2× in the prover time.$ Image showing part 2 of abstract.

043

Reposted by socrates1024

ePrint Updates @eprint.ing.bot · 18/11/2024

Amigo: Secure Group Mesh Messaging in Realistic Protest Settings (David Inyangson, Sarah Radway, Tushar M. Jois, Nelly Fazio, James Mickens) ia.cr/2024/1872

Abstract. In large-scale protests, a repressive government will often disable the Internet to thwart communication between protesters. Smartphone mesh networks, which route messages over short range, possibly ephemeral, radio connections between nearby phones, allow protesters to communicate without relying on centralized Internet infrastructure. Unfortunately, prior work on mesh networks does not efficiently support cryptographically secure group messaging (a crucial requirement for protests); prior networks were also evaluated in unrealistically benign network environments which fail to accurately capture the link churn and physical spectrum contention found in realistic protest environments. In this paper, we introduce Amigo, an anonymous mesh messaging system which supports group communication through continuous key agreement, and forwards messages using a novel routing protocol designed to handle the challenges of ad-hoc routing scenarios. Our extensive simulations reveal the poor scalability of prior approaches, the benefits of Amigo’s protest-specific optimizations, and the challenges that still must be solved to scale secure mesh networks to protests with thousands of participants.

042

Reposted by socrates1024

Esther Schindler @estherschindler.bsky.social · 17/11/2024

Tried reading the dictionary in bed last night. Didn't finish it. Got up to P.

5596

Reposted by socrates1024

David Buchanan @retr0.id · 17/11/2024

I extended the record creation API a little bit to allow arbitrary base64-encoded DAG-CBOR bytes 🙃

3371

Reposted by socrates1024

Jay 🦋 @jay.bsky.team · 17/11/2024

This is a great community ethos. Did you know there’s also a “Newskies” feed with first posts from new users? I sometimes go in there and say hi to new folks coming on.

1034252666

Reposted by socrates1024

Red Lori Bright Eyes A Fucking Bitch @redloribrighteyes.bsky.social · 17/11/2024

You don't know any undocumented people. I repeat: You don't know any undocumented people.

1422942557

Reposted by socrates1024

Julia Evans @b0rk.jvns.ca · 17/11/2024

got oauth with bluesky to work with @mary.my.id's github.com/mary-ext/atc... library! everything worked the way it said it should here is a super basic example app I made that just logs in and shows you 5 people you follow github.com/jvns/bsky-oa..., just needed to fiddle with importmaps a bit

59917

Reposted by socrates1024

LegalEagle @legaleagle.tv · 17/11/2024

At least once a week I think to myself "maybe the rightwing ideologues are right, I live in a bubble so maybe my analysis is tainted by that." Then I remember: I'm reacting to things that Trump says on directly camera, unvarnished by any intermediaries.

1359074

Reposted by socrates1024

Alexandra Brumberg @nanobrumberg.bsky.social · 16/11/2024

I've entered my first graduate recruitment season as a professor, and I am going to go crazy reading these rec letters. Writers, please remember...

Avoiding gender bias in reference writing:
- Mention research & publications
- Keep it professional
- Don't stop now!
- Stay away from stereotypes

- Emphasize accomplishments, not effort
- Be careful raising doubt
- We all share bias

Adjectives to avoid:
caring, compassionate, hard-working, conscientious, dependable, diligent, dedicated, tactful, interpersonal, warm, helpful, successful, excellent, accomplished, outstanding, skilled, knowledgeable, insightful, resourceful, confident, ambitious, independent, intellectual

12516

Reposted by socrates1024

Nelson Coffee Roaster @nelsonbeans.com · 16/11/2024

視線を感じるなー

0331

Reposted by socrates1024

Julie @bbjubjub.fr · 03/10/2024

A #cryptography paper I like by J. Bonneau and @socrates1024.bsky.social: what if we didn't have public-key cryptography? It turns out that, in principle, we could still make a blockchain by using commit-and-reveal to prove knowledge of hash preimages jbonneau.com/doc/BM14-SPW...

jbonneau.com

011

Reposted by socrates1024

socrates1024 @socrates1024.bsky.social · 09/12/2023

lol the detective from 1971 just orders two cheeseburgers for lunch dig in tough guy

161

socrates1024 @socrates1024.bsky.social · 09/12/2023

lol the detective from 1971 just orders two cheeseburgers for lunch dig in tough guy

161

socrates1024 @socrates1024.bsky.social · 03/12/2023

Biopic must be short for Biographical Moving Picture

000

socrates1024 @socrates1024.bsky.social · 19/11/2023

This is not a hole of hell. It is a hole of glory

010

socrates1024 @socrates1024.bsky.social · 18/11/2023

Interesting,I l learned a about Mastodon by tweeting screencap from X

010

socrates1024 @socrates1024.bsky.social · 11/11/2023

the best way to predict the future is to eat it

120

socrates1024 @socrates1024.bsky.social · 30/10/2023

You've probably never seen an NFT with private metadata before, it requires a TEE based blockchain or similar, in this case Secret Network. twitter.com/socrates1024...

010