Results 61 to 70 of about 4,491,165 (327)
Lower Bounds on Signatures from Symmetric Primitives [PDF]
, 2019 We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most $2^{(1+o(1))q}$, where $q$ is the total number of oracle queries asked by the key generation, signing, and verification algorithms ...
Barak, Boaz, Mahmoody, Mohammad
core +1 more source
Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes [PDF]
, 2012 International audienceIn this paper we present efficient implementations of McEliece variants using quasi-dyadic codes. We provide secure parameters for a classical McEliece encryption scheme based on quasi-dyadic generalized Srivastava codes, and ...
B. Biswas +20 more
core +3 more sources
Large Language Model in Materials Science: Roles, Challenges, and Strategic Outlook
Advanced Intelligent Discovery, EarlyView.Large language models (LLMs) are reshaping materials science. Acting as Oracle, Surrogate, Quant, and Arbiter, they now extract knowledge, predict properties, gauge risk, and steer decisions within a traceable loop. Overcoming data heterogeneity, hallucinations, and poor interpretability demands domain‐adapted models, cross‐modal data standards, and ...
Jinglan Zhang +4 more
wiley +1 more source
Efficient and provably-secure certificateless sequential aggregate signature scheme
Tongxin xuebao, 2022 Aiming at the problem that current schemes mostly let the latter signer to verify the multiple signatures of the previous signer, and the message is signed and then passed to the next signer, leading to the efficiency problem of long overall signature ...
Zhu WANG +5 more
doaj
On the Oracle Properties of Bayesian Random Forest for Sparse High-Dimensional Gaussian Regression
Mathematics, 2023 Random forest (RF) is a widely used data prediction and variable selection technique. However, the variable selection aspect of RF can become unreliable when there are more irrelevant variables than relevant ones.
Oyebayo Ridwan Olaniran +1 more
doaj +1 more source
Quantum Lazy Sampling and Game-Playing Proofs for Quantum Indifferentiability [PDF]
, 2021 Game-playing proofs constitute a powerful framework for non-quantum cryptographic security arguments, most notably applied in the context of indifferentiability. An essential ingredient in such proofs is lazy sampling of random primitives.
Czajkowski, Jan +3 more
core +1 more source
Advanced Experiment Design Strategies for Drug Development
Advanced Intelligent Discovery, EarlyView.Wang et al. analyze 592 drug development studies published between 2020 and 2024 that applied design of experiments methodologies. The review surveys both classical and emerging approaches—including Bayesian optimization and active learning—and identifies a critical gap between advanced experimental strategies and their practical adoption in ...
Fanjin Wang +3 more
wiley +1 more source
Quantum Security of a Compact Multi-Signature
CryptographyWith the rapid advances in quantum computing, quantum security is now an indispensable property for any cryptographic system. In this paper, we study how to prove the security of a complex cryptographic system in the quantum random oracle model. We first
Shaoquan Jiang
doaj +1 more source
Provably Secure Covert Communication on Blockchain
Cryptography, 2018 Blockchain is a public open ledger that provides data integrity in a distributed manner. It is the underlying technology of cryptocurrencies and an increasing number of related applications, such as smart contracts. The open nature of blockchain together
Juha Partala
doaj +1 more source
Advanced Intelligent Systems, EarlyView.This study presents a multitask strategy for plastic cleanup with autonomous surface vehicles, combining exploration and cleaning phases. A two‐headed Deep Q‐Network shared by all agents is traineded via multiobjective reinforcement learning, producing a Pareto front of trade‐offs.
Dame Seck +4 more
wiley +1 more source