123 search results - page 6 / 25 » Composable Security in the Bounded-Quantum-Storage Model |
CRYPTO
2006
Springer
15 years 1 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, ...
SOCO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Non-functional requirements encompass important design concerns such as schedulability, security, and communication constraints. In model-based development they non-local...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
ISW
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...