scientific article; zbMATH DE number 1689600

MaRDI QIDQ2762895zbMATH OpenFDO

Authors Byoungcheon Lee, Kwangjo Kim

Publication date 13 January 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2015/20150123

zbMATH Keywords

finding collisions without decryptionmatchmakingproof of knowledgeproving the equality or inequality of two discrete logarithmspublic commitmentsecure multiparty computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A Private Stable Matching Algorithm
• Improved Efficiency for Private Stable Matching
• Match me if you can: matchmaking encryption and its applications
• Match me if you can: matchmaking encryption and its applications
• Distributed Stable Matching Problems

Cited in

(5)

• A Private Stable Matching Algorithm
• Improved Efficiency for Private Stable Matching
• Match me if you can: matchmaking encryption and its applications
• Match me if you can: matchmaking encryption and its applications
• Verification protocol for stable matching from conditional disclosure of secrets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762895)