Sciweavers

1923 search results - page 4 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
GCC
2003
Springer
14 years 1 months ago
Research on Security Architecture and Protocols of Grid Computing System
This paper analyzes security problems existing in Grid Computing System and describes the security mechanism in Grid Computing System. After briefly introducing the security abstra...
Xiangming Fang, Shoubao Yang, Leitao Guo, Lei Zhan...
JOC
2007
94views more  JOC 2007»
13 years 8 months ago
On Unconditionally Secure Distributed Oblivious Transfer
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Dou...
CMSB
2006
Springer
14 years 4 days ago
Probabilistic Model Checking of Complex Biological Pathways
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
John Heath, Marta Z. Kwiatkowska, Gethin Norman, D...
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 8 months ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
ASIACRYPT
2005
Springer
14 years 2 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen