Sciweavers

621 search results - page 24 / 125
» Efficient Secure Multi-party Computation
Sort
View
ACISP
2000
Springer
14 years 3 months ago
An Extremely Small and Efficient Identification Scheme
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
William D. Banks, Daniel Lieman, Igor Shparlinski
TC
2008
13 years 11 months ago
Computationally Efficient PKI-Based Single Sign-On Protocol, PKASSO for Mobile Devices
In an attempt to expand Public Key Infrastructure (PKI) usage to a ubiquitous and mobile computing environment, we found that the deployment of the PKI on a resource-constrained de...
Ki-Woong Park, Sang Seok Lim, Kyu Ho Park
ASIACRYPT
2008
Springer
14 years 29 days ago
Towards Robust Computation on Encrypted Data
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previo...
Manoj Prabhakaran, Mike Rosulek
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
14 years 1 days ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
PERCOM
2006
ACM
14 years 10 months ago
The Master Key: A Private Authentication Approach for Pervasive Computing Environments
We propose a novel entity authentication approach for pervasive computing environments. A person uses a single device, the Master Key, which aggregates all his digital forms of ac...
Feng Zhu, Matt W. Mutka, Lionel M. Ni