Results 51 to 60 of about 1,230 (176)
Trace zero varieties in cryptography : optimal representation and index calculus [PDF]
, 2014 The trace zero variety associated to an elliptic or hyperelliptic curve is an abelian variety defined over a finite field F_q. Its F_q-rational points yield a finite group, the trace zero subgroup of the degree zero Picard group of the original curve ...
Massierer, Maike
core +1 more source
An ID-based Hybrid Broadcast Signcryption Scheme with User Anonymity
工程科学与技术, 2013 :Broadcast signcryption can make the sender send multi messages to recipients by one operation. In order to efficiently solve the problems of low efficiency, large overhead and privacy security in “one-to-many” communication model, an ID-based broadcast ...
林志强, 杨晓元, 韩益亮
doaj
IET Blockchain, Volume 5, Issue 1, January/December 2025.Grid computing is an emerging technology that enabled the heterogeneous collection of data and provisioning of services to the users. Due to the high amount of incoming heterogeneous request, grid computing needs an efficient scheduling to reduce execution time and satisfy service level agreement (SLA) and quality of service (QoS) requirements.
Gangasandra Mahadevaiah Kiran +1 more
wiley +1 more source
A lightweight attribute-based signcryption scheme based on cloud-fog assisted in smart healthcare.
PLoS ONEIn the environment of big data of the Internet of Things, smart healthcare is developed in combination with cloud computing. However, with the generation of massive data in smart healthcare systems and the need for real-time data processing, traditional ...
Yanzhong Sun +3 more
doaj +1 more source
CommTLC: An Alternative to Reduce the Attack Surface of HTLCs in Lightning Networks
IET Blockchain, Volume 5, Issue 1, January/December 2025.The CommTLC scheme is secure against Fakey, Griefing and Wormhole attacks, as proven using the universal composability framework. It detects adversaries in these attacks within 112 ms for a payment path involving five users. Additionally, it outperforms recent privacy‐preserving PCN‐based solutions, MAPPCN‐OR and EAMHL+, in terms of communication and ...
Prerna Arote, Joy Kuri
wiley +1 more source
Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme [PDF]
, 2002 We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman ...
Alexandra Boldyreva
core
IET Communications, Volume 19, Issue 1, January/December 2025.To date, private set intersection (PSI) has been studied with several computation types. However, PSI for which an external party computes intersection has fixed number of parties. So, we propose external party compute‐multiparty private set intersection (EPC‐MPSI) protocols for an external party to compute the intersection of multiple private datasets.
Ki‐Hwan Kim +3 more
wiley +1 more source
A Novel Convinced Diffie-Hellman Computation Scheme and Its Cryptographic Application
, 2012 [[abstract]]The Diffie-Hellman (DH) problem is an important security assumption in modern cryptography. In this paper, a new type of cryptographic technique called a convinced Diffie-Hellman (DH) computation scheme is proposed.
Tseng, Yuh-Min; Wu, T. Y.
core
Fast Digital Signature Schemes as Secure as Diffie-Hellman Assumptions [PDF]
, 2007 : This paper presents two fast digital signature schemes based on Diffie-Hellman assumptions. In the random oracle model, the first scheme S1 has a tight security reduction to the computational Diffie-Hellman (CDH) problem; and the second scheme S2 has a
Dong Zheng, Jian Weng, Changshe Ma
core