Sciweavers

172 search results - page 17 / 35
» Black-Box Constructions of Protocols for Secure Computation
Sort
View
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
13 years 11 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
IACR
2011
196views more  IACR 2011»
12 years 7 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
IWNAS
2008
IEEE
14 years 2 months ago
Event-based Trust Framework Model in Wireless Sensor Networks
The security of wireless sensor networks is ever more important nowadays. Most of the proposed security protocols in wireless sensor networks are based on authentication and encry...
Haiguang Chen, Huafeng Wu, Jinchu Hu, Chuanshan Ga...
JCP
2006
120views more  JCP 2006»
13 years 7 months ago
Password-authenticated Key Exchange using Efficient MACs
Abstract-- This paper is concerned with passwordauthenticated key agreement protocols. Designing such protocols represents an interesting challenge since there is no standard way o...
Maurizio Adriano Strangio
CCS
2001
ACM
14 years 11 days ago
The performance of public key-enabled kerberos authentication in mobile computing applications
Authenticating mobile computing users can require a significant amount of processing and communications resources— particularly when protocols based on public key encryption are...
Alan Harbitter, Daniel A. Menascé