Sciweavers

432 search results - page 38 / 87
» Open Problems with Part-Whole Relations
Sort
View
101
Voted
JITECH
2010
116views more  JITECH 2010»
14 years 11 months ago
Design theory for dynamic complexity in information infrastructures: the case of building internet
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
Ole Hanseth, Kalle Lyytinen
72
Voted
CSFW
2009
IEEE
15 years 7 months ago
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...
87
Voted
DANCE
2002
IEEE
15 years 5 months ago
Experiences with Capsule-Based Active Networking
Active Networking adds programmability to the elements of the network, most aggressively by using programmable packets, or capsules. ANTS [1, 2] and PLANet [3, 4] are the most mat...
Michael W. Hicks, Jonathan T. Moore, David Wethera...
81
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
Efficient transmission of MP3 streams over VPNs
— Multimedia applications communicating over a next generation VPN architecture that allows selective encryption can leverage the security properties of a VPN with its performanc...
Shashank Khanvilkar, Ashfaq A. Khokhar
CRYPTO
2004
Springer
127views Cryptology» more  CRYPTO 2004»
15 years 5 months ago
IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange
Abstract. In this paper we revisit one of the most popular passwordbased key exchange protocols, namely the OKE (for Open Key Exchange) scheme, proposed by Luck in 1997. Our result...
Dario Catalano, David Pointcheval, Thomas Pornin