#assumption
LightNews LightNews
kerovon.bsky.social
My assumption is that it means Kash Patel finished destroying sections of it.
November 17, 2025 at 2:41 AM
eprint.ing.bot
Quantum-safe Identity-binding Password Authenticated Key Exchange Protocols (Pratima Jana, Ratna Dutta) ia.cr/2025/2107
Abstract. Password-based Authenticated Key Exchange (${\sf PAKE}$) is a widely acknowledged, promising security mechanism for establishing secure communication between devices. It enables two parties to mutually authenticate each other over insecure networks and generate a session key using a low-entropy password. However, the existing PAKE protocols encounter significant challenges concerning both security and efficiency in the context of the (IoT). In response to these challenges, we contribute to the advancement of post-quantum secure PAKE protocols tailored for IoT applications, enriching the existing landscape. In this study, we introduce two novel protocols, PAKE- and PAKE-, designed to address these concerns and enhance the security standards of PAKE protocol. While PAKE- is secure under lattice-based hardness assumptions, PAKE- derives its security from isogeny-based hard problems. Our lattice-based protocol PAKE- is secure based on the (PWE) assumption and the (DRLWE) assumption and our isogeny-based protocol PAKE- is secure based on the hardness of the (GAIP) and the (CSSDH) problem in the Random Oracle Model (ROM). We present a comprehensive security proof in a conventional game-based indistinguishability security model that addresses offline dictionary attacks, replay attacks, compromise attacks for both parties (client and server) and perfect forward secrecy. Additionally, our proposed PAKE protocols are the first post-quantum secure PAKEs that achieve identity privacy and resistance to pre-computation attacks. Through rigorous performance evaluations, the paper demonstrates that the proposed PAKE schemes are ultralight and exhibit notable advantages in terms of total computation cost and enhanced security properties when compared to the existing protocols. More positively, both the proposed PAKE are optimal in the sense that they achieve mutual authentication explicitly in only three rounds which is the least number of rounds required for acquiring mutual authentication between two parties. Image showing part 2 of abstract.
November 17, 2025 at 2:24 AM
liatrelle.etheirys.social
@lady-deborel.bsky.social ok i gotta ask bc i've been wondering pshfhsf would you say meg & estinien's friendship is casual enough that he just uses her first name to address her? bc i've been working under that assumption but i wanna get it right lol
November 17, 2025 at 2:23 AM
kv417.bsky.social
They are working hard at eliminating jobs for people while simultaneously telling people we need to make more babies, population is receding, need replace the boomers dying off. So are they under the assumption that the boomers are holding all of the jobs that these babies will eventually gain?
November 17, 2025 at 2:23 AM
eprint.ing.bot
Quantum Voting Protocol from Classical Assumption (Tingyu Ge, Mingqiang Wang, Xiaolei Wang, Xinyuan Zhao) ia.cr/2025/2104
Abstract. Quantum voting allows us to design voting scheme by quantum mechanics. The existing quantum voting protocols mainly use quantum entangled states. However, the existing protocols rarely consider the problem of repeated voting and tampered voting by malicious voters, and hybrid quantum voting protocol has not been discussed. In this paper, we use EFI pairs (Entity-Friendly Integer pairs) instead quantum entangled states to address the shortage of existing protocols, and propose a new quantum voting protocol. Our protocol is structured to avoid repeated voting by any voter, and can prevent the leakage of voters’ voting information. The security of our protocol can be finally reduced to a classical assumption i.e. BQP = QMA. Combined with quantum key distribution (QKD), we further optimize the protocol to prevent malicious adversaries from interfering with the final voting results. Moreover, we use extended noisy trapdoor claw-free function (ENTCF) to construct the first hybrid quantum voting protocol, which allows a classical voter to interact with a quantum center through a classical channel to complete the voting process. Image showing part 2 of abstract.
November 17, 2025 at 2:09 AM
eprint.ing.bot
Threshold Batched Identity-Based Encryption from Pairings in the Plain Model (Junqing Gong, Brent Waters, Hoeteck Wee, David J. Wu) ia.cr/2025/2103
Abstract. In a batched identity-based encryption (IBE) scheme, ciphertexts are associated with a batch label tag^(*) and an identity id^(*) while secret keys are associated with a batch label tag and a set of identities S. Decryption is possible whenever tag = tag^(*) and id^(*) ∈ S. The primary efficiency property in a batched IBE scheme is that the size of the decryption key for a set S should be independent of the size of S. Batched IBE schemes provide an elegant cryptographic mechanism to support encrypted memory pools in blockchain applications. In this work, we introduce a new algebraic framework for building pairing-based batched IBE. Our framework gives the following: First, we obtain a selectively-secure batched IBE scheme under a q-type assumption in the plain model. Both the ciphertext and the secret key consist of a constant number of group elements. This is the first pairing-based batched IBE scheme in the plain model. Previous pairing-based schemes relied on the generic group model and the random oracle model. Next, we show how to extend our base scheme to a threshold batched IBE scheme with silent setup. In this setting, users independently choose their own public and private keys, and there is a non-interactive procedure to derive the master public key (for a threshold batched IBE scheme) for a group of users from their individual public keys. We obtain a statically-secure threshold batched IBE scheme with silent setup from a q-type assumption in the plain model. As before, ciphertexts and secret keys in this scheme contain a constant number of group elements. Previous pairing-based constructions of threshold batched IBE with silent setup relied on the generic group model, could only support a polynomial number of identities (where the size of the public parameters scaled linearly with this bound), and ciphertexts contained O(λ/log λ) group elements, where λ is the security parameter. Finally, we show that if we work in the generic group model, then we obtain a (threshold) batched IBE scheme with shorter ciphertexts (by 1 group element) than all previous pairing-based constructions (and without impacting the size of the secret key). Our constructions rely on classic algebraic techniques underlying pairing-based IBE and do not rely on the signature-based witness encryption viewpoint taken in previous works. Image showing part 2 of abstract. Image showing part 3 of abstract.
November 17, 2025 at 2:09 AM
eprint.ing.bot
Tag Functions and Their Applications to Lattice-based Signatures and IBEs — Compact Designs and Tighter Security (Parhat Abla) ia.cr/2025/2100
Abstract. The existing lattice-based signature and IBE schemes suffer from the non-compactness of public keys or larger reduction loss in the security analysis. Thus we solve and improve those deficiencies as follows: – First, we construct a lattice-based short signature scheme with a compact verification key in the standard model based on the ring short integer solution (RSIS) assumption. Under the same com- pactness, the ring modulus of our signature scheme is significantly smaller than the compact sig- nature scheme of Alperin-Sheriff (PKC 2015). More importantly, our signature scheme achieves better reduction loss than all the previous confined guessing-based signatures. In other words, our signature scheme achieves better security and efficiency simultaneously. – Secondly, we further design a short signature scheme with a nearly compact public key size and an even smaller reduction loss. Our second signature scheme achieves even better reduction loss than our first signature scheme yet at the cost of increasing the public key to a super-constant number of ring vectors. – Last but not least, we construct an adaptively secure compact IBE scheme from the lattice as- sumptions and the truncation collision-resistant hash functions (TCRHF) introduced by Jager and Kurek (ASIACRYPT 2018). Note that the previous TCRHF-based IBE schemes are not even close to compactness. The above improvements mainly benefited from our compact design of the tag functions and their more compact homomorphic evaluations. We also believe that our newly designed tag function may find new applications in designing other cryptographic schemes, like ABE and others. Image showing part 2 of abstract.
November 17, 2025 at 2:08 AM
rotonomics.bsky.social
What? The argument is about whether he IS Mossad, not something downstream of the assumption he is.
November 17, 2025 at 2:05 AM
tacomasterstudios.bsky.social
Yeah, nowadays, but this is still under the assumption that it launches in 2005-2007 or earlier.

