Global digitalization has accelerated, leading to continuous online shopping and services growth. However, the centralized nature of traditional e-commerce platforms raises concerns about data control, privacy, and potential single points of failure. Blockchain technology offers a decentralized alternative that addresses these issues, improving online transactions with enhanced privacy and anonymity for users. This article explores the problem of anonymization in web services by developing an anonymous online auction system using blockchain and zero-knowledge proof (ZKP). We propose a solution that employs ZKP in two stages: first, to verify that a user is eligible to participate in the auction, thereby creating a list of potential bidders; second, to prove that a bid is placed by a user from this list without disclosing their identity. This approach allows participants to engage in auctions anonymously, protecting their interests from competitors and sellers. The system eliminates the need for a trusted third party by leveraging the blockchain immutable ledger for transparency, giving users full control over their data and participation. We present the architecture and implementation details of the system, demonstrating its feasibility and potential to enhance privacy and security in online auctions.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
This paper proposes a new blockchain-based transaction verification infrastructure for co-payment and data verification for multi-modal public transportation systems. Our solution offers a decentralized platform that ensures secure co-payments and data integrity while addressing interoperability, data security and transactional transparency. With a private blockchain, transportation providers act as nodes and validated, consensus-approved transactions increase trust and transparency. A standardized data format and robust algorithms for data contribution by transport operators are developed as well as a model for operators, assets, and transactions. Including zero-knowledge proofs improves user privacy by allowing secure authentication without revealing sensitive data. We believe that this research may lead a closer collaboration between public transport operators and provide an enhanced user experience while enabling transport transaction security and data verification.
We propose building a new PKC in a ring structure, the classification of rings being an open problem. The difficulty of the scheme is based on retrieving the eigenvalues of endomorphism on a finite type module over a non-commutative ring. It is resistant to a chosen cipher text attack. Working in the fraction ring of a non-commutative ring makes our scheme a zero-knowledge proof of knowledge, result indistinguishable, in the Naor-Yung model. Finally, a dramatic improvement in security is obtained through the drawing with uniform probability of the working ring at high frequency.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.