2601 search results - page 70 / 521 » Secure Rewarding Schemes |
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
We present the currently simplest, most efficient, optimally resilient, adaptively secure, and proactive threshold RSA scheme. A main technical contribution is a new rewinding stra...
123
click to vote
FORTE
2003
15 years 1 months ago
2003
Abstract. This paper describes the analysis of Pull-Based Asynchronous Rekeying Framework (ARF), a recently proposed solution to the scalable group key management problem in secure...
102
click to vote
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
TCC
2009
Springer
16 years 12 days ago
2009
Springer
We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following sep...
ISW
2004
Springer
15 years 5 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 ...