Broadcast Encryption Based on Braid Groups

نویسندگان

  • Norranut Saguansakdiyotin
  • Pipat Hiranvanichakorn
چکیده

Broadcast encryption is the scheme that a sender encrypts messages for a designated group of receivers, and sends the ciphertexts by broadcast over the networks. Many research papers have done it using elliptic curve cryptography. In this paper, we propose the broadcast encryption scheme based on braid groups cryptography which is an alternative method in the public key cryptography and can reduce the computational cost. Our scheme has some advantages over the scheme using symmetric group key in that the sender can be someone inside or outside the group and it gets rid of the problem in distributing a secret key.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

New Cryptosystems From CSP-Based Self-Distributive Systems

We propose new cryptosystems based on self-distributive systems that are defined by conjugator searching problems (CSP) in noncommutative groups. Under the newly developed cryptographic assumptions, our basic construction is proven IND-CPA secure in the standard model. Then, we describe two extensions: The first is proven IND-CCA secure in the random oracle model, while the second achieves the ...

متن کامل

Cryptanalysis of the Public-Key Encryption Based on Braid Groups

At CRYPTO 2000, a new public-key encryption based on braid groups was introduced. This paper demonstrates how to solve its underlying problem using the Burau representation. By this method, we show that the private-key can be recovered from the public-key for several parameters with significant probability in a reasonable time. Our attack can be mounted directly on the revised scheme mentioned ...

متن کامل

Fully Secure Predicate - based Broadcast Encryption ?

According to the broadcast encryption scheme with wide applications in the real world, a fully secure predicate-based broadcast encryption was proposed by combining with Waters dual system encryption, predicate encryption and the orthogonality property of composite-order bilinear groups. Based on the standard model, the scheme can achieve constant-size key and ciphertext, and guarantee the secu...

متن کامل

A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem

We propose the first polynomial time algorithm for the braid DiffieHellman conjugacy problem (DHCP) on which the braid key exchange scheme and the braid encryption scheme are based [9]. We show the proposed method solves the DHCP for the image of braids under the Lawrence-Krammer representation and the solutions play the equivalent role of the original key for the DHCP of braids. Given a braid ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012