Results 11 to 20 of about 30,832 (233)
Ensuring the integrity of outsourced data is one of several functional requirements in cloud storage services, although designing an effective and secure public auditing scheme remains an ongoing research challenge.
Feng Wang +5 more
doaj +3 more sources
Hardware acceleration of number theoretic transform for zk‐SNARK
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
An efficient certificateless blind signature scheme without bilinear pairing
Recently, the certificateless public key cryptography (CLPKC) has been studied widely since it could solve both of the certificate management problem in traditional public key cryptography (TPKC) and the key escrow problem in the identity-based public ...
GUOFAGN DONG +3 more
doaj +1 more source
Poisson structures on certain moduli spaces for bundles on a surface [PDF]
Let $\Sigma$ be a closed surface, $G$ a compact Lie group, with Lie algebra $g$, and $\xi \colon P \to \Sigma$ a principal $G$-bundle. In earlier work we have shown that the moduli space $N(\xi)$ of central Yang- Mills connections, for appropriate ...
Huebschmann, Johannes
core +4 more sources
Bilinear pairings on elliptic curves [PDF]
We give an elementary and self-contained introduction to pairings on elliptic curves over finite fields. The three different definitions of the Weil pairing that can be found in the literature are stated and proved to be equivalent using Weil reciprocity. Pairings with shorter loops, such as the ate, ate
openaire +3 more sources
Quantization of continuum Kac-Moody algebras [PDF]
Continuum Kac-Moody algebras have been recently introduced by the authors and O. Schiffmann. These are Lie algebras governed by a continuum root system, which can be realized as uncountable colimits of Borcherds-Kac-Moody algebras.
Appel, Andrea, Sala, Francesco
core +2 more sources
Efficient Anonymous Certificateless Multi-Receiver Signcryption Scheme Without Bilinear Pairings
Certificateless multi-receiver encryption/signcryption (CLME/CLMS) has become a research hotspot in the field of information security. Almost all of the existing CLME/CLMS schemes are constructed based on the bilinear pairing computation, a time ...
Liaojun Pang +3 more
doaj +1 more source
Digital multi-signature scheme based on bilinear pairing
Based on bilinear pairing and three complicated problems,a new digital multi-signature scheme was pro-posed.In the new scheme,the advantage of fast signature in broadcasting digital multi-signature was applied to se-quential digital multi-signature.By ...
Cai-juan ZHANG, Lin YOU
doaj +3 more sources
ID-based Sever-aided Verification Proxy Re-signature Scheme [PDF]
Signature verification in the existing ID-based proxy re-signature schemes includes time-consuming bilinear pairing operations,which are not suitable for low-power devices.In order to improve the efficiency of signature verification,combined with server ...
YANG Xiaodong,LI Yanan,ZHOU Qixu,GAO Guojuan,WANG Caifen
doaj +1 more source
Due to the real-time requirement of message in vehicle ad hoc networks, it is a challenge to design an authentication for vehicle ad hoc networks to achieve security, efficiency, and conditional privacy-preserving.
Libing Wu +4 more
doaj +1 more source

