Results 71 to 80 of about 5,964 (223)
Contouring Signed Distance Fields by Approximating Gradients
Abstract Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives ...
M. Kohlbrenner, M. Alexa
wiley +1 more source
Pseudorandomness in the (Inverseless) Haar Random Oracle Model
We study the (in)feasibility of quantum pseudorandom notions in a quantum analog of the random oracle model, where all the parties, including the adversary, have oracle access to the same Haar random unitary. In this model, we show the following: - (Unbounded-query secure) pseudorandom unitaries (PRU) exist.
Prabhanjan Ananth +3 more
openaire +3 more sources
On the Relation Between the Ideal Cipher and the Random Oracle Models [PDF]
The Random Oracle Model and the Ideal Cipher Model are two of the most popular idealized models in cryptography. It is a fundamentally important practical and theoretical problem to compare the relative strengths of these models and to see how they relate to each other. Recently, Coron et al. [8] proved that one can securely instantiate a random oracle
Yevgeniy Dodis, Prashant Puniya
openaire +1 more source
Affinification: A Fine Approximation of Deformations
Abstract We introduce affinification, a novel method for accelerating physics‐based animation of elastic solids. During a time‐dependent simulation, our method automatically partitions the space into affine and elastic regions depending on the deformation.
A. Mercier‐Aubin +3 more
wiley +1 more source
A Decentralized Signcryption Scheme Based on CFL
The rapid advancement of quantum computing technology poses a significant threat to conventional public key cryptographic infrastructure. The SM2 (state key cryptography algorithm no.
Leyi Shi, Mengting Liu
doaj +1 more source
Special Soundness in the Random Oracle Model
We generalize the optimal knowledge extractor for constant-round special sound protocols presented by Wikström (2018) to a knowledge extractor for the corresponding non-interactive Fiat-Shamir proofs in the random oracle model and give an exact analysis of the extraction error and running time.
openaire +2 more sources
ReTrace: Interactive Visualizations for Reasoning Traces of Large Reasoning Models
Abstract Recent advances in Large Language Models have led to Large Reasoning Models, which produce step‐by‐step reasoning traces. Such traces may offer insight into how models think, improving explainability and clarifying the underlying process. These traces, however, are often verbose and complex, making them cognitively demanding to comprehend ...
L. Felder +4 more
wiley +1 more source
Certificateless Anonymous Authentication Scheme Supporting Illegal Signatures Localization for Internet of Vehicles [PDF]
In the Internet of Vehicles (IoV) environment, vehicles are connected to public networks through the Internet and information is vulnerable to various malicious attacks from attackers during transmission.
YANG Xiaodong, LI Muzi, MA Guozu, LI Songyu, WANG Caifen
doaj +1 more source
Abstract Ecological niche models (ENMs) are used to assess the abiotic preferences of species by linking their occurrences to the environmental conditions in which they live. We developed a fossil‐informed ENM framework that integrates mid‐Holocene and modern occurrences to test niche stability and reconstruct abiotic niche characteristics for four ...
Claire. M. Williams +3 more
wiley +1 more source
Provably secure private key protection scheme for smart mobile terminal
A provable security scheme for private key protection of smart mobile terminal (SMT) was presented.In the scheme a improved security mechanism is incorporated,which includes password protection,key division and partial key retrieval from server of strong
Jun MA, Jian-feng MA, Yuan-bo GUO
doaj +2 more sources

