1,999 research outputs found
Oblivious Transfer based on Key Exchange
Key-exchange protocols have been overlooked as a possible means for
implementing oblivious transfer (OT). In this paper we present a protocol for
mutual exchange of secrets, 1-out-of-2 OT and coin flipping similar to
Diffie-Hellman protocol using the idea of obliviously exchanging encryption
keys. Since, Diffie-Hellman scheme is widely used, our protocol may provide a
useful alternative to the conventional methods for implementation of oblivious
transfer and a useful primitive in building larger cryptographic schemes.Comment: 10 page
Review on DNA Cryptography
Cryptography is the science that secures data and communication over the
network by applying mathematics and logic to design strong encryption methods.
In the modern era of e-business and e-commerce the protection of
confidentiality, integrity and availability (CIA triad) of stored information
as well as of transmitted data is very crucial. DNA molecules, having the
capacity to store, process and transmit information, inspires the idea of DNA
cryptography. This combination of the chemical characteristics of biological
DNA sequences and classical cryptography ensures the non-vulnerable
transmission of data. In this paper we have reviewed the present state of art
of DNA cryptography.Comment: 31 pages, 12 figures, 6 table
Easy decision-Diffie-Hellman groups
The decision-Diffie-Hellman problem (DDH) is a central computational problem
in cryptography. It is known that the Weil and Tate pairings can be used to
solve many DDH problems on elliptic curves. Distortion maps are an important
tool for solving DDH problems using pairings and it is known that distortion
maps exist for all supersingular elliptic curves. We present an algorithm to
construct suitable distortion maps. The algorithm is efficient on the curves
usable in practice, and hence all DDH problems on these curves are easy. We
also discuss the issue of which DDH problems on ordinary curves are easy
An Observation about Variations of the Diffie-Hellman Assumption
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
- …