Sciweavers

165 search results - page 9 / 33
» Safely Composing Security Protocols
Sort
View
TAMC
2007
Springer
15 years 3 months ago
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
ICISC
2008
126views Cryptology» more  ICISC 2008»
14 years 11 months ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
INFOCOM
2010
IEEE
14 years 7 months ago
SafeQ: Secure and Efficient Query Processing in Sensor Networks
The architecture of two-tiered sensor networks, where storage nodes serve as an intermediate tier between sensors and a sink for storing data and processing queries, has been widel...
Fei Chen, Alex X. Liu
CTRSA
2011
Springer
189views Cryptology» more  CTRSA 2011»
14 years 1 months ago
Ideal Key Derivation and Encryption in Simulation-Based Security
Abstract. Many real-world protocols, such as SSL/TLS, SSH, IPsec, IEEE 802.11i, DNSSEC, and Kerberos, derive new keys from other keys. To be able to analyze such protocols in a com...
Ralf Küsters, Max Tuengerthal
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin