Sciweavers

6164 search results - page 237 / 1233
» Teaching Computer Security
Sort
View
TRUST
2010
Springer
15 years 11 months ago
Token-Based Cloud Computing
Secure outsourcing of computation to an untrusted (cloud) service provider is becoming more and more important. Pure cryptographic solutions based on fully homomorphic and verifia...
Ahmad-Reza Sadeghi, Thomas Schneider 0003, Marcel ...
TGC
2007
Springer
16 years 22 days ago
Computational Soundness of Equational Theories (Tutorial)
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...
Steve Kremer
CIS
2004
Springer
16 years 15 hour ago
A Scalable and Reliable Mobile Agent Computation Model
This paper presents a high performance service based mobile agent computation model. The scalability and reliability of this model is secured through the service clone policy and a...
Yong Liu, Congfu Xu, Zhaohui Wu, Yunhe Pan
CANS
2008
Springer
98views Cryptology» more  CANS 2008»
15 years 8 months ago
Counting Method for Multi-party Computation over Non-abelian Groups
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
Youming Qiao, Christophe Tartary
FOCS
2010
IEEE
15 years 4 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai