Sciweavers

310 search results - page 56 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
IJISEC
2010
159views more  IJISEC 2010»
14 years 6 months ago
A generalization of Paillier's public-key system with applications to electronic voting
We propose a generalization of Paillier's probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme e...
Ivan Damgård, Mads Jurik, Jesper Buus Nielse...
PERCOM
2009
ACM
15 years 4 months ago
Randomizing RFID Private Authentication
—Privacy protection is increasingly important during authentications in Radio Frequency Identification (RFID) systems. In order to achieve high-speed authentication in largescale...
Qingsong Yao, Yong Qi, Jinsong Han, Jizhong Zhao, ...
ASIACRYPT
2008
Springer
14 years 11 months ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...
INFOCOM
2005
IEEE
15 years 3 months ago
Reduction of quality (RoQ) attacks on Internet end-systems
— Current computing systems depend on adaptation mechanisms to ensure that they remain in quiescent operating regions. These regions are often defined using efficiency, fairnes...
Mina Guirguis, Azer Bestavros, Ibrahim Matta, Yuti...
IANDC
2007
152views more  IANDC 2007»
14 years 9 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner