Social Media are an important communication tool in today's society. In recent years, many events have been held online due to COVID-19, making even more tool. However, it is difficult explicitly imagine the recipients of messages when posting on and there a tendency provide information easily, leading existence inappropriate postings that user does not intend. Furthermore, disclose for anonymous Twitter. This cause link problem between posts. our proposal, we realize way solve these...

In an <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" id="M1"> <a:mi>M</a:mi> <a:mo>+</a:mo> <a:mn>1</a:mn> </a:math> st-price auction, all bidders submit their bids simultaneously, and the <c:math xmlns:c="http://www.w3.org/1998/Math/MathML" id="M2"> <c:mi>M</c:mi> </c:math> highest purchase <e:math xmlns:e="http://www.w3.org/1998/Math/MathML" id="M3"> <e:mi>M</e:mi> </e:math> identical goods at <g:math xmlns:g="http://www.w3.org/1998/Math/MathML" id="M4"> <g:mi>M</g:mi> <g:mo>+</g:mo>...

A. M+1 st-price auction is an method in which all bidders submit their bids simultaneously, and the M highest purchase identical goods at M+ 1st bidding price. Previous researches use trusted third party (TTP), mix server, honest managers. We propose efficient secure protocol that guarantees financial fairness, robustness correctness without any manager or TTP under malicious model for first time. also proposed a new mechanism to verify bids. This can be used protocols based on encrypted bits.

Social media (SM) has become a primary communication tool in the modern world, with an ever-increasing volume of users. Many SM users use anonymous nicknames as their public usernames. However, Zhang et al. (2018) were able to demonstrate attack that can identify from contents posts. This is caused by fact two different posts be guessed same user. Such linking called linkable feature. On other hand, usually post under nickname, but when thrust into limelight, we may want claim our own....

An auction is commonly used to sell limited resources in modern society. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i> + 1st-price sells identical goods xmlns:xlink="http://www.w3.org/1999/xlink">B</i> bidders. The top winners can buy the at +1st-price. Each bidder sends their bids secretly as a bit-slice bidding vector trusted manager. Bit-slice compare secret values without revealing them. However, also limits upper bound of bid...

<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$M+ 1\text{st}$</tex> -price auction, also called Vickrey is a type of sealed-bid auction to sell xmlns:xlink="http://www.w3.org/1999/xlink">$M$</tex> identical goods. xmlns:xlink="http://www.w3.org/1999/xlink">$B$</tex> bidders secretly choose price from xmlns:xlink="http://www.w3.org/1999/xlink">$p$</tex> bidding points as their bid. The top can buy the goods at price. A trusted manager commonly...