Results 21 to 30 of about 1,230 (176)
Strongly unforgeable signatures based on computational Diffie-Hellman
, 2006 . A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some message m the adversary cannot produce a new signature on m.
Brent Waters, Dan Boneh, Emily Shen
core +1 more source
IET Blockchain, Volume 6, Issue 1, January/December 2026.ABSTRACT Bidding transactions are widely used in scenarios such as government procurement and corporate tendering. However, while traditional blockchain achieves transparency in transactions, it also poses a risk of sensitive information such as bidder identity, quotation, and time being leaked, thereby undermining the fairness and compliance of ...
Linyun Song +4 more
wiley +1 more source
The Twin Diffie-Hellman Problem and Applications [PDF]
, 2008 We propose a new computational problem called the \emph{twin Diffie-Hellman problem}. This problem is closely related to the usual (computational) Diffie-Hellman problem and can be used in many of the same cryptographic constructions that are based on ...
Shoup, V. +7 more
core
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption [PDF]
, 2008 Recently Cash, Kiltz, and Shoup showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme whose chosen-ciphertext (CCA) security relies on the computational Diffie-Hellman (CDH) assumption.
Goichiro Hanaoka, Kaoru Kurosawa
core +1 more source
A Privacy‐Preserving Approach for Collaborative Optimization Across Company Borders
IET Collaborative Intelligent Manufacturing, Volume 8, Issue 1, January/December 2026.A novel approach that allows companies along a manufacturing value chain to collaboratively optimise their processes without exposing their private data. ABSTRACT In modern manufacturing value chains, achieving innovation and optimal performance often requires strong collaboration across organizational boundaries.
Du Nguyen Duy +3 more
wiley +1 more source
Identity-Based Encryption from the Diffie-Hellman Assumption [PDF]
, 2017 We provide the first constructions of identity-based encryption and hierarchical identity-based encryption based on the hardness of the (Computational) Diffie-Hellman Problem (without use of groups with pairings) or Factoring.
Nico Döttling +4 more
core +1 more source
IET Communications, Volume 20, Issue 1, January/December 2026.This paper proposes a novel lightweight certificateless public key authentication with keyword search (CPAEKS) scheme tailored for IIoT environments, effectively addressing data confidentiality and retrieval efficiency. The scheme resists frequency analysis attacks, removes reliance on bilinear pairings, and eliminates key escrow and certificate ...
Kaiqi Liu +3 more
wiley +1 more source
The n-Diffie-Hellman problem and its applications
, 2011 The main contributions of this paper are twofold. On the one hand, the twin Diffie-Hellman (twin DH) problem proposed by Cash, Kiltz and Shoup is extended to the n-Diffie-Hellman (n-DH) problem for an arbitrary integer n, and this new problem is shown to
Chen, Liqun +3 more
core +1 more source
A cryptographic primitive based on hidden-order groups
Journal of Mathematical Cryptology, 2009 Let G1 be a cyclic multiplicative group of order n. It is known that the computational Diffie–Hellman (CDH) problem is random self-reducible in G1 if φ(n) is known.
Saxena Amitabh, Soh Ben
doaj +1 more source
IET Communications, Volume 20, Issue 1, January/December 2026.Federated learning (FL) enables collaborative model training without collecting user data but faces security risks such as privacy breaches, poisoning, and free‐rider attacks. To address these challenges, we propose DRFL, a defense mechanism integrating dual encryption, reputation evaluation and blockchain to enhance security and transparency ...
Zheng Yuan +5 more
wiley +1 more source