#ITCS
LightNews LightNews
harmaagriffin.bsky.social
Itcs such an insane amount of work, congrats!
November 13, 2025 at 10:24 AM
sydneycompsci.bsky.social
🎉 Clément Canonne's paper "Interactive Proofs For Distribution Testing With Conditional Oracles" has been accepted at #ITCS2026!

🔗 ITCS'26: itcs-conf.org

Coauthored with Ari Biswas (University of Warwick), Mark Bun, and Satchit Sivakumar (Boston University)

#interactiveproofs #algorithms #theory
November 11, 2025 at 1:20 AM
ccanonne.github.io
Accepted at #ITCS2026: congratulations to Abigail and Vikrant!
itcs-conf.org @abigailgentle.com
November 10, 2025 at 10:32 PM
aaroth.bsky.social
Did your fairness/privacy/CS&Law/etc paper just get rejected from ITCS? Oh FORC! Submit tomorrow and join us at Harvard this summer.
gautamkamath.com Gautam Kamath @gautamkamath.com · 3d
Foundations of Responsible Computing (FORC) is a super exciting new conference focused on the intersection of mathematical research and society. It's also a fantastic and vibrant community.

Check out the CfP, with two deadlines. Also follow the new BSky account @forcconf.bsky.social !
forcconf.bsky.social Foundations of Responsible Computing @forcconf.bsky.social · 3d
📢 In case you missed it: the first-cycle deadline for FORC 2026 is *tomorrow*, November 11. Submit your best work on mathematical research in computation and society, writ large.

Too soon? We'll also have a second-cycle deadline on February 17, 2026.

CfP: responsiblecomputing.org/forc-2026-ca...
November 10, 2025 at 6:12 PM
eprint.ing.bot
On Reed–Solomon Proximity Gaps Conjectures (Elizabeth Crites, Alistair Stewart) ia.cr/2025/2046
Abstract. We disprove a range of conjectures for Reed-Solomon codes underpinning the security and efficiency of many modern proof systems, including SNARKs based on FRI (Ben-Sasson-Bentov-Horesh-Riabzev, ICALP’18), DEEP-FRI (Ben-Sasson-Goldberg-Kopparty-Saraf, ITCS’20), STIR (Arnon-Chiesa-Fenzi-Yogev, CRYPTO’24), and WHIR (Arnon-Chiesa-Fenzi-Yogev, preprint). Concretely, we prove that the following conjectures are false: 1. The correlated agreement up-to-capacity conjecture of Ben-Sasson-Carmon-Ishai-Kopparty-Saraf (J. ACM’23), 2. The mutual correlated agreement up-to-capacity conjecture of WHIR, 3. The list-decodability up-to-capacity conjecture of DEEP-FRI, which follows from existing results in the literature. We then propose minimal modifications to these conjectures up to the list-decoding capacity bound. Our second main contribution is a proof that correlated agreement with small enough error probability implies list decoding of Reed-Solomon codes. Thus, any future results on our correlated agreement conjectures with small enough error probability would imply similar results in classical list decoding. A reduction from proximity gaps to list-decodability was heretofore a natural open problem. Image showing part 2 of abstract.
November 5, 2025 at 8:58 PM
stephenjwt.bsky.social
🧵A thread of my quick take-aways from today’s federal budget and #climate competitiveness strategy on #renewables:

Good:
Long-overdue Clean Electricity ITCs

Bad:
$$ for fossil fuels, greenwashing
Devastating cuts across gov
Only vagueness, not bold moves on renewables

#cdnpoli #energysky

1/x
stephenjwt.bsky.social Stephen Thomas @stephenjwt.bsky.social · 9d
This budget is sure to be a doozy, with lots of bad, and hopefully some good.

I'll be looking out for big investments in an east-west grid based on #renewables, including:
🗼$20B for transmission and grid upgrades
🏡$6.5B for efficiency
🤝$5B for Indigenous-led projects
👷‍♀️key labour supports

#cdpoli
November 4, 2025 at 10:03 PM
jginsburg.bsky.social
Itcs unfair only people in NYC can vote for mayor, if they let people who didn't live there but hated NYC vote, Cuomo would be neck and neck
November 3, 2025 at 9:09 PM
pressportal.co.za
Fastest Response Wins As ITCs Adapt To Shorter Booking Cycles In Post-Pandemic Travel Market - MyPressportal - Free Press Releases Southern Africa
#mypressportal #pressrelease #AfricaNewsroom #bizcommunity #publicrelations #africa #southafrica
Fastest Response Wins As ITCs Adapt To Shorter Booking Cycles In Post-Pandemic Travel Market - MyPressportal - Free Press Releases Southern Africa
ITCs are operating in an “urgency economy” where the fastest quote often wins the booking.Chantal Gouws, General Manager of Envoyage South Africa, …
pressportal.co.za
October 28, 2025 at 5:52 PM
frenzythebat.bsky.social
"Dwellin' on the past, itcs burning up my brain! Everyone that burns has to learn from the pain!"
October 27, 2025 at 8:03 AM
kitaensilva.bsky.social
itcs not their fault that they were a step ahead of you and already managed to attempt each of your suggestions

