| Anna Lysyanskaya. Threshold cryptography secure against the adaptive adversary, concurrently. Theory of Cryptography Library, 2000. |
....Concurrency, Removing Erasures (Extended Abstract) Stanis law Jarecki and Anna Lysyanskaya MIT Laboratory for Computer Science, Cambridge, MA 02139, USA fstasio, annag theory.lcs.mit.edu Abstract. This extended abstract is a concise presentation of two independent results by Lysyanskaya [Lys00] and Jarecki and Lysyanskaya [JL00] We put forward two new measures of security for threshold schemes secure in the adaptive adversary model: security under concurrent composition [Lys00] and security without the assumption of reliable erasure [JL00] Using novel constructions and ....
....Abstract. This extended abstract is a concise presentation of two independent results by Lysyanskaya [Lys00] and Jarecki and Lysyanskaya [JL00] We put forward two new measures of security for threshold schemes secure in the adaptive adversary model: security under concurrent composition [Lys00] and security without the assumption of reliable erasure [JL00] Using novel constructions and analytical tools, in both these settings, we exhibit ecient secure threshold protocols for a variety of cryptographic applications. In particular, based on the recent scheme by Cramer Shoup, we ....
[Article contains additional citation context not shown here]
Anna Lysyanskaya. Threshold cryptography secure against the adaptive adversary, concurrently. Theory of Cryptography Library, 2000.
No context found.
Anna Lysyanskaya. Threshold cryptography secure against the adaptive adversary, concurrently. Theory of Cryptography Library, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC