13 search results - page 2 / 3 » On Black-Box Complexity of Universally Composable Security i... |
CSFW
2012
IEEE
11 years 7 months ago
2012
IEEE
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
CRYPTO
2007
Springer
13 years 11 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...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...