How To Broadcast A Secret

Berkovits, Shimshon

doi:10.1007/3-540-46416-6_50

Cited by 209 publications

(120 citation statements)

References 2 publications

Supporting

Mentioning

113

Contrasting

Order By: Relevance

“…For example, [12] focused on secure multicast group key management in the network and [1] proposed broadcast encryption schemes that disseminate a secret to only the privileged clients. However, key management and cryptography are not the focus of this paper and we try to address the security issue from data management aspect.…”

Section: Related Workmentioning

confidence: 99%

Balancing performance and confidentiality in air index

Tan

Lee

Zheng

et al. 2005

Proceedings of the 14th ACM International Conference on Information and Knowledge Management

View full text Add to dashboard Cite

Studies on the performance issues (i.e., access latency and energy conservation) of wireless data broadcast have appeared in the literature. However, the important security issues have not been well addressed. This paper investigates the tradeoff between performance and security of signature-based air index schemes in wireless data broadcast. From the performance perspective, keeping low false drop probability helps clients retrieve the information from a broadcast channel efficiently. Meanwhile, from the security perspective, achieving high false guess probability prevents the hacker from guessing the information easily. There is a tradeoff between these two aspects. An administrator of the wireless broadcast system may balance this tradeoff by carefully configuring the signatures used in broadcast. This study provides a guidance for parameter settings of the signature schemes in order to meet the performance and security requirements. Experiments are performed to validate the analytical results and to obtain optimal signature configuration corresponding to different application criteria.

show abstract

Section: Related Workmentioning

confidence: 99%

Balancing performance and confidentiality in air index

Tan

Lee

Zheng

et al. 2005

Proceedings of the 14th ACM International Conference on Information and Knowledge Management

View full text Add to dashboard Cite

show abstract

“…The notion of broadcast encryption was introduced by Berkovits [3] and Fiat et al [10] independently. The main criteria for this technology are the number of ciphertexts (the length of the message) to be broadcast, the number of keys each receiver stores, and the computational overhead at a receiver.…”

Section: Related Workmentioning

confidence: 99%

A Revocation Scheme with Minimal Storage at Receivers

Asano

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A revocation or a broadcast encryption technology allows a sender to transmit information securely over a broadcast channel to a select group of receivers excluding some revoked receivers. In this paper we propose two efficient revocation methods which are suitable for stateless receivers. The proposed methods use an a-ary key tree structure and require at most r log (N/r) log a + 1 ciphertexts broadcast. Our Method 1 requires only one key to be stored and O 2 a log 5 N log a computational overhead at a receiver, whereas Method 2 requires log N log a keys and O (2 a ) computational overhead, where N and r respectively denote the total number of receivers and the number of revoked receivers. Our methods are very efficient with respect to the number of keys each receiver stores, especially Method 1 minimizes it.

show abstract

“…Over time, however, the broadcaster may not always desire that all users receive its messages. Thus one can consider the problem of transmitting a message only to some small specified subset of the users, and indeed this has been considered in the literature [1]. For the case of a broadcast channel shared by numerous users, we argue that an equally, if not more, interesting problem is the complement of the above problem: how to transmit a message over a broadcast channel shared by an exponential number N = 2 n of users so that all but some specified small coalition of k excluded users can decipher the message, even if these excluded users collude with each other in an arbitrary manner.…”

Section: Introductionmentioning

confidence: 99%

“…In a computationally limited world, these devices could function using private-key encryption, or using public-key encryption. 1 In this framework, to solve broadcast security problems like the one we consider, the objective would be to distribute decryption devices to users such that the following property would hold: given some set of excluded users, one could determine a small set of encryption devices, such that none of the excluded users would have the corresponding decryption devices, while each non-excluded user would have at least one such decryption device. One could then broadcast the message using these encryption devices, and only the designated recipients would be able to decrypt it.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Coding Constructions for Blacklisting Problems without Computational Assumptions

Kumar

Rajagopalan

Sahai³

1999

Advances in Cryptology — CRYPTO’ 99

127

View full text Add to dashboard Cite

Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2 n users so that all but some specified coalition of k excluded users can understand the contents of the message. Using error-correcting codes, and avoiding any computational assumptions in our constructions, we construct natural schemes that completely avoid any dependence on n in the transmission overhead. Specifically, we construct: (i) (for illustrative purposes,) a randomized scheme where the server's storage is exponential (in n), but the transmission overhead is O(k), and each user's storage is O(kn); (ii) a scheme based on polynomials where the transmission overhead is O(kn) and each user's storage is O(kn); and (iii) a scheme using algebraic-geometric codes where the transmission overhead is O(k 2 ) and each user is required to store O(kn) keys. In the process of proving these results, we show how to construct very good cover-free set systems and combinatorial designs based on algebraic-geometric codes, which may be of independent interest and application. Our approach also naturally extends to solve the problem in the case where the broadcast channel may introduce errors or lose information.

show abstract

How To Broadcast A Secret

Cited by 209 publications

References 2 publications

Balancing performance and confidentiality in air index

Balancing performance and confidentiality in air index

A Revocation Scheme with Minimal Storage at Receivers

Coding Constructions for Blacklisting Problems without Computational Assumptions

Contact Info

Product

Resources

About