Results 41 to 50 of about 105,934 (253)
Certificateless signature scheme without random oracles
Tongxin xuebao, 2015 The security of certificateless signature schemes can be proved under the random oracle model.However，any implementation of the random oracle may result in insecure schemes.Some certificateless signature schemes without random oracles are not secure ...
Yan-qiong LI, Ji-guo LI, Yi-chen ZHANG
doaj +2 more sources
Strengths and Weaknesses of Quantum Computing
, 1996 Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of
Charles H. Bennett +4 more
core +4 more sources
AI in chemical engineering: From promise to practice
AIChE Journal, EarlyView.Abstract Artificial intelligence (AI) in chemical engineering has moved from promise to practice: physics‐aware (gray‐box) models are gaining traction, reinforcement learning complements model predictive control (MPC), and generative AI powers documentation, digitization, and safety workflows.
Jia Wei Chew +4 more
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley +1 more source
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
Tail index estimation, concentration and adaptivity [PDF]
, 2015 This paper presents an adaptive version of the Hill estimator based on Lespki's model selection method. This simple data-driven index selection method is shown to satisfy an oracle inequality and is checked to achieve the lower bound recently derived by ...
Boucheron, Stéphane, Thomas, Maud
core +3 more sources
Flexible Memory: Progress, Challenges, and Opportunities
Advanced Intelligent Discovery, EarlyView.Flexible memory technology is crucial for flexible electronics integration. This review covers its historical evolution, evaluates rigid systems, proposes a flexible memory framework based on multiple mechanisms, stresses material design's role, presents a coupling model for performance optimization, and points out future directions.
Ruizhi Yuan +5 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
Delegating Quantum Computation in the Quantum Random Oracle Model
, 2020 A delegation scheme allows a computationally weak client to use a server's resources to help it evaluate a complex circuit without leaking any information about the input (other than its length) to the server.
A Broadbent +17 more
core +1 more source
Las Vegas Computability and Algorithmic Randomness [PDF]
, 2015 In this article we try to formalize the question “What can be computed with access to randomness?” We propose the very fine-grained Weihrauch lattice as an approach to differentiate between different types of computation with access to randomness.
GHERARDI, GUIDO +2 more
core +2 more sources