Efficient proprietary certification process and secured theft-protected proprietary certificates.

Anitha, R.; Sankarasubramanian, R.S.

Displaying similar documents to “Efficient proprietary certification process and secured theft-protected proprietary certificates.”

An Observation about Variations of the Diffie-Hellman Assumption

Bhaskar, Raghav, Chandrasekaran, Karthekeyan, V. Lokam, Satyanaryana, L. Montgomery, Peter, Venkatesan, Ramarathnam, Yacobi, Yacov (2009)

Serdica Journal of Computing

Similarity:

We generalize the Strong Boneh-Boyen (SBB) signature scheme to sign vectors; we call this scheme GSBB. We show that if a particular (but most natural) average case reduction from SBB to GSBB exists, then the Strong Diffie-Hellman (SDH) and the Computational Diffie-Hellman (CDH) have the same worst-case complexity.

A Tabular Steganography Scheme for Graphical Password Authentication

Tsung-Hung Lin, Cheng-Chi Lee, Chwei-Shyong Tsai, Shin-Dong Guo (2010)

Computer Science and Information Systems

Similarity:

From the elliptic regulator to exotic relations.

Touafek, Nouressadat (2008)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Similarity:

A review about public cryptography protocols based on RSA or elliptic curves

Antonio Corbo Esposito, Cristian Tirelli (2019)

Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche

Similarity:

We provide the basic deﬁnitions regarding computational complexity theory and review some basic cryptography protocols based on RSA or elliptic curves. These protocols summarize the history of the last ﬁfty years in cryptography and are actually ubiquitous in applications, as for example SSL (secure socket layers), smartcards, creation of a bitcoin wallet etc. Since it is known they are in the polynomial class for the Shor’s algorithm, the possible development of quantum computers, needed...