Ironically, after they purchased Sparrowhawk, 2009 saw them really start to push the Universal name more internationally.
November 17, 2025 at 2:04 AM
zelmo-9.bsky.social
That's Joe's litmus test? Maybe start by trying to put all those Executive Branch 3 letter agencies back together (assuming free and fair elections, which is one hell of an assumption) & build an E. Wing later. Priorities.

AI analyzed this, those people have <2 min to get out, i.e. everybody died.
November 17, 2025 at 2:01 AM
runewuff.bsky.social
Yeougui - "As a professional artist, I can't rely on optimism or wishful thinking. My livelihood depends on stability, so I operate with the assumption that policies can shift at any time..." (more)
November 17, 2025 at 1:56 AM
jurfftt.bsky.social
Something something, KitKat, something something, AI. Some of the are arguments stronger than others, but most just work backwards from their assumption that they are bad.
November 17, 2025 at 1:56 AM
powerful.crabf.art
It was my assumption that between Trump, CIA, and Mossad one of them did it to strap up loose ends
November 17, 2025 at 1:54 AM
eprint.ing.bot
A Lattice-based Designated Verifier zkSNARK from Standard Assumptions (Mohammad Sadegh Ahmadi, Taraneh Eghlidos, Behzad Abdolmaleki, Ngoc Khanh Nguyen) ia.cr/2025/2099
Abstract. Designated Verifier zero-knowledge Succinct Non-Interactive Arguments of Knowledge (DV-zkSNARKs) are cryptographic argument systems in which the ability to verify proofs is restricted to a designated verifier. Unlike publicly verifiable zkSNARKs, these constructions ensure that only an authorized party can validate the correctness of the proof. Existing lattice-based DV-zkSNARK constructions typically rely on either linear-only encryption (LOE) or linear targeted malleability (LTM). The former does not guarantee security against quantum adversaries, while the latter restricts knowledge soundness to the non-adaptive setting. To address these limitations, we propose an inner product argument system that relies solely on the hardness of the Module Short Integer Solution (MSIS) assumption and achieves knowledge soundness in the random oracle model. This construction enables a designated verifier, holding a secret key, to succinctly verify inner product of a committed witness with an arbitrary vector. By combining our argument system with a linear probabilistic checkable proof (LPCP) compiler, to the best of our knowledge, we obtain the first DV-zkSNARK construction based on standard assumptions. Our implementation achieves prover and verification times comparable to the state of the art, while reducing public parameter size by a factor of 10, at the cost of a 2.5× increase in proof size. Image showing part 2 of abstract.
November 17, 2025 at 1:53 AM
maverickbrett.bsky.social
I currently do not see evidence for that operating assumption coming to fruition. We also still see a close protection detail of Bovino indicating he is still assessed to be under active threat.
November 17, 2025 at 1:48 AM
disasterx.substack.com
Did DeSantis ban #anthropology too? Because if he knew any, he might not be making the ignorant assumption that cultures thrive in isolation only. "Western culture" would never have been born in the cross-cultural Mediterranean crucible, had isolation been the norm.

