Sciweavers

621 search results - page 15 / 125
» Efficient Secure Multi-party Computation
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
ISW
2010
Springer
13 years 7 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
ACISP
2006
Springer
14 years 1 months ago
Efficient Identity-Based Signatures Secure in the Standard Model
The only known construction of identity-based signatures that can be proven secure in the standard model is based on the approach of attaching certificates to non-identity-based si...
Kenneth G. Paterson, Jacob C. N. Schuldt
EURONGI
2008
Springer
13 years 11 months ago
Secure and Efficient Data Collection in Sensor Networks
Sensor networks are a very specific type of wireless networks where both security and performance issues need to be solved efficiently in order to avoid manipulations of the sensed...
Cristina Cano, Manel Guerrero, Boris Bellalta
EUROPKI
2008
Springer
13 years 11 months ago
Efficient Generic Forward-Secure Signatures and Proxy Signatures
We propose a generic method to construct forward-secure signature schemes from standard signature schemes. The proposed construction is more computationally efficient than previous...
Basel Alomair, Krishna Sampigethaya, Radha Poovend...