194 Hits in 2.7 sec

Page 136 of Human Resources Abstracts Vol. 37, Issue 1 [page]

2002 Human Resources Abstracts  
The protocol allows each host to update the data it previously submitted in a way that is suitable for free competition scenarios, such as comparative shopping or distributed auction, and for highly dynamic  ...  This protocol is based on an original secure Cryptographic technique that assures the integrity of a sequence of data seg- ments regardless of the order of each segment in the sequence.  ... 

Secure Computing, Economy, and Trust: A Generic Solution for Secure Auctions with Real-World Applications

Peter Bogetoft, Ivan B. Damgård, Thomas Jakobsen, Kurt Nielsen, Jakob Pagter, Tomas Toft
2005 BRICS Report Series  
We combine knowledge from economics, cryptography and security engineering and develop and implement secure auctions for practical real-world problems.  ...  <br /> <br />In essence this paper is an overview of the research project SCET--Secure Computing, Economy, and Trust-- which attempts to build auctions for real applications using secure multiparty computation  ...  Prototype We are currently in the process of implementing the cryptographic protocols of (30) as well as the auctions of (31) on top of the protocols.  ... 
doi:10.7146/brics.v12i18.21884 fatcat:x72vd4zfafclzcvgmiqfbfzb7a

Quantum auctions: Facts and myths

Edward W. Piotrowski, Jan Sładkowski
2008 Physica A: Statistical Mechanics and its Applications  
In this paper we introduce the concept of a quantum auction, its advantages and drawbacks. Then we describe the models that have already been put forward.  ...  With present technology, optical networks, single photon sources and detectors seems to be sufficient for experimental realization in the near future.  ...  Shortly, a protocol for a quantum auction should specify the following steps. • Auctioneer specifies conventional "classical" details of the auction such as the schedule, goods to be sold etc. • Auctioneer  ... 
doi:10.1016/j.physa.2008.02.071 fatcat:z3kxtjyy5ncm5ontensshe4inq

Efficient private bidding and auctions with an oblivious third party

Christian Cachin
1999 Proceedings of the 6th ACM conference on Computer and communications security - CCS '99  
Applications include bargaining between two parties and secure and efficient auctions in the absence of a fully trusted auction service.  ...  We describe a novel and efficient protocol for the following problem: A wants to buy some good from B if the price is less than a.  ...  Applications Apart from two-party private bidding by itself, our protocol can be used for bargaining on the Internet and as a building block for secure auction protocols.  ... 
doi:10.1145/319709.319726 dblp:conf/ccs/Cachin99 fatcat:3lkcjqwbnjeyvd2ca4leqz5oya

Page 1733 of Mathematical Reviews Vol. , Issue 95c [page]

1995 Mathematical Reviews  
, Cryptographic protocols and voting (307-316); Hannu Nurmi, Cryptographic protocols for auctions and bargaining (317-324); Gheorghe Paun, Jiirgen Dassow and Stefan Skalla, On the size of components of  ...  proof procedures for a cardinality based language in propositional calculus (71-82); Burchard von Braunmiihl, Romain Gengler and Robert Rettinger, The alternation hierarchy for machines with sublogarithmic  ... 

Survey: secure opportunistic routing protocols in wireless networks

Hanane Saidi, Addaim Adnane, Driss Gretete
2019 International Journal of Information Privacy Security and Integrity  
In this paper, we are going to give an analysis of OR protocols their classifications as well as an overview on the security approaches available for opportunistic routing protocols.  ...  These protocols select the best path in order to send information and take the broadcasting medium into consideration.  ...  INPAC INPAC is a combination of cryptographic and game theory techniques. It is an improvement of MORE protocol for wireless mesh schemes.  ... 
doi:10.1504/ijipsi.2019.10025219 fatcat:7nb3pirzebcv5eevyy3ehn6b7y

Applications of Economic and Pricing Models for Wireless Network Security: A Survey [article]

Nguyen Cong Luong, Dinh Thai Hoang, Ping Wang, Dusit Niyato, Zhu Han
2017 arXiv   pre-print
and prevent attacks to be performed.  ...  Finally, we highlight important challenges, open issues and future research directions of applying economic and pricing models to wireless security issues.  ...  The auctioneer then employs the bargaining game [103] to bargain with the campaigner on a deal price for each crowd.  ... 
arXiv:1707.07846v1 fatcat:xb3jvolwmjad7oxdefdd2pq7dq

Argumentative Negotiations with Anonymous Informer Agents

