Results 31 to 40 of about 10,337 (237)
Security Vulnerabilities of Four Signature Schemes From NTRU Lattices and Pairings
Certificateless cryptography solves the certificate management problem in public-key cryptography and the key-escrow problem in identity-based cryptography. Xie et al. proposed a certificateless signature scheme using NTRU lattices.
Kyung-Ah Shim
doaj +1 more source
Efficient identity-based key encapsulation to multiple parties [PDF]
We introduce the concept of identity based key encapsulation to multiple parties (mID-KEM), and define a security model for it. This concept is the identity based analogue of public key KEM to multiple parties.
Barbosa, Manuel, Farshim, P.
core +2 more sources
Jordan Derivations and Antiderivations of Generalized Matrix Algebras [PDF]
Let $\mathcal{G}=[A & M N & B]$ be a generalized matrix algebra defined by the Morita context $(A, B,_AM_B,_BN_A, \Phi_{MN}, \Psi_{NM})$. In this article we mainly study the question of whether there exist proper Jordan derivations for the generalized ...
Feng Wei, Leon Van, Wyk, Yanbo Li
core
Quantum critical point shifts under superconductivity: the pnictides and the cuprates [PDF]
We compare the position of an ordering transition in a metal to that in a superconductor. For the spin density wave (SDW) transition, we find that the quantum critical point shifts by order |Delta|, where Delta is pairing amplitude, so that the region of
Moon, Eun Gook, Sachdev, Subir
core +2 more sources
Solid Harmonic Wavelet Bispectrum for Image Analysis
The Solid Harmonic Wavelet Bispectrum (SHWB), a rotation‐ and translation‐invariant descriptor that captures higher‐order (phase) correlations in signals, is introduced. Combining wavelet scattering, bispectral analysis, and group theory, SHWB achieves interpretable, data‐efficient representations and demonstrates competitive performance across texture,
Alex Brown +3 more
wiley +1 more source
Dynamic Searchable Encryption Scheme Based on Identity [PDF]
Searchable encryption technology saves user’s local storage resources and simplifies user’s search operation.However,most searchable encryption schemes are only static search.Therefore,this paper presents a dynamic searchable encryption scheme based on ...
NI Lulin,XU Chungen
doaj +1 more source
Pairing-based identification schemes [PDF]
We propose four different identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more efficient and/or more secure than any known pairing-based identification ...
Freeman, David
core +2 more sources
On $5$-manifolds with free fundamental group and simple boundary links in $S^5$
We classify compact oriented $5$-manifolds with free fundamental group and $\pi_{2}$ a torsion free abelian group in terms of the second homotopy group considered as $\pi_1$-module, the cup product on the second cohomology of the universal covering, and ...
Kreck, Matthias, Su, Yang
core +1 more source
Rapid Proteome‐Wide Discovery of Protein–Protein Interactions With ppIRIS
ppIRIS is a lightweight deep learning framework for proteome‐wide protein–protein interaction prediction directly from sequence. By fusing evolutionary and structural embeddings with a regularized Siamese architecture, ppIRIS achieves state‐of‐the‐art accuracy across species, enables minute‐scale screening, and reveals biologically validated bacterial ...
Luiz Felipe Piochi +4 more
wiley +1 more source
Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings [PDF]
We present a proxy signature scheme using bilinear pairings that provides effective proxy revocation. The scheme uses a binding-blinding technique to avoid secure channel requirements in the key issuance stage.
Das, Manik Lal +2 more
core

