88 search results - page 2 / 18 » Long-Term Security and Universal Composability |
CSFW
2009
IEEE
14 years 1 days ago
2009
IEEE
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
ACNS
2004
Springer
13 years 9 months ago
2004
Springer
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
ISW
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized ...
INDOCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
ICALP
2007
Springer
13 years 7 months ago
2007
Springer
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...