Results 91 to 100 of about 1,230 (176)

On the complexity of the discrete logarithm and Diffie–Hellman problems

, 2004
The discrete logarithm problem plays a central role in cryptographic protocols and computational number theory. To establish the exact complexity, not only of the discrete logarithm problem but also of its relatives, the Diffie–Hellman (DH) problem and ...
Theo Garefalakis, Garefalakis, Theo, Blake, Ian F., Ian F. Blake   +3 more
core   +1 more source

A new identification scheme based on the bilinear Diffle-Hellman problem

, 2002
We construct an interactive identification scheme based on the bilinear Diffie-Hellman problem and analyze its security. This scheme is practical in terms of key size, communication complexity, and availability of identity-variance provided that an ...
Kim, Kwangjo, Kim, M
core  

Irreducibility to the One-More Evaluation Problems: More May Be Less [PDF]

, 2010
For a random-self-reducible function, the evaluation problem is irreducible to the one-more evaluation problem, in the following sense. An irreduction algorithm exists that, given a reduction algorithm from the evaluation to the one-more evaluation ...
Daniel R. L. Brown
core  

Public-Key Encryption Schemes With Bounded CCA Security and Optimal Ciphertext Length Based on the CDH and HDH Assumptions

, 2015
In Cramer et al. (2007, Bounded CCA2-Secure Encryption. In Kurosawa, K. (ed.), Advances in Cryptology - ASIACRYPT 2007, Kuching, Malaysia, December 2-6, Lecture Notes in Computer Science, Vol. 4833, pp. 502-518.
Nascimento, Anderson C. A., Pereira, Mayana, Nascimento, Anderson C., Hanaoka, Goichiro, Dowsley, Rafael   +4 more
core   +1 more source

Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields. Application to the Static Diffie-Hellman Problem on E(F q 5 )

, 2013
International audienceIn 2008 and 2009, Gaudry and Diem proposed an index calculus method for the resolution of the discrete logarithm on the group of points of an elliptic curve defined over a small degree extension field Fqn.
Vitse, Vanessa, Joux, Antoine
core   +1 more source

A Lightweight Hybrid Authentication and Key Agreement Protocol for Decentralized Device-to-Device Communication with Post-Quantum Confidentiality. [PDF]

Sensors (Basel)
Savón-Berenguer A, Moraru SA, García-Naranjo JC, Braeken A.   +3 more
europepmc   +1 more source

A privacy-preserving multi-user retrieval system for multimodal artificial intelligence. [PDF]

Sci Rep
Gao Y, Luo W, Wang C, Ahmad NS, Wang X, Goh P.   +5 more
europepmc   +1 more source

generic 알고리즘에서 q-WDH 문제와 q-SCDH 문제에 대한 하계

, 2010
학위논문(석사) - 한국과학기술원 : 수리과학과, 2010.08, [ iii, 9 p. ]Discrete Logarithm Problem is well known as a hard problem. Shoup proved the lower bounds of DL problem and related problems with respect to generic algorithms.
Choe, Yoon-Hee, 최윤희
core  

Irreducibility to the One-More Evaluation Problems: More May Be Less

, 2007
For a random-self-reducible function, the evaluation problem is irreducible to the one-more evaluation problem, in the following sense. An irreduction algorithm exists that, given a reduction algorithm from the evaluation to the one-more evaluation ...
Daniel R. L. Brown
core  

A dynamic policy-aware conditional proxy re-encryption system for fine-grained access control in IoT pub/sub systems. [PDF]

Sci Rep
Lin S, Ke N, Jun Ru H, Cui L.
europepmc   +1 more source