so

Why the fuck are you yelling?

Congratulations on compounding the issues that person has to deal with in their most critical time of need and shattering their trust in you.

Good job.
October 20, 2025 at 7:02 PM
enkinaru.bsky.social
itcs time for ypur regularly scheduled medieval moths (and some medieval arachnids, too)

#traditional #fantasy #anthro #moth #spider #oc
October 20, 2025 at 3:38 PM
next-ca.bsky.social
“NEXT For Inclusiveness Target Countries”
The one day workshop “NEXT for Inclusiveness Target Countries” is fully devoted to Inclusiveness Target Countries (ITCs) representatives, it will provide an opportunity to present research activities of the invited speakers...
ca-next.eu/next-for-itc/
One Day Workshop: "NEXT for Inclusiveness Target Countries" - NEXT
one day workshop ITC
ca-next.eu
October 20, 2025 at 2:44 PM
thosc747.bsky.social
I don't think John Roberts has gotten enough blame for this mess. Why has he been so intent on immunizing Trump? Why is he always on the side of corporations? The answer is probably not where we think. My guess itcs ask to control womens' pregnancies.
October 20, 2025 at 1:08 AM
frenzythebat.bsky.social
You should try the brand "Empyre" itcs not the correct brand but it pops just as well.
October 19, 2025 at 7:13 AM
frenzythebat.bsky.social
as itcs own game it was pretty good, I had a lot of fun with it.

But starting with it can be either a good thing or a bad thing as the rest of the games are different.
October 19, 2025 at 6:21 AM
ollisyk.bsky.social
The longetivity of class of 1992 is just insane! With this rate all three of them would play on pro tour on merit even on their 70's lol. And when you think both Jimmy and Ken have required ITCs already for ages. Thinking other sports only the big three of tennis can be compared to RO'S, JH and MJW
October 14, 2025 at 10:04 PM
jrosemama.bsky.social
Horror stories in my industry keep coming true:

ITCs are expiring sooner
OSW project permits cancelled
DOE LPO loans cancelled
Coal industry getting subsidized
Demand rises, renewables attacked

All could be summarized with:

American energy industry retreats

Or

Trump made energy announcement
October 12, 2025 at 2:23 PM
eprint.ing.bot
Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions (George Lu, Jad Silbak, Daniel Wichs) ia.cr/2025/1877
Abstract. We study error-detection and error-correction codes for computationally bounded adversarial channels. We consider seeded codes where the polynomial-time encoding and decoding procedures share a public random seed, but are otherwise deterministic. An adversarial channel gets this seed and can perform arbitrary polynomial-time computation to adaptively select both the message to be encoded and a bounded number of errors to be added to the resulting codeword. The goal is to detect or correct such errors with overwhelming probability, while achieving better trade-offs between rate and error tolerance than those possible for computationally unbounded channels. For large alphabets, prior work (ITCS ’25) achieves essentially optimal parameters under minimal cryptographic assumptions. However, for the binary alphabet, prior works (TCC ’20, EUROCRYPT ’25) either only achieved a weaker notion of selective security under the learning with errors (LWE) assumption, or relied on non-standard cryptographic assumptions to get the full notion of adaptive security. In this work, we construct binary codes that achieve the full notion of adaptive security assuming trapdoor hashing, which can in turn be instantiated under a variety of standard cryptographic assumptions such as LWE, or Decisional Diffie-Hellman (DDH), or Quadratic Residuosity (QR), or Decisional Composite Residuosity (DCR). For error detection, our codes get essentially optimal rate R ≈ 1 and relative error tolerance $p \approx \frac{1}{2}$. For error correction, they can uniquely correct p < 1/4 fraction of errors with a rate R matching that of the best known list-decodable codes for this error tolerance. As a central technical tool of potentially independent interest, we construct multi-input correlation intractable hashing for “shifted output relations” under the standard cryptographic assumptions above. Image showing part 2 of abstract.
October 11, 2025 at 11:04 PM
jrosemama.bsky.social
Waste not, want not.

Two story Solar+BESS. Reinforce the building for the module/rack loads, create access for O&M. Have enough ventilation & fire safety for the batteries. It would be a passion project, but still profitable.