x.com/RonDeSantis/...
November 17, 2025 at 1:43 AM
lauragiron.bsky.social
my confidence in this assumption grows stronger every day (in a very normal and respectful way!)
lauragiron.bsky.social laura’s aura @lauragiron.bsky.social · 2d
I just know there are so many hot people hiding under little cartoon pics. it’s a god damn shame. reveal yourselves!
November 17, 2025 at 1:39 AM
meowdelyn.bsky.social
Those were all the rats which the sequence hadn't been correctly expressed yet.

The one where it worked immediately bit the lady. My assumption is they're actively spreading to every species on earth now, just takes a bit cause the initial premise implies they need to tailor it to each species.
November 17, 2025 at 1:39 AM
eprint.ing.bot
FPS: Flexible Payment System (Adithya Bhat, Srinivasan Raghuraman, Panagiotis Chatzigiannis, Duc V Le, Mohsen Minaei) ia.cr/2025/2095
Abstract. Existing payment systems make fixed trade-offs between performance and security assumptions. Traditional centralized systems like Visa assume synchronous networks and crash faults to achieve high throughput, while blockchain-based systems (e.g., Algorand, Aptos) adopt Byzantine fault tolerance and partial synchrony for stronger security at the cost of performance. This rigid approach forces all users to accept the same security-performance trade-off regardless of their individual trust and threat models. We present a flexible payment system where clients independently choose assumptions about (i) network timing (bounded or partial synchrony), (ii) corruption (static or adaptive), and (iii) faults (crash or Byzantine), supporting eight assumption combinations simultaneously. Unlike traditional systems requiring consensus, our approach uses a novel flexible variant of consistent broadcast where clients external to the protocol verify delivery through cryptographic proofs, eliminating the need for global ordering. We implemented our system in Rust and demonstrated that clients choosing partially synchronous network and crash assumptions achieve +242.1% higher throughput and +70.4% better latency compared to clients with synchronous network and Byzantine assumptions, confirming that our system enables users to optimize their individual security-performance trade-offs. Image showing part 2 of abstract.
November 17, 2025 at 1:37 AM
mydogisajerk.bsky.social
If anyone walked up to me and asked 'may I meet you' I would assume English was not their first language.

If that assumption was proven wrong, I would then assume that person is kinda creepy.
November 17, 2025 at 1:34 AM
luxalptraum.com
Really cannot stress enough that if you start from the assumption that no one deserves to be raped then you don’t have to highlight the specific vulnerabilities of particular survivors in order to get people on board with the fact that their violation was a bad thing
November 17, 2025 at 1:32 AM
jetty5.bsky.social
I think you have the wrong person, I have no idea how you derived ⬆️ this assumption.
November 17, 2025 at 1:30 AM
sfrunner.bsky.social
This is the single most accurate depiction of a morning alarm clock. The judgment. The absolute urgency. The assumption that any stillness = immediate feeder duty. 💀 You’re not dead yet—GET UP AND SERVE! 😂 #CatLife #Cattitude #MorningVibes
November 17, 2025 at 1:25 AM
pinkoscare.bsky.social
What's really great is that person's entire account is mostly retweeting stuff about how terrible Trump and Republicans are. While using an argument that is entirely based on the assumption that every good American knows that the Muslim countries in the Middle East are our Enemies.
November 17, 2025 at 1:23 AM