Demo Data from EDBT 2026 / reviewers in the wild / expert
Yin Meng
dblp:381/2131
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 87% Blockchain and cryptocurrency security · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption |
0.9 | 1 | 2025 | Timed Anonymous Ring Signature With Application to Bidding Systems · IEEE Trans. Inf. Forensics Secur. 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
ring signature |
0.9 | 1 | 2025 | Timed Anonymous Ring Signature With Application to Bidding Systems · IEEE Trans. Inf. Forensics Secur. 2025 |
Methods — techniques the papers use, named apart from their topics
timed anonymity · 0.9CCA security · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Timed Anonymous Ring Signature With Application to Bidding SystemsabstractRing signatures enable a user to sign a message on behalf of a group while preserving both anonymity and unforgeability. Despite these strong privacy guarantees, they present regulatory challenges. To address these issues, we introduce a novel cryptographic primitive:timed anonymous ring signatures(TARS). Unlike group signatures, which rely on a trusted third party, TARS maintains the decentralization and unforgeability of traditional ring signatures while incorporatingtimed anonymity, allowing the signer’s identity to be disclosed by any user after a predetermined time period, denoted asT. To realize this, we propose a new CCA-securetimed public key encryption(TPKE) scheme that ensures correct decryption without the secret key after the timeT. Building upon TPKE, we present two concrete TARS constructions that guarantee anonymity until timeTand unforgeability at all times. To demonstrate its applicability, we apply TARS to a decentralized bidding system that is anticollusion between the auctioneer and the bidders. The system ensures anonymous bidding while disclosing the winner’s identity after the bid announcement, maintaining a transparent, fair, and decentralized bidding process. Finally, experimental evaluations confirm the practicality and efficiency of the proposed schemes. Crucially, the TARS scheme extends conventional ring signature schemes with timed anonymity by introducing only a moderate computational overhead (experimentally measured at ≈1.37 seconds under our configuration) while preserving their cryptographic robustness. Xiuju Huang, Cong Zuo 0001, Jun Shao 0001, Junke Duan, Wei Wang 0294, Yin Meng, Licheng Wang 0004 |
IEEE Trans. Inf. Forensics Secur. | 6 |