Filters








19 Hits in 4.4 sec

Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution

C. Blundo, Luiz A. Frota Mattos, D.R. Stinson
1998 Theoretical Computer Science  
In this paper, we describe some variations and generalizations of the Beimel-Chor scheme, including broadcast encryption schemes as well as interactive key distribution schemes.  ...  In 1993, Beimel and Chor presented an unconditionally secure interactive protocol which allows a subset of users in a network to establish a common key.  ...  Acknowledgements We would like to thank an anonymous referee for carefully reading this paper and providing several useful comments and suggestions, This research was done while the second author was visiting  ... 
doi:10.1016/s0304-3975(98)80007-8 fatcat:to2ers2jeza27du5youd6gqpiy

Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution [chapter]

Carlo Blundo, Luiz A. Frota Mattos, Douglas R. Stinson
1996 Lecture Notes in Computer Science  
In this paper, we describe some variations and generalizations of the Bcimel-Chor scheme, including broadcast encryption schemes as well as interactive key distribution schcmcs.  ...  Chor presented an unconditionally sccure interactive protocol which allows ii subset of users in a network to establish it commuri key.  ...  The Model for Interactive Key Distribution Schemes We now turn our attention to one-time int,eractive key dist,ribution schemes. We will use the model described by Beimel and Chor in [l, 21.  ... 
doi:10.1007/3-540-68697-5_29 fatcat:5pcdtupigzfytcgd6szo7x7lae

Page 5881 of Mathematical Reviews Vol. , Issue 99h [page]

1999 Mathematical Reviews  
R. (1-NE-CS; Lincoln, NE) Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution. (English summary) Theoret. Comput. Sci. 200 (1998), no. 1-2, 313-334.  ...  The paper discusses one-time broadcast encryption schemes (OTBES) and one-time interactive key distribution schemes (OTIKDS).  ... 

Author index volume 200 (1998)

1998 Theoretical Computer Science  
Mattos and D.R. Stinson, Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution Delahaye, J.-P., see E. Rivals Fujii, R.H., see L.M. Schmitt Harju, T. and L.  ...  Ilie, On quasi orders of words and the confluence property Hennessy, M. and J. Rathke, Bisimulations for a calculus of broadcasting systems Illie, L., see T.  ... 
doi:10.1016/s0304-3975(98)00113-3 fatcat:pmlmy6qbezg7xhxx2z2nza35vy

A -restricted key agreement scheme

C. Blundo
1999 Computer journal  
Such schemes allow the computation of up to τ common keys for τ distinct conferences.  ...  For certain values of the parameters the scheme that we propose distributes less information than the trivial one obtained by considering τ copies of a one-restricted scheme.  ...  We would like to thank the anonymous referees for their careful reading and useful comments and suggestions which improved the readability of the paper.  ... 
doi:10.1093/comjnl/42.1.51 fatcat:iguum73kona5lbv4yjjdtwqvni

On τ-time secure key agreement

ShaoQuan Jiang
2014 Science China Information Sciences  
We show that if the protocol transcript of KAS has the same entropy as the conference key, then this scheme is no better than a certain key pre-distribution scheme (KPS).  ...  For a secure KAS, it is desired that the protocol transcript does not leak any information about a user's personal secret key.  ...  Funds for the Central Universities (Grant No.  ... 
doi:10.1007/s11432-014-5176-7 fatcat:y6jdqtelbfhhzikr5ctkmyxujq

Perfectly Secure Key Distribution for Dynamic Conferences

Carlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung
1998 Information and Computation  
In this paper we analyze perfectly secure key distribution schemes for dynamic conferences.  ...  Then, we consider the model where interaction is allowed in the common key computation phase and show a gap between the models by exhibiting a one-round interactive scheme in which the user's information  ...  ACKNOWLEDGMENTS We thank the anonymous referees for their careful reading and useful comments and suggestions which improved the readability of the paper.  ... 
doi:10.1006/inco.1998.2717 fatcat:ptgwqnpjqngbnmsdvsolh3n5du

Multiuser private queries over encrypted databases

Yanjiang Yang, Feng Bao, Xuhua Ding, Robert H. Deng
2009 International Journal of Applied Cryptography  
Searchable encryption schemes allow users to perform keyword based searches on an encrypted database.  ...  Almost all existing such schemes only consider the scenario where a single user acts as both the data owner and the querier.  ...  For a key-sharing based scheme, revocation often implies a new round of key distribution involving all non-revoked users.  ... 
doi:10.1504/ijact.2009.028029 fatcat:wxiqdzzaarcy5jvgfram6gqqlm

Ensuring Security and Privacy Preservation for Cloud Data Services

Jun Tang, Yong Cui, Qi Li, Kui Ren, Jiangchuan Liu, Rajkumar Buyya
2016 ACM Computing Surveys  
However, under open networks and not fully trusted cloud environments, they face enormous security and privacy risks (e.g., data leakage or disclosure, data corruption or loss, and user privacy breach)  ...  To fully understand the advances and discover the research trends of this area, this survey summarizes and analyzes the state-of-the-art protection technologies.  ...  Fortunately, this issue can be addressed by using traditional key distribution methods, for example, key sharing, proxy re-encryption [Blaze et al. 1998 ], and broadcast encryption [Fiat and Naor 1993  ... 
doi:10.1145/2906153 fatcat:c57iz6lswvfxbmhireksha35vm

Secret Sharing With Public Reconstruction

A. Beimel, B. Chor
1998 IEEE Transactions on Information Theory  
Abstract| All known constructions of information theoretic t-out-of-n secret sharing schemes require secure, private communication channels among the parties for the reconstruction of the secret.  ...  A naive implementation of this task distributes 2n ? 2 one times pads to each party. This results in shares whose size is 2n ? 1 times the secret size.  ...  Acknowledgments We thank Carlo Blundo, Ehud Hausman, and Hugo Krawczyk for helpful discussions, and Arie Freund for comments on earlier versions of this paper.  ... 
doi:10.1109/tit.1998.705566 fatcat:hrcyaiq3zjasnk72g44x5jdiea

Group Key Agreement with Local Connectivity

Shaoquan Jiang
2016 IEEE Transactions on Dependable and Secure Computing  
In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks.  ...  In this paper, we study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary.  ...  ACKNOWLEDGMENTS The author would like to thank anonymous reviewers and the associate editor for valuable comments. This work is supported by National 973 Program of China (No. 2013CB834203).  ... 
doi:10.1109/tdsc.2015.2399299 fatcat:qjykcw6iora35pd4ebzfqemxia

Page 2371 of Mathematical Reviews Vol. 31, Issue Index [page]

Mathematical Reviews  
Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution. (English summary) 99h:94044 Bolotov, A. A. see Andreev, A.  ...  Two-key triple encryption.  ... 

Extremal Set Theory and LWE Based Access Structure Hiding Verifiable Secret Sharing with Malicious-Majority and Free Verification [article]

Vipin Singh Sehrawat, Foo Yee Yeo, Yvo Desmedt
2021 arXiv   pre-print
However, their scheme assumes semi-honest parties and supports only restricted access structures.  ...  It is the first secret sharing scheme to support cheater identification and share verifiability in malicious-majority settings.  ...  For example, we can log the key strokes of an interactive session even if encryption is used to protect the network traffic.  ... 
arXiv:2011.14804v3 fatcat:pxv3kyzk4vbrdpwlhr24skyccy

How to Work with Honest but Curious Judges? (Preliminary Report)

Jun Pang, Chenyi Zhang
2009 Electronic Proceedings in Theoretical Computer Science  
We extend their protocol in two different ways for an arbitrary number of 2n+1 judges.  ...  The three-judges protocol, recently advocated by Mclver and Morgan as an example of stepwise refinement of security protocols, studies how to securely compute the majority function to reach a final verdict  ...  We are grateful to Carroll Morgan for sharing his three-judges protocol with us and useful discussions.  ... 
doi:10.4204/eptcs.7.3 fatcat:jhrtdrgjzzbpviwaa2nivsxqwq

Cumulative index volumes 1–200

1999 Theoretical Computer Science  
De Santis and U. Vaccaro, Fully dynamic secret sharing schemes C., L.A. From Mattos and D.R. Stinson, Generalized Beimel-Chor schemes for broadcast encryption and Burago, D.. M. de Rougemont and A.  ...  Blumer 40 (1) (1985) 3 l-55 I65 (2) (1996) 407440 Bhmdo, interactive key distribution 200 (1-2) (1998) 3 13-334 Blute, R., Linear logic, coherence and dinaturality 1 I (2) (1980) 123-143 processes  ... 
doi:10.1016/s0304-3975(98)00321-1 fatcat:5wscxtd3qfdyrcvnx3dvavfb6i
« Previous Showing results 1 — 15 out of 19 results