95,387 Hits in 3.2 sec

Simulatable security and polynomially bounded concurrent composability

D. Hofheinz, D. Unruh
2006 2006 IEEE Symposium on Security and Privacy (S&P'06)  
Universal and black-box simulatability, in all of their subflavours, are already known to guarantee that the concurrent composition even of a polynomial number of secure protocols stays secure.  ...  We show that computational standard simulatability does not allow for secure concurrent composition of polynomially many protocols, but we also show that statistical standard simulatability does.  ...  Acknowledgements We are indebted to Michael Backes for many helpful comments and improvements. We also thank Ran Canetti and Jörn Müller-Quade for valuable discussions.  ... 
doi:10.1109/sp.2006.36 dblp:conf/sp/HofheinzU06 fatcat:pjo72t7hjbd4ramzaa7h4xrcje

Integrating Encrypted Cloud Database Services using Query Processing

Jadhav Sonali, B. M.
2016 International Journal of Computer Applications  
Storing this confidential information in cloud must provide guarantee of availability of data and security. there are too many solutions are provided to handle data, but still confidentiality problem is  ...  In today's environment the various vital information should need to be stored in more secured manner.  ...  One solution to overcome the damage done by server comprises is to encrypt sensitive secure data as in sundr, Sporc &depot and run all computations on clients.  ... 
doi:10.5120/ijca2016911323 fatcat:3oy525qtg5gjbk5uihxlabgwri

An Improved Efficient Provable Secure Identity-Based Identification Scheme in the Standard Model

2013 KSII Transactions on Internet and Information Systems  
In this paper, we provide a fix to the scheme to overcome the problem without affecting the efficiency as well as a new proof of security.  ...  In particular, we show that only one extra pre-computable pairing operation should be added into the commitment phase of the identification protocol to fix the proof of security under the same hard problems  ...  Acknowledgement The authors would like to thank the anonymous reviewers on an earlier version of this paper, as well as the Fundamental Research Grant Scheme (FRGS/1/11/TK/UTAR/03/9, FRGS/1/10/TK/MMU/03  ... 
doi:10.3837/tiis.2013.04.018 fatcat:ve2gi5352fezjaa2xg5fham6ii

Convergence in Language Design: A Case of Lightning Striking Four Times in the Same Place [chapter]

Peter Van Roy
2006 Lecture Notes in Computer Science  
By definitive language I mean a programming language that gives good solutions at its level of abstraction, allowing computer science researchers to move on and work at higher levels.  ...  Given the evolution of computer science as a field with a rising level of abstraction, it is my belief that a small set of definitive languages will eventually exist.  ...  Acknowledgments We would like to thank Kevin Glynn and Boris Mejias for their comments on a draft of this article.  ... 
doi:10.1007/11737414_2 fatcat:t4zv7hbbengrxggd2hen6757l4

Declarative, Secure, Convergent Edge Computation [article]

Christopher Meiklejohn
2015 arXiv   pre-print
In particular, we consider that a crucial test for such a model is that it should support edge computation in a both natural and secure way.  ...  We present a preliminary work report with an initial solution, called Lasp, which resembles a concurrent functional language while naturally supporting an eventually consistent coordination-free distribution  ...  Acknowledgments Thanks to Peter Alvaro and Peter Van Roy. This work has been partially funded by the SyncFree EU/FP7 Project (n o 609551).  ... 
arXiv:1512.04898v2 fatcat:apmdt4taifdxxewfn33ceq4sqi

Cloud computing based load balancing algorithm for erlang concurrent traffic

Chanintorn Jittawiriyanukoon
2020 Indonesian Journal of Electrical Engineering and Computer Science  
Besides, to manipulate Erlang concurrent tasks is another skyward situation. Hence, the load balancing is obliged to exhaust all mentioned conditions.  ...  The proposed load balancing is to spot underloaded and overloaded conditions then stabilizes the weight amidst computing nodes.  ...  to find out the load figure and utilization **/ F=arg /** Solution F corresponding to U y and B y **/ end for for r=1 to m /** Select the concurrent task to fit the computing node **/ Δ r =F -S rj If  ... 
doi:10.11591/ijeecs.v17.i2.pp1109-1116 fatcat:yiiby3vpdvh6vaztjlldrduku4

Auditing Cloud Consistency

Prajakta Suryawanshi, Pranay Saraf, Harender Singh
2017 IOSR Journal of Computer Engineering  
Unlike their work, we do not require a global clock among all users for total ordering of operations. A loosely synchronized clock is suitable for our solution.  ...  System and network security monitoring, including intrusion detection and prevention arrangements, are typically employed to detect attacks on cloud systems and the supporting communications infrastructure  ...  Two-Level Auditing Structure: Cloud computing security or, more simply, cloud security refers to a broad set of policies, technologies, and controls deployed to protect data, applications, and the associated  ... 
doi:10.9790/0661-1902047377 fatcat:rdjmlentb5cafesyuaf3mnoroa

Context-Aware Computing and Nature-Inspired Computing

Phan Cong Vinh
2020 Journal on spesial topics in mobile networks and applications  
Phan Cong Vinh is presented to scientists, researchers, experts and students in the fields of context-aware computing and nature-inspired computing.  ...  Hopefully, they will find this part stimulating their research related to the hot topics of contextual cognitive computing and nature-inspired computing and being useful for their future work.  ...  Conclusions In preparation for this part, we acknowledge the study of all the authors for their worthful contributions to the part and their excellent efforts, and also reviewers to ensure the high quality  ... 
doi:10.1007/s11036-020-01534-2 fatcat:s4zzoef4rngujhielg5db4dr3a

Bounded-concurrent secure multi-party computation with a dishonest majority

Rafael Pass
2004 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04  
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number of corrupted parties.  ...  Finally, we extend the framework constructed to give a protocol for secure multi-party (and thus two-party) computation for any number of corrupted parties, which remains secure even when arbitrary subsets  ...  computation with a dishonest majority whose security is preserved under an a-priori bounded number of concurrent executions?  ... 
doi:10.1145/1007352.1007393 dblp:conf/stoc/Pass04 fatcat:zq2zrxbhnrfa7j5yrlg422cufa

Personalized Security Approaches in E-banking Employing Flask Architecture over Cloud Environment

Nayer A. Hamidi, G.K. Mahdi Rahimi, Alireza Nafarieh, Ali Hamidi, Bill Robertson
2013 Procedia Computer Science  
Employing mandatory access controls boosts the security of E-banking to a high level.  ...  The cloud environment is a suitable infrastructure to implement personalized security mechanisms for many big companies such as banks.  ...  In this Section, a model and all related policies to implement the personalized security in E-Banking over cloud computing is presented.  ... 
doi:10.1016/j.procs.2013.09.005 fatcat:yqqs4x5gi5dcrag554jiapvlqy

Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications [chapter]

Jonathan Katz
2003 Lecture Notes in Computer Science  
Of independent interest, we consider the concurrent composition of proofs of knowledge; this is essential to prove security of our protocols when run in an asynchronous, concurrent environment.  ...  ., the RSA or computational Diffie-Hellman assumption.  ...  I am grateful to Moti Yung and Rafail Ostrovsky for their many helpful comments and suggestions regarding the work described here.  ... 
doi:10.1007/3-540-39200-9_13 fatcat:erwmazstcvcjjditr3ytdkvoim

Access to Encrypted Data in Cloud Database

Sakshi Sanjay
2015 International Journal on Recent and Innovation Trends in Computing and Communication  
Cloud computing is a well-known technology which has become today"s important research area due to its ability to reduce the costs associated with computing.  ...  Proposed work attempts to overcome security threats related to data in data bases over cloud.  ...  So to make Cloud computing technology more secure, concurrent access to data on cloud and independent access of data; a framework is proposed to encrypt the data over cloud using various encryption algorithms  ... 
doi:10.17762/ijritcc2321-8169.150170 fatcat:wpl7bdrcejhr7aciwcf7rkkbdm

Distributed, Concurrent, and Independent Access to Encrypted Cloud Databases

Luca Ferretti, Michele Colajanni, Mirco Marchetti
2014 IEEE Transactions on Parallel and Distributed Systems  
This is the first solution supporting geographically distributed clients to connect directly to an encrypted cloud database, and to execute concurrent and independent operations including those modifying  ...  Placing critical data in the hands of a cloud provider should come with the guarantee of security and availability for data at rest, in motion, and in use.  ...  ACKNOWLEDGEMENTS We would like to thank Prof. Lorenzo Alvisi of the University of Texas at Austin for his constructive comments on preliminary versions of this paper.  ... 
doi:10.1109/tpds.2013.154 fatcat:xjail5tw3nhkvfnnhtllltj5im

Experimental Performance Evaluation of Cryptographic Algorithms on Sensor Nodes

Martin Passing, Falko Dressler
2006 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Sysetems  
Therefore, only theoretical measures were applied to demonstrate and discuss the behavior of security solutions.  ...  Many security solutions have been proposed in the domain of wireless sensor networks (WSN). Usually, all these approaches are based on well-known cryptographic algorithms.  ...  Using a terminal program, measurements and concurrent computations or data transmissions can be launched.  ... 
doi:10.1109/mobhoc.2006.278669 dblp:conf/mass/PassingD06 fatcat:5iid6l6xlnghlajs4zef6pwjoa

Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures [chapter]

Stanisław Jarecki, Anna Lysyanskaya
2000 Lecture Notes in Computer Science  
We put forward two new measures of security for threshold schemes secure in the adaptive adversary model: security under concurrent composition; and security without the assumption of reliable erasure.  ...  Our techniques are also applicable to other cryptosystems and signature schemes, like RSA, DSS, and ElGamal.  ...  She is also very grateful to Christian Cachin for helpful thoughts and discussions.  ... 
doi:10.1007/3-540-45539-6_16 fatcat:jwsmbtqovzasrkj55szd4zr74i
« Previous Showing results 1 — 15 out of 95,387 results