Now’s the time to do it. Just 9 more months to SOC for 100% ITCs!
October 11, 2025 at 4:12 AM
eprint.ing.bot
Quantum Cryptography and Hardness of Non-Collapsing Measurements (Tomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa) ia.cr/2025/1840
Abstract. One-way puzzles (OWPuzzs) introduced by Khurana and Tomer [STOC 2024] are a natural quantum analogue of one-way functions (OWFs), and one of the most fundamental primitives in ‘’Microcrypt” where OWFs do not exist but quantum cryptography is possible. OWPuzzs are implied by almost all quantum cryptographic primitives, and imply several important applications such as non-interactive commitments and multi-party computations. A significant goal in the field of quantum cryptography is to base OWPuzzs on plausible assumptions that will not imply OWFs. In this paper, we base OWPuzzs on hardness of non-collapsing measurements. To that end, we introduce a new complexity class, SampPDQP, which is a sampling version of the decision class PDQP introduced in [Aaronson, Bouland, Fitzsimons, and Lee, ITCS 2016]. We show that if SampPDQP is hard on average for quantum polynomial time, then OWPuzzs exist. We also show that if SampPDQP ⊈ SampBQP, then auxiliary-input OWPuzzs exist. SampPDQP is the class of sampling problems that can be solved by a classical polynomial-time deterministic algorithm that can make a single query to a non-collapsing measurement oracle, which is a’’magical” oracle that can sample measurement results on quantum states without collapsing the states. Such non-collapsing measurements are highly unphysical operations that should be hard to realize in quantum polynomial-time, and therefore our assumptions on which OWPuzzs are based seem extremely plausible. Moreover, our assumptions do not seem to imply OWFs, because the possibility of inverting classical functions would not be helpful to realize quantum non-collapsing measurements. We also study upperbounds of the hardness of SampPDQP. We introduce a new primitive, distributional collision-resistant puzzles (dCRPuzzs), which are a natural quantum analogue of distributional collision-resistant hashing [Dubrov and Ishai, STOC 2006]. We show that dCRPuzzs imply average-case hardness of SampPDQP (and therefore OWPuzzs as well). We also show that two-message honest-statistically-hiding commitments with classical communication and one-shot message authentication codes (MACs), which are a privately-verifiable version of one-shot signatures [Amos, Georgiou, Kiayias, Zhandry, STOC 2020], imply dCRPuzzs. Image showing part 2 of abstract. Image showing part 3 of abstract.
October 8, 2025 at 3:52 AM
tiebreakertimes.bsky.social
PNVF blocks ITCs, forces #PVL2025 to launch Reinforced Conference with all-Filipino lineups

#ReadMore 👉 tbti.me/s22tjo
PNVF Bbocks ITCs, forces PVL to launch Reinforced Conference with all-Filipino lineups
The PVL Reinforced Conference opened without foreign imports after the PNVF withheld ITC endorsements
tbti.me
October 7, 2025 at 8:48 AM
violaviolette.bsky.social
I do believe that some people are actually using it as a cover for racism, but those people were already racist. It's the usual dogwhistling. Itcs however that the anti-clanker side is using it, currently, as a cover for ableism.
October 5, 2025 at 12:59 PM
czarmikhail.bsky.social
Net Operating Loss (NOL) Carry forward.
Qualified Business Income (QBI) Deduction
Investment Tax Credits (ITCs)
Corporate Income Tax Reductions
Research and Development (R&D) Tax Credits
Targeted State or Local Tax Incentives offset if federal government fails funding shortfall which state can keep.
October 1, 2025 at 9:23 PM
tunyash.bsky.social
It completely covers ITCS T_T
October 1, 2025 at 1:07 PM
eprint.ing.bot
Untelegraphable Encryption and its Applications (Jeffrey Champion, Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa) ia.cr/2025/1765
Abstract. We initiate the study of untelegraphable encryption (UTE), founded on the no-telegraphing principle, which allows an encryptor to encrypt a message such that a binary string representation of the ciphertext cannot be decrypted by a user with the secret key, a task that is classically impossible. This is a natural relaxation of unclonable encryption (UE), inspired by the recent work of Nehoran and Zhandry (ITCS 2024), who showed a computational separation between the no-cloning and no-telegraphing principles. In this work, we define and construct UTE information-theoretically in the plain model. Building off this, we give several applications of UTE and study the interplay of UTE with UE and well-studied tasks in quantum state learning, yielding the following contributions: - A construction of collusion-resistant UTE from standard secret-key encryption (SKE). We additionally show that hyper-efficient shadow tomography (HEST) is impossible assuming collusion-resistant UTE exists. By considering a relaxation of collusion-resistant UTE, we are able to show the impossibility of HEST assuming only pseudorandom state generators (which may not imply one-way functions). This almost unconditionally answers an open inquiry of Aaronson (STOC 2018). - A construction of UTE from a quasi-polynomially secure one-shot message authentication code (OSMAC) in the classical oracle model, such that there is an explicit attack that breaks UE security for an unbounded polynomial number of decryptors. - A construction of everlasting secure collusion-resistant UTE, where the decryptor adversary can run in unbounded time, in the quantum random oracle model (QROM), and formal evidence that a construction in the plain model is a challenging task. We additionally show that HEST with unbounded post-processing time (which we call weakly-efficient shadow tomography) is impossible assuming everlasting secure collusion-resistant UTE exists. - A construction of secret sharing for all polynomial-size policies that is resilient to joint and unbounded classical leakage from collusion-resistant UTE and classical secret sharing for all policies. - A construction (and definition) of collusion-resistant untelegraphable secret-key functional encryption (UTSKFE) from single-decryptor functional encryption and plain secret-key functional encryption, and a construction of collusion-resistant untelegraphable public-key functional encryption from UTSKFE, plain SKE, and plain public-key functional encryption. Image showing part 2 of abstract. Image showing part 3 of abstract.
September 30, 2025 at 2:48 AM