aqora

A Note on the Bellare-Rivest Protocol for

Zhengjun Cao, Lihua Liu

AbstractWe remark that the Bellare-Rivest protocol for translucent cryptography [J. Cryptology(1999) 12: 117-139] can not truly enable the government to decrypt partial encrypted commu-nications.Keywords. Translucent cryptography, individual privacy, oblivious transfer, ElGamal en-cryption. 1 Introduction The primitive of translucent cryptography introduced by Bellare and Rivest [2] is viewed as analternative to the controversial key-escrow techniques. It aims to achieve an appropriate balancebetween individual privacy and government access to communications. The main idea behind theirprotocol for the primitive can be described as follows.Suppose that Bob’s public key is pk B and Larry’s public parameters are V 1 ,··· ,V t , where therole of Larry is played by the government. Among these V 1 ,··· ,V t , only one is the good parameterfor Larry, i.e., he knows the relevant trapdoor. But nobody knows which is the good parameterexcept Larry himself. When Alice wants to send a session key s to Bob, which shall be used forthe later symmetric encryption, she randomly picks a parameter VAbstractWe remark that the Bellare-Rivest protocol for translucent cryptography [J. Cryptology(1999) 12: 117-139] can not truly enable the government to decrypt partial encrypted commu-nications.Keywords. Translucent cryptography, individual privacy, oblivious transfer, ElGamal en-cryption. 1 Introduction The primitive of translucent cryptography introduced by Bellare and Rivest [2] is viewed as analternative to the controversial key-escrow techniques. It aims to achieve an appropriate balancebetween individual privacy and government access to communications. The main idea behind theirprotocol for the primitive can be described as follows.Suppose that Bob’s public key is pk B and Larry’s public parameters are V 1 ,··· ,V t , where therole of Larry is played by the government. Among these V 1 ,··· ,V t , only one is the good parameterfor Larry, i.e., he knows the relevant trapdoor. But nobody knows which is the good parameterexcept Larry himself. When Alice wants to send a session key s to Bob, which shall be used forthe later symmetric encryption, she randomly picks a parameter V

Jan 1, 20140 citations

인증 기관에 기초한 Translucent Cryptography 프로토콜 ( Translucent Cryptography protocol based on Certification Authority )

윤근오, 박성현, 김미연 +4 more

한국통신학회 학술대회논문집Jan 1, 19980 citations

An Analysis of a Cryptographic Communication Protocol

Maria Strand

We have considered a cryptographic communication protocol and given a proof for its security.

66Jan 1, 20100 citations

Simultaneous transmission for an encrypted image and a double random-phase encryption key

Sheng Yuan, Xin Zhou, LI Da-hai +1 more

We propose a method to simultaneously transmit double random-phase encryption key and an encrypted image by making use of the fact that an acceptable decryption result can be obtained when only partial data of the encrypted image have been taken in the decryption process. First, the original image data are encoded as an encrypted image by a double random-phase encryption technique. Second, a double random-phase encryption key is encoded as an encoded key by the Rivest-Shamir-Adelman (RSA) public-key encryption algorithm. Then the amplitude of the encrypted image is modulated by the encoded key to form what we call an encoded image. Finally, the encoded image that carries both the encrypted image and the encoded key is delivered to the receiver. Based on such a method, the receiver can have an acceptable result and secure transmission can be guaranteed by the RSA cipher system.We propose a method to simultaneously transmit double random-phase encryption key and an encrypted image by making use of the fact that an acceptable decryption result can be obtained when only partial data of the encrypted image have been taken in the decryption process. First, the original image data are encoded as an encrypted image by a double random-phase encryption technique. Second, a double random-phase encryption key is encoded as an encoded key by the Rivest-Shamir-Adelman (RSA) public-key encryption algorithm. Then the amplitude of the encrypted image is modulated by the encoded key to form what we call an encoded image. Finally, the encoded image that carries both the encrypted image and the encoded key is delivered to the receiver. Based on such a method, the receiver can have an acceptable result and secure transmission can be guaranteed by the RSA cipher system.

Applied OpticsMay 30, 200722 citations

About encryption and quantum cryptography

Чулкова Галина Меркурьевна

Physics in SchoolJan 1, 20210 citations

Authenticated Session Key Distribution Protocol with Zero-Knowledge

Chungen Xu, Yan Yang, Bennian Dou

Authenticated session key distribution protocol is an important cryptographic technique in the secure communication areas. We present a new method for the authenticated exchange of messages in the three-party case, and abandon the idea of authentication which was finished with encryption and decryption in the Bellare-Rogaway model. Instead, the non-interactive zero-knowledge is applied to our protocol. We give an illumination for some important properties of security and depict a feasible idea of provably security with zero-knowledge.Authenticated session key distribution protocol is an important cryptographic technique in the secure communication areas. We present a new method for the authenticated exchange of messages in the three-party case, and abandon the idea of authentication which was finished with encryption and decryption in the Bellare-Rogaway model. Instead, the non-interactive zero-knowledge is applied to our protocol. We give an illumination for some important properties of security and depict a feasible idea of provably security with zero-knowledge.

Applied Mechanics and MaterialsDec 6, 20100 citations

A Note on the Bellare-Rivest Protocol for Translucent Cryptography

Abstract

Related papers

A Note on the Bellare-Rivest Protocol for Translucent Cryptography

Abstract

Related papers