Results 21 to 30 of about 618 (230)
Hardware acceleration of number theoretic transform for zk‐SNARK
Engineering 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
Computing bilinear pairings on elliptic curves with automorphisms [PDF]
Designs, Codes and Cryptography, 2010 The paper proposes a new pairing, easier to compute, defined on some particular elliptic curves. Due to their use in Pairing-based Cryptography bilinear pairings are today an important tool in cryptographic protocols. The classical Weil and Tate pairings can be efficiently computed using Miller's algorithm, see [\textit{H.
Changan Zhao +4 more
openaire +2 more sources
Efficient and secure pairing-free certificateless directed signature scheme
Journal of King Saud University: Computer and Information Sciences, 2021 In an ordinary signature scheme any one can verify the validity of a signature produced by the signer. But public verifiability of signatures is not desirable in some applications where the signed message is sensitive to the signature receiver, for ...
Gayathri Nemani Bhagya +3 more
doaj +1 more source
New algorithms for verifiable outsourcing of bilinear pairings [PDF]
SCIENTIA SINICA Informationis, 2016 创新点 双线性对运算是密码学中最昂贵的运算之一, 已有的对运算外包计算方案效率很低或可验证概率不高。 基于两个不可信的服务器, 我们提出了新的双线性对运算外包方案。 用户不需要执行任何复杂度高的运算, 如标量乘、 模乘运算等。 如果服务器返回错误的计算结果, 用户能以概率 1 检测到, 即外包结果能完全验证。 与已有方案相比, 所提方案能同时提高双线性对运算的计算效率和可验证概率。
Yanli Ren +4 more
openaire +1 more source
Electronic voting protocol from bilinear pairings
Revista Facultad de Ingeniería Universidad de Antioquia, 2013 Electronic voting has been an active research area since two decades, which involves using information systems and cryptographic schemes in order to reduce costs and human mistakes as well as increase process speed, without discard its security.
Gina Gallegos García +2 more
doaj +1 more source
Vietnam Journal of Science, Technology and Engineering, 2022 One option for a digital signature solution for devices with low memory and low bandwidth transmission over channels uses a short digital signature scheme based on Weil bilinear pairing aimed at short processing times, fast computation, and convenient ...
Nhu-Quynh Luc +2 more
doaj +1 more source
Bilinear pairings on elliptic curves [PDF]
L’Enseignement Mathématique, 2016 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
Efficient Anonymous Certificateless Multi-Receiver Signcryption Scheme Without Bilinear Pairings
IEEE 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
Acta Scientiarum: Technology, 2013 Authenticated multiple key exchange (AMKE) protocols not only allow participants to warrant multiple session keys within one run of the protocol but also ensure the authenticity of the other party.
Yitao Chen, Weiwei Han
doaj +1 more source
IEEE Access, 2021 It is always an attractive topic for researchers that biometric traits are used to represent the identities of users in identity-based cryptography due to their unique and inherent properties.
Xiwei Shan, Lin You, Gengran Hu
doaj +1 more source