Sciweavers

165 search results - page 25 / 33
» Safely Composing Security Protocols
Sort
View
CRYPTO
2007
Springer
109views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
Ivan Damgård, Serge Fehr, Renato Renner, Lou...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
76
Voted
CRYPTO
2003
Springer
93views Cryptology» more  CRYPTO 2003»
15 years 2 months ago
Universal Composition with Joint State
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
Ran Canetti, Tal Rabin
FOCS
2007
IEEE
15 years 4 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
ICALP
2003
Springer
15 years 2 months ago
Secrecy in Untrusted Networks
We investigate the protection of migrating agents against the untrusted sites they traverse. The resulting calculus provides a formal framework to reason about protection policies ...
Michele Bugliesi, Silvia Crafa, Amela Prelic, Vlad...