Design and performance evaluation of a flexible and efficient server assisted signature protocol

Date

2003-07-03

Author

Bicakci, K
Baykal, Nazife

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

213
views

0
downloads

One method to reduce the computational costs of generating public key signatures on constrained devices is to get help from a verifiable server In this paper, we propose a (verifiable) server assisted signature protocol which is the first one that totally elliminates public key operations for the ordinary user Our protocol is also more efficient and flexible in terms of storage since unlike previous ones the user does not need to save the server's signatures to prove its cheating.

Subject Keywords

Protocols, Digital signatures, Public key cryptography, Computational efficiency, Public key, Decision support systems, Message authentication, Delay, Personal digital assistants, Security

URI

https://hdl.handle.net/11511/31367

DOI

https://doi.org/10.1109/iscc.2003.1214284

Collections

Graduate School of Informatics, Conference / Seminar

Suggestions

OpenMETU
Core

Message transmission for GH-public key cryptosystem Ashraf, Muhammad; KIRLAR, Barış Bülent (2014-03-15) In this paper we propose an ElGamal type encryption scheme based on the concepts of public key cryptosystem over cubic finite field extension proposed by Gong and Ham (GH). The proposed encryption scheme is an ephemeral-static, which is useful in situations like email where the recipient may not be online. The security of the proposed encryption scheme depends on the difficulty of solving 3-LFSR-DLP, 3-LFSR-DHP and 3-LFSR-DDHP. It then provides secure message transmission by having also the property of sema...
An efficient RSA public key encryption scheme Aboud, Sattar J.; AL-Fayoumi, Mohammad A.; Al-Fayoumi, Mustafa; Jabbar, Haidar S. (2008-04-09) In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h x h square matrices with entities in z(n) indicated via l(h,z(n)). Since the original RSA Scheme is a block cipher in which the original message an...
New methods for public key cryptosystems based on XTR AKLEYLEK, SEDAT; KIRLAR, Barış Bülent (2015-12-01) In this paper, we propose novel deterministic and probabilistic public key cryptographic schemes based on an effective and compact subgroup trace representation cryptosystem to handle with the problem of secure and efficient communication between the server and resource-constrained device. The proposed schemes use the hardness of the Trace-discrete logarithmic like problem. We also show that the deterministic version of the proposed scheme is a one-way trapdoor, and the probabilistic version of the proposed...
On lattice based digital signature schemes Javani, Farid; Akyıldız, Ersan; Department of Cryptography (2014) Lattice based cryptography is one of the few hopes for secure public key cryptography in post quantum era since there is no known polynomial time quantum algorithm that can solve hard lattice problems. But despite this precious property, for a cryptographic construction which is designed based on a hard lattice problem, to be secure, required time and space is not efficient. This has led to introduction of structured lattices that need less time and space; indeed the only existing standard on lattice based ...
Compact and Simple RLWE Based Key Encapsulation Mechanism Alkim, Erdem; Bilgin, Yusuf Alper; Cenk, Murat (2019-01-01) n this paper, we propose a key encapsulation scheme based on NewHope and Kyber, two NIST post-quantum standardization project candidates. Our scheme is based on NewHope, thus it is simple and has fast implementation while it is making use of smaller key sizes and easily changeable security level advantages of Kyber. The scheme heavily use recent advances on Number Theoretic Transform (NTT) in a way that transformation from one degree polynomial to another is easy. To make it possible, we changed the definit...

Citation Formats

K. Bicakci and N. Baykal, “Design and performance evaluation of a flexible and efficient server assisted signature protocol,” 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/31367.