Future Works. The network assumptions we have used allow to describe the protocol and prove its proper- ties in a clean and intuitive way, however they are quite unrealistic in practical applications. So the MBA protocol should be extended for usage in asynchronous and incomplete networks, that model more closely real-life communication channels. This would obviously allow to apply the protocol to a variety of practical problems, such as blockchain platforms implementing shard- ing. In fact, the MBA Protocol, if designed for asynchronous networks, would allow the nodes working on different shards to synchronize their operations creating an extremely regulated environment, which gives the right conditions for a practical reconciliation of the transactions recorded on the shards. Another research direction could focus on extending the protocol by introducing some ter- mination steps, which allow to conclude the protocol execution in a predetermined number of steps if it does not halt by a certain limit. In fact, many concrete applications benefit from an upper bound on the protocol execution time that this extension would give. However, it is quite tricky to reconcile an execution bound with the goal to preserve as much meaningful agreement as possible: the trivial solution is to collapse the still-ambiguous components to ⊥ so that consensus is reached in a bounded number of steps. More advanced termination steps would be preferable, however non-trivial solutions may cause a variety of issues, especially in the setting of asynchronous incomplete networks where malicious players have a widened array of attacks at their disposal. Acknowledgments The core of this work is contained in the first author’s MSC thesis.Part of the results presented here have been carried on within the EU-ESF activities, call PON Ricerca e Innovazione 2014-2020, project Distributed Ledgers for Secure Open Communities. The second and third authors are members of the INdAM Research group GNSAGA. We would like to thank the Quadrans Foundation for their support. References [1] Xxxxxxx Xxxxxxx and Xxxxxx Xxxxxxxx. Xxxxxx the friendly finality gadget. arXiv preprint arXiv:1710.09437, 2017. [2] Xxxxxx Xxxxxx, Xxxxxxx Xxxxxx, et al. Practical byzantine fault tolerance. In OSDI, volume 99, pages 173–186, 1999. [3] Xxxx Xxxx and Xxxxxx Xxxxxx. Algorand. arXiv preprint arXiv:1607.01341, 2016. [4] Xxxx Xxxx and Xxxxxx Xxxxxx. Algorand: A secure and efficient distributed ledger. Theo- retical Computer Science, ...
Future Works. There are some points to be concerned for the proposed scheme in the identity based broadcast encryption to make it more efficient. The first one is that the group public key is getting bigger when a group number are increased. The second comes from using the identity based cryptosystem. The identity based cryptosystem has disadvantage in the privacy in distributing user’s private key by a private key generator. This can be eliminated by applying the other schemes like a certificateless cryptosystem in the proposed scheme. BIBLIOGRAPHY
Future Works. It is believed that the outcome of this research will serve as inspirations for future works in the following areas: In this study, the Client-side metering and monitoring prototype, which is designed, developed and tested over cloud platform, used the free trial tool and technology. Therefore, it is recommended for the future research to do similar experiments on different cloud providers and in a much longer period. This tool can evaluate how much availability difference should cloud service provider’s promise and can evaluate if they report the correct accessibility and availability of uptime. Furthermore, the researcher recommends redesigning and developing a full-future client- side metering and monitoring SLA for all the cloud service providers and more than one month. References [1] X. X.Xxxxxxx Devi, "A Survey on Application of Cloudsim Toolkit in Cloud Computing," vol. Vol. 3, no. Issue 6, June 2014. [2] X. Xxxxxxx, "Service level agreements in business relationships". [3] X. Xxxxxxxxx, "Service level agreements: a framework for the quality management and improvement of central support services.". [4] O. M. P. G. Xxxxxxxx XXXXXXX, "SERVICE LEVEL AGREEMENTS:A MAIN CHALLENGE for Next Generation Networks". [5] X. Xxxxx, WHAT ARE THE OPPORTUNITIES AND CHALLENGES OF CLOUD COMPUTING TECHNOLOGY IN THE HEALTHCARE INFORMATION SYSTEMS, 2013. [6] V. S. M. Xxxxxxxx, "A Survey on Resource Provisioning Heuristics". [7] B. SK. Xxxxxx Xxxxx, "Storage and Processing Speed for Knowledge from Enhanced Cloud Computing With Hadoop Frame Work," IJSRSET, vol. Volume 2, no. 2, 2016. [8] P. A. B. R. Xxxxxxxx X.Nandgaonkar, "A Comprehensive Study on Cloud Computing," International Journal of Computer Science and Mobile Computing, vol. Vol. 3, no. ISSN 2320–088X, p. pg.733 – 738, April 2014. [9] A. Y. B. K. Swarnalatha, "A Cloud Platform for the Internet of Things," World Scient i f ic News 41, no. 2392-2192 , pp. 16-27 , February 2016. [10] C. S. P. Xxxxxxxxxxx Xxxxxxxxxxxxxxx, "Secure and Trusted Information Brokering In Cloud Computing," International Journal of Scientific Research in Science and Technology, vol. 2, no. 2, pp. 210-217, 26 April 2016.
Future Works. Non-exclusive rights to make any use in any media of any future works that are based on or incorporate the Work, including full length feature films, books, documentaries, television production, webisodes, etc.
Future Works. In consideration of the publication of the present work the Author agrees to give the Publisher an option to publish his next book on fair and reasonable terms based on the sale of the present work and on such other circumstances and conditions as may properly be considered in establishing them. It is understood that the option shall be exercised within sixty days of receipt of the complete manuscript by the Publisher.
Future Works. The Cob Protocol guarantees to reach consensus if the assumptions are met, and its leaderless and parallel approach maximizes the number of vector components that are finalized on a meaningful value (i.e. ƒ= ⊥). However its execution is probabilistic, and although it halts with probability 1, the number of steps necessary to halt have only an upper bound in the form of a Bernoulli-like distribution. An interesting research direction could focus on extending the protocol by introducing some termination steps, in order to have a fixed upper bound on its execution, which would benefit many concrete applications. Specifically, such an extension would see the protocol running normally up to a pre-determined number of steps, then, if the execution has not halted yet, the protocol starts a sequence of termination steps that guarantee to reach a consensus in a fixed number of steps. In this phase it is quite tricky to try to preserve as much meaningful agreement as possible: the trivial solution is to collapse the agreement on ⊥ if consensus is not reached in time, but avoiding to do so has to account for a wide array of attacks with which malicious players could try to disrupt agreement.
