Results 11 to 20 of about 1,396 (234)

Hardware acceleration of number theoretic transform for zk‐SNARK

open access: yesEngineering Reports, EarlyView., 2023
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

Partially Blind Proxy Re-Signature Scheme Without Bilinear Pairing [PDF]

open access: yesJisuanji gongcheng, 2020
To address complex bilinear pairing operations and certificate management problems of existing blind proxy re-signature schemes,by using WANG’s scheme for reference,this paper proposes a partially blind proxy re-signature scheme without bilinear pairing ...
NIU Shufen, LI Wenting, WANG Caifen
doaj   +1 more source

A Novel Identity-Based Privacy-Preserving Anonymous Authentication Scheme for Vehicle-to-Vehicle Communication

open access: yesElektronika ir Elektrotechnika, 2023
This paper proposes a novel bilinear pairing-free identity-based privacy-preserving anonymous authentication scheme for vehicle-to-vehicle (V2V) communication, called “NIBPA”.
Yasin Genc   +5 more
doaj   +1 more source

An efficient certificateless blind signature scheme without bilinear pairing

open access: yesAnais da Academia Brasileira de Ciências, 2014
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

New algorithms for verifiable outsourcing of bilinear pairings [PDF]

open access: yesSCIENTIA SINICA Informationis, 2016
创新点 双线性对运算是密码学中最昂贵的运算之一, 已有的对运算外包计算方案效率很低或可验证概率不高。 基于两个不可信的服务器, 我们提出了新的双线性对运算外包方案。 用户不需要执行任何复杂度高的运算, 如标量乘、 模乘运算等。 如果服务器返回错误的计算结果, 用户能以概率 1 检测到, 即外包结果能完全验证。 与已有方案相比, 所提方案能同时提高双线性对运算的计算效率和可验证概率。
Yanli Ren   +4 more
openaire   +1 more source

Efficient Anonymous Certificateless Multi-Receiver Signcryption Scheme Without Bilinear Pairings

open access: yesIEEE Access, 2018
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

open access: yes网络与信息安全学报, 2016
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]

open access: yesJisuanji gongcheng, 2017
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

Efficient location-based conditional privacy-preserving authentication scheme for vehicle ad hoc networks

open access: yesInternational Journal of Distributed Sensor Networks, 2017
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

Efficient algorithms for secure outsourcing of bilinear pairings

open access: yesTheoretical Computer Science, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaofeng Chen 0001   +6 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy