88 search results - page 10 / 18 » Long-Term Security and Universal Composability |
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
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...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
CRYPTO
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
CTRSA
2011
Springer
12 years 11 months ago
2011
Springer
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...
PROVSEC
2009
Springer
14 years 2 months ago
2009
Springer
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...