Javier Carbo, José M. Molina, Jorge Davila
2002 Information & Security An International Journal  
Provided the user agent is able to propose counter-offerings, a greater level of sophistication can be achieved. 11 However, auctions are very different from the daily bargaining at markets.  ...  achieved by cryptographic mechanisms: privacy, authentication, non-repudiation, integrity, and access control. 18 1.  ... 
doi:10.11610/isij.0811 fatcat:hygag6bvhrfdbhzt2hkfiav3cy

Blockchain-based Trusty Buyer Coalition Scheme Using A Group Signature

Laor Boongasame, Supansa Chaising, Punnarumol Temdee
2021 Journal of Mobile Multimedia  
Furthermore, the proposed algorithm can ensure correctness and accountability by recognizing misbehavior and enforcing alternative forms of punishment.  ...  Despite the tremendous need for trustworthy relationships in buyer coalitions, no current buyer coalition scheme explicitly tackles confidence issues with blockchain technology.  ...  Theoretical Background Auction An auction is a process of purchasing and selling products or services by putting them up for sale, taking bids, and then selling or buying the item from the highest or  ... 
doi:10.13052/jmm1550-4646.1823 fatcat:2zlqbanwejeunpzgidbxdwem3y

Per-Hop Reversed Packet Auctions for Cooperative Routing in Mobile Wireless Networks

Lucas S. Brito, Marcelo M. Carvalho
2021 IEEE Access  
At each hop, the sender asks for bids from potential relays according to a "budget" attached to the data packet, through which the auction winner gets paid and can pay for others in subsequent auctions  ...  The performance of the Tightness strategy is evaluated for both static and mobile scenarios and compared to two baseline strategies according to different performance metrics.  ...  Based on this result, they have proposed the Corsac on-demand routing protocol, which adheres to weaker requirements than those for a forwarding-dominant protocol, and uses cryptographic techniques to  ... 
doi:10.1109/access.2021.3061258 fatcat:vhvl3z6ymbae5go7fufvkkbs3a

An auction method for resource allocation in computational grids

Hesam Izakian, Ajith Abraham, Behrouz Tork Ladani
2010 Future generations computer systems  
In this paper, we introduce a continuous double auction method (CDA) for grid resource allocation in which resources are considered as provider agents and users as consumer agents.  ...  In such systems using market-like techniques for this problem regulates the supply and demand for resources, provides an incentive for providers, and motivates the users to trade-off between deadline,  ...  His research interests include Formal Specification and Verification, Cryptographic Protocols, Multi Agent Security, and Web Services.  ... 
doi:10.1016/j.future.2009.08.010 fatcat:l5z5bxocqrernpcpnswkxi53u4

Credible Mechanism Design

Mohammad Akbarpour, Shengwu Li
2017 Social Science Research Network  
The ascending auction is the unique credible strategy-proof mechanism. , and several seminar participants for valuable comments.  ...  Consider an extensive-form mechanism, run by an auctioneer who communicates sequentially and privately with agents.  ...  Some papers model auctions as bargaining games in which the auctioneer cannot commit to close a sale (McAdams and Schwarz, 2007a; Vartiainen, 2013) .  ... 
doi:10.2139/ssrn.3033208 fatcat:otn4ztv3yffozdtencyqkqhiye

From Keys to Databases—Real-World Applications of Secure Multi-Party Computation

David W Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P Smart, Rebecca N Wright
2018 Computer journal  
For many decades this was perceived to be of purely theoretical interest, but now it has started to find application in a number of use cases.  ...  We discuss the widely increasing range of applications of a cryptographic technique called Multi-Party Computation.  ...  The initial commercial application was auctions, which was also the first large scale use of MPC in the (now famous) sugar beet auction [5] .  ... 
doi:10.1093/comjnl/bxy090 fatcat:dnpklhzlcfca3autnp3wftkdya

Active routing

N.F. Maxemchuk, S.H. Low
2001 IEEE Journal on Selected Areas in Communications  
., to be quickly deployed, without waiting for standards, and to allow different routing mechanisms, that provide similar services, to compete.  ...  We establish a framework to quantitatively compare networks and service providers. As an example, we route Internet protocol (IP) telephony over combinations of circuit and packet networks.  ...  is the price from an auction for , and 's excess savings is is the profit from a single service auction for .  ... 
doi:10.1109/49.917714 fatcat:bf6uhr572fbexdiqdv7sgjbcs4

Formalizing and Securing Relationships on Public Networks

Nick Szabo
1997 First Monday  
Instead of developing a new or modified cryptographic protocol for each contracting problem, capabilities may allow us to design a rich variety of distributed security protocols over a common cryptographic  ...  These range from simple haggling to sophisticated auctions and exchanges.  ... 
doi:10.5210/fm.v2i9.548 fatcat:mzm3n33zp5hdjkrttkyl6xklei
« Previous Showing results 1 — 15 out of 194 results