352 search results - page 10 / 71 » Adaptively Secure Multi-Party Computation |
TCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
IEEEIAS
2008
IEEE
14 years 2 months ago
2008
IEEE
Modern cars offer an increasingly powerful Multimedia environment. While also the potential for an application as Human Computer Interface (HCI) is growing, in this paper we conce...
ATC
2007
Springer
13 years 12 months ago
2007
Springer
Service-based Systems (SBS) have the advantage of composing distributed systems from various services provided by multiple providers transparently. In addition to functional correc...
FOCS
1999
IEEE
14 years 4 days ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...