Sciweavers

4111 search results - page 39 / 823
» Security, Protocols, and Trust
Sort
View
PODC
2004
ACM
14 years 2 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
ICALP
2009
Springer
14 years 9 months ago
Secure Function Collection with Sublinear Storage
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
Maged H. Ibrahim, Aggelos Kiayias, Moti Yung, Hong...
INFOCOM
2005
IEEE
14 years 2 months ago
PIKE: peer intermediaries for key establishment in sensor networks
— The establishment of shared cryptographic keys between communicating neighbor nodes in sensor networks is a challenging problem due to the unsuitability of asymmetric key crypt...
Haowen Chan, Adrian Perrig
EUROPKI
2009
Springer
13 years 6 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...
CSFW
2010
IEEE
14 years 21 hour ago
A Framework for the Sound Specification of Cryptographic Tasks
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou