Private feasible solution determination
Abstract Applying secure multi‐party computation (SMC) to implement secure linear programming is an important problem of SMC. Private feasible solution determination means that one of the participants has a private value and the other participants have some constraints, and they want to cooperativel...
Saved in:
Main Authors: | Xue Ge, Jiawei Dou, Wenli Wang, Yingnan Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | IET Information Security |
Subjects: | |
Online Access: | https://doi.org/10.1049/ise2.12003 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Extended supersingular isogeny Diffie–Hellman key exchange protocol: Revenge of the SIDH
by: Daniel Cervantes‐Vázquez, et al.
Published: (2021-09-01) -
An efficient lattice‐based threshold signature scheme using multi‐stage secret sharing
by: Hossein Pilaram, et al.
Published: (2021-01-01) -
Revocable identity‐based matchmaking encryption in the standard model
by: Zhe Jiang, et al.
Published: (2023-07-01) -
Lattice‐based unidirectional Proxy Re‐Encryption and Proxy Re‐Encryption+ schemes
by: Kunwar Singh, et al.
Published: (2021-01-01) -
Reconstructing a lightweight security protocol in the radio‐frequency identification systems
by: Alireza Abdellahi Khorasgani, et al.
Published: (2023-07-01)