scholarly journals Publicly Verifiable M + 1st-Price Auction Fit for IoT with Minimum Storage

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Po-Chu Hsu ◽  
Atsuko Miyaji
Keyword(s):  
Third Party ◽  
Distributed Network ◽  
Trusted Third Party ◽  
Public Verifiability ◽  
Bidding Price ◽  
Malicious Model ◽  
Price Auction ◽  
First Time

In an M + 1 st-price auction, all bidders submit their bids simultaneously, and the M highest bidders purchase M identical goods at the M + 1 st bidding price. Previous research is constructed based on trusted managers such as a trusted third party (TTP), trusted mix servers, and honest managers. All of the previous auctions are not fit for edge-assisted IoT since they need TTP. In this paper, we formalize a notion of commutative bi-homomorphic multiparty encryption and achieve no-TTP M + 1 -st auction based on blockchain with public verifiability. Our M + 1 st auction guarantees financial fairness, robustness, and correctness without TTP and is secure under a malicious model for the first time. Our M + 1 st auction can be executed over a distributed network and is thus fit for edge-assisted IoT. Furthermore, our formalized commutative bi-homomorphic multiparty encryption can be used in various applications for edge-assisted IoT, which needs to protect privacy and correctness.

scholarly journals A Quantum Dual-Signature Protocol Based on SNOP States without Trusted Participant

Entropy ◽  
2021 ◽  
Vol 23 (10) ◽  
pp. 1294
Author(s):  
Kejia Zhang ◽  
Xu Zhao ◽  
Long Zhang ◽  
Guojing Tian ◽  
Tingting Song
Keyword(s):  
Quantum Signature ◽  
Third Party ◽  
Trusted Third Party ◽  
Protocol Security ◽  
Verification Process ◽  
Orthogonal Product ◽  
First Time

Quantum dual-signature means that two signed quantum messages are combined and expected to be sent to two different recipients. A quantum signature requires the cooperation of two verifiers to complete the whole verification process. As an important quantum signature aspect, the trusted third party is introduced to the current protocols, which affects the practicability of the quantum signature protocols. In this paper, we propose a quantum dual-signature protocol without arbitrator and entanglement for the first time. In the proposed protocol, two independent verifiers are introduced, here they may be dishonest but not collaborate. Furthermore, strongly nonlocal orthogonal product states are used to preserve the protocol security, i.e., no one can deny or forge a valid signature, even though some of them conspired. Compared with existing quantum signature protocols, this protocol does not require a trusted third party and entanglement resources.

Enhancing Privacy in PUF-Cash through Multiple Trusted Third Parties and Reinforcement Learning

2022 ◽  
Vol 18 (1) ◽  
pp. 1-26
Author(s):  
Georgios Fragkos ◽  
Cyrus Minwalla ◽  
Eirini Eleni Tsiropoulou ◽  
Jim Plusquellic
Keyword(s):  
User Anonymity ◽  
Third Party ◽  
Security And Privacy ◽  
Machine Learning Techniques ◽  
User Privacy ◽  
Trusted Third Party ◽  
Physical Unclonable Functions ◽  
Learning Techniques ◽  
Direct Contrast ◽  
Debit Cards

Electronic cash ( e-Cash ) is a digital alternative to physical currency such as coins and bank notes. Suitably constructed, e-Cash has the ability to offer an anonymous offline experience much akin to cash, and in direct contrast to traditional forms of payment such as credit and debit cards. Implementing security and privacy within e-Cash, i.e., preserving user anonymity while preventing counterfeiting, fraud, and double spending, is a non-trivial challenge. In this article, we propose major improvements to an e-Cash protocol, termed PUF-Cash, based on physical unclonable functions ( PUFs ). PUF-Cash was created as an offline-first, secure e-Cash scheme that preserved user anonymity in payments. In addition, PUF-Cash supports remote payments; an improvement over traditional currency. In this work, a novel multi-trusted-third-party exchange scheme is introduced, which is responsible for “blinding” Alice’s e-Cash tokens; a feature at the heart of preserving her anonymity. The exchange operations are governed by machine learning techniques which are uniquely applied to optimize user privacy, while remaining resistant to identity-revealing attacks by adversaries and trusted authorities. Federation of the single trusted third party into multiple entities distributes the workload, thereby improving performance and resiliency within the e-Cash system architecture. Experimental results indicate that improvements to PUF-Cash enhance user privacy and scalability.

scholarly journals Decentralized collaborative TTP free approach for privacy preservation in location based services

2019 ◽  
Vol 9 (6) ◽  
pp. 5376
Author(s):  
Ajaysinh Devendrasinh Rathod ◽  
Saurabh Shah ◽  
Vivaksha J. Jariwala
Keyword(s):  
Privacy Preservation ◽  
Location Privacy ◽  
Emergency Services ◽  
Personal Information ◽  
Personal Digital Assistant ◽  
Minimum Cost ◽  
Location Based Services ◽  
Third Party ◽  
Trusted Third Party ◽  
Recent Trends

In recent trends, growth of location based services have been increased due to the large usage of cell phones, personal digital assistant and other devices like location based navigation, emergency services, location based social networking, location based advertisement, etc. Users are provided with important information based on location to the service provider that results the compromise with their personal information like user’s identity, location privacy etc. To achieve location privacy of the user, cryptographic technique is one of the best technique which gives assurance. Location based services are classified as Trusted Third Party (TTP) & without Trusted Third Party that uses cryptographic approaches. TTP free is one of the prominent approach in which it uses peer-to-peer model. In this approach, important users mutually connect with each other to form a network to work without the use of any person/server. There are many existing approaches in literature for privacy preserving location based services, but their solutions are at high cost or not supporting scalability.  In this paper, our aim is to propose an approach along with algorithms that will help the location based services (LBS) users to provide location privacy with minimum cost and improve scalability.

Protecting a Distributed Voting Schema for Anonymous and Secure Voting Against Attacks of Malicious Partners

2013 ◽  
pp. 283-301
Author(s):  
Sebastian Obermeier ◽  
Stefan Böttcher
Keyword(s):  
Information Exchange ◽  
Third Party ◽  
Distributed Protocol ◽  
Trusted Third Party ◽  
Fixed Group ◽  
Malicious Behavior ◽  
Is Failure

A distributed protocol is presented for anonymous and secure voting that is failure-tolerant with respect to malicious behavior of individual participants and that does not rely on a trusted third party. The proposed voting protocol was designed to be executed on a fixed group of N known participants, each of them casting one vote that may be a vote for abstention. Several attack vectors on the protocol are presented, and the detection of malicious behavior like spying, suppressing, inventing, and modifying protocol messages or votes by the protocol is shown. If some participants stop the protocol, a fair information exchange is achieved in the sense that either all votes are guaranteed to be valid and accessible to all participants, or malicious behavior has been detected and the protocol is stopped, but the votes are not disclosed.

Sign in / Sign up

Export Citation Format

Share Document