22 search results - page 1 / 5 » A Note on Universal Composable Zero Knowledge in Common Refe... |
TAMC
2007
Springer
13 years 11 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...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to aâ€...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
TCC
2007
Springer
13 years 11 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...
CTRSA
2006
Springer
13 years 9 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...