Verification protocol for stable matching from conditional disclosure of secrets
From MaRDI portal
Publication:6547974
DOI10.1007/978-3-031-54770-6_5MaRDI QIDQ6547974
Toru Nakamura, Kittiphop Phalakarn
Publication date: 31 May 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Matching models (91B68)
Cites Work
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Some remarks on the stable matching problem
- Towards breaking the exponential barrier for general secret sharing
- Conditional disclosure of secrets via non-linear reconstruction
- Optimal linear multiparty conditional disclosure of secrets protocols
- Theory of cryptography. 10th theory of cryptography conference, TCC 2013, Tokyo, Japan, March 3--6, 2013. Proceedings
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Multi-clients verifiable computation via conditional disclosure of secrets
- Secret-sharing schemes for general and uniform access structures
- How to share a secret
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- A Private Stable Matching Algorithm
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Machiavelli and the Gale-Shapley Algorithm
- Better secret sharing via robust conditional disclosure of secrets
- Breaking the circuit-size barrier in secret sharing
- Multi-Client Verifiable Computation with Stronger Security Guarantees
- Improved Efficiency for Private Stable Matching
- College Admissions and the Stability of Marriage
This page was built for publication: Verification protocol for stable matching from conditional disclosure of secrets
