Sciweavers

530 search results - page 78 / 106
» Practical Threshold Signatures
Sort
View
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
EUROPKI
2007
Springer
14 years 2 months ago
E-Passports as a Means Towards the First World-Wide Public Key Infrastructure
Millions of citizens around the world have already acquired their new electronic passport. The e-passport is equipped with contactless communication capability, as well as with a s...
Dimitrios Lekkas, Dimitris Gritzalis
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
14 years 2 months ago
Long-Term Security and Universal Composability
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...
Jörn Müller-Quade, Dominique Unruh
FASE
2005
Springer
14 years 1 months ago
Automatic Conformance Testing of Web Services
Web Services are the basic building blocks of next generation Internet applications, based on dynamic service discovery and composition. Dedicated discovery services will store bot...
Reiko Heckel, Leonardo Mariani
TCC
2005
Springer
176views Cryptology» more  TCC 2005»
14 years 1 months ago
How to Securely Outsource Cryptographic Computations
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
Susan Hohenberger, Anna Lysyanskaya