Improved signature schemes for secure multi-party computation with certified inputs
From MaRDI portal
Publication:2167761
DOI10.1007/978-3-319-98989-1_22zbMath1496.68148OpenAlexW2885754034MaRDI QIDQ2167761
Myoungin Jeong, Marina Blanton
Publication date: 25 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-319-98989-1_22
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security arguments for digital signatures and blind signatures
- Enforcing input correctness via certification in garbled circuit evaluation
- Privacy-preserving and efficient attributes proof based on selective aggregate CL-signature scheme
- Security Proofs for Signature Schemes
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Equilibrium Concepts for Rational Multiparty Computation
- Confidential Signatures and Deterministic Signcryption
- Rational secret sharing and multiparty computation
- Scalable and Unconditionally Secure Multiparty Computation
- Practical Short Signature Batch Verification
- Private Intersection of Certified Sets
- Secure Multiparty Computation Goes Live
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Foundations of Cryptography
- Advances in Cryptology – CRYPTO 2004
- Batch Verification of Short Signatures
- Public Key Cryptography - PKC 2006
This page was built for publication: Improved signature schemes for secure multi-party computation with certified inputs
