Practical Non-Interactive Blind Signatures for Anonymous Digital Tokens
This research presents practical non-interactive blind signature constructions using standard PKI keys, enabling widespread anonymous digital token issuance without revealing user data.
Oblivious Accumulators Ensure Data Privacy and Set Size Hiding
Oblivious accumulators introduce a cryptographic primitive for private set commitments, enabling decentralized systems to conceal sensitive data and its scale.
Lattice-Based Accumulators Enable Post-Quantum Revocable Anonymous Credentials
This research introduces a novel lattice-based accumulator, offering a post-quantum secure and communication-efficient method for revoking anonymous digital credentials.
ECDSA-based Anonymous Credentials Enhance Digital Identity Privacy and Efficiency
New ECDSA-based anonymous credentials offer unprecedented efficiency for privacy-preserving digital identity, bypassing costly infrastructure changes for broad adoption.
Verifiable Attribute Trees Enable Private, Decentralized Credential Revocation
A novel cryptographic primitive, Verifiable Attribute Trees, secures anonymous credentials with efficient, privacy-preserving, and decentralized revocation, fostering robust digital identity.
Supervised Decentralized Identity Balances Anonymity, Revocability, and Regulatory Oversight
A novel DID framework integrates dynamic accumulators and zero-knowledge proofs to enable regulatory oversight and credential revocation without sacrificing user privacy.
Zero-Knowledge Credentials from ECDSA Signatures Enable Private Identity
This ZK argument system composes Ligero with sumcheck-based verifiable computation to create privacy-preserving digital identity from existing ECDSA standards.
Zero-Knowledge Proof of Personhood Secures Decentralized Identity and Sybil Resistance
This research introduces Zero-Knowledge Proof of Personhood (ZK-PoP) to cryptographically enforce unique identity without compromising user privacy, solving the Sybil resistance challenge.
Zero-Knowledge Accumulators Achieve Full Privacy for Dynamic Set Operations
A new cryptographic primitive provides succinct set membership and non-membership proofs while guaranteeing that the set's contents and updates remain entirely private.
