123 search results - page 4 / 25 » Composable Security in the Bounded-Quantum-Storage Model |
TCC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
TAMC
2007
Springer
15 years 3 months ago
2007
Springer
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...
CRYPTO
2004
Springer
15 years 2 months ago
2004
Springer
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
102
click to vote
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
STOC
2002
ACM
15 years 9 months ago
2002
ACM
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...