Auflistung nach Autor:in "Conrad, Michael"
1 - 2 von 2
Treffer pro Seite
Sortieroptionen
- KonferenzbeitragCombining service-orientation and peer-to-peer networks(Kommunikation in Verteilten Systemen (KiVS), 2005) Conrad, Michael; Dinger, Jochen; Hartenstein, Hannes; Schöller, Markus; Zitterbart, MartinaAlmost all current P2P applications are built as monolithic systems: they tightly couple application software with an underlying P2P technology. For simple P2P applications like file sharing of instant messaging this does not represent a deficiency. For more general scenarios, e.g., for providing an electronic market place based on P2P technology, flexibility has to be increased. We propose to decouple the application from its underlying P2P network and introduce a mechanism that allows us to dynamically bind an overlay from a given set to a specific application. This paper describes the design of such a system's architecture that combines the service-oriented architecture paradigm and P2P technology. Using these two different technologies in an integrated way gives us flexibility to bind the best fitting P2P network to the executed service. In addition, it allows us to easily add and deploy new services.
- ZeitschriftenartikelDistributed ascending proxy auction — A cryptographic approach(Wirtschaftsinformatik: Vol. 48, No. 1, 2006) Rolli, Daniel; Conrad, Michael; Neumann, Dirk; Sorge, ChristophIn recent years, auctions have become a very popular price discovery mechanism in the Internet. The common auction formats are typically centralized in nature. The peer-to-peer paradigm demands gearing up auctions for decentralized infrastructures. In this context, this paper proposes a distributed mechanism for ascending second-price auctions that relies on standard cryptographic algorithms. In essence, the auction protocol has the capability of preserving the privacy of the winning bidder’s true valuation.The auction protocol makes use of a high number of auctioneers divided into several groups. A bidder creates an encrypted chain of monotonously increasing bidding steps, where each bidding step can be decrypted by a different auctioneer group. This considerably reduces the attack and manipulation possibilities of malicious auctioneers. In addition, this secure approach does not require bidders to be online unless they are submitting their bid chain to the auctioneers.