633 research outputs found
Public Key Exchange Using Matrices Over Group Rings
We offer a public key exchange protocol in the spirit of Diffie-Hellman, but
we use (small) matrices over a group ring of a (small) symmetric group as the
platform. This "nested structure" of the platform makes computation very
efficient for legitimate parties. We discuss security of this scheme by
addressing the Decision Diffie-Hellman (DDH) and Computational Diffie-Hellman
(CDH) problems for our platform.Comment: 21 page
Speed reading in the dark : Accelerating functional encryption for quadratic functions with reprogrammable hardware
Functional encryption is a new paradigm for encryption where decryption does not give the entire plaintext but only some function of it. Functional encryption has great potential in privacy-enhancing technologies but suffers from excessive computational overheads. We introduce the first hardware accelerator that supports functional encryption for quadratic functions. Our accelerator is implemented on a reprogrammable system-on-chip following the hardware/software codesign methogol-ogy. We benchmark our implementation for two privacy-preserving machine learning applications: (1) classification of handwritten digits from the MNIST database and (2) classification of clothes images from the Fashion MNIST database. In both cases, classification is performed with encrypted images. We show that our implementation offers speedups of over 200 times compared to a published software implementation and permits applications which are unfeasible with software-only solutions.Peer reviewe
Speed reading in the dark : Accelerating functional encryption for quadratic functions with reprogrammable hardware
Functional encryption is a new paradigm for encryption where decryption does not give the entire plaintext but only some function of it. Functional encryption has great potential in privacy-enhancing technologies but suffers from excessive computational overheads. We introduce the first hardware accelerator that supports functional encryption for quadratic functions. Our accelerator is implemented on a reprogrammable system-on-chip following the hardware/software codesign methogol-ogy. We benchmark our implementation for two privacy-preserving machine learning applications: (1) classification of handwritten digits from the MNIST database and (2) classification of clothes images from the Fashion MNIST database. In both cases, classification is performed with encrypted images. We show that our implementation offers speedups of over 200 times compared to a published software implementation and permits applications which are unfeasible with software-only solutions.Peer reviewe
Elliptic Curve Cryptology
In today\u27s digital age of conducting large portions of daily life over the Internet, privacy in communication is challenged extremely frequently and confidential information has become a valuable commodity. Even with the use of commonly employed encryption practices, private information is often revealed to attackers. This issue motivates the discussion of cryptology, the study of confidential transmissions over insecure channels, which is divided into two branches of cryptography and cryptanalysis. In this paper, we will first develop a foundation to understand cryptography and send confidential transmissions among mutual parties. Next, we will provide an expository analysis of elliptic curves and then utilize them to strengthen our cryptographic methods. Finally, we will discuss cryptanalytic attacks against our confidential transmissions and ultimately detail how to best choose elliptic curves that are cryptographically robust
Public Key Cryptography based on Semigroup Actions
A generalization of the original Diffie-Hellman key exchange in
found a new depth when Miller and Koblitz suggested that such a protocol could
be used with the group over an elliptic curve. In this paper, we propose a
further vast generalization where abelian semigroups act on finite sets. We
define a Diffie-Hellman key exchange in this setting and we illustrate how to
build interesting semigroup actions using finite (simple) semirings. The
practicality of the proposed extensions rely on the orbit sizes of the
semigroup actions and at this point it is an open question how to compute the
sizes of these orbits in general and also if there exists a square root attack
in general. In Section 2 a concrete practical semigroup action built from
simple semirings is presented. It will require further research to analyse this
system.Comment: 20 pages. To appear in Advances in Mathematics of Communication
- …