搜索结果: 1-15 共查到“MPC”相关记录94条 . 查询时间(0.117 秒)
电动汽车用V2G并网逆变器改进型MPC算法研究
模型预测控制 拉格朗日乘数法 电动汽车 V2G
2024/3/15
针对传统模型预测控制MPC(model predictive control)算法开关频率不固定、稳态性能差等问题,提出了一种基于拉格朗日乘数法的模型预测电流控制LM-MPCC(model predictive current control based on Lagrange multiplier)算法,并应用于电动汽车用两电平V2G(vehicle-to-grid)并网逆变器。比起传统MPC算...
针对传统配电网采用闭环设计、开环工作导致存在配电网中馈线功率失调等问题,提出基于FCS-MPC的柔性多状态电源开关高比例输配电模型。基于FCS-MPC的控制策略,分析柔性多状态电源开关的工作原理,构建柔性多状态电源开关模型;通过建立离散数学模型,调节PI双闭环控制方法的参数,采用二阶拉格朗日外推法运算配电网侧电压的参考预测值,实现柔性多状态电源开关高比例输配电的正常运行。
医用钛板表面涂层2-MPC对细菌生物膜形成的影响
钛板 金黄色葡萄球菌 生物膜 感染 2-甲基苯基苄基氧基苯基磷酰胆碱
2021/3/5
探讨医用钛板表面涂层2-甲基丁二酰甲苯和苯基磷胆碱（2-甲基丙烯酰氧基乙基磷酸胆碱，2-MPC）对金黄色葡萄球菌生物膜形成的影响。方法 利用化学接枝法制备钛板表面2-MPC涂层并用扫描电镜观察其表面形貌，以金黄色葡萄球菌（ATCC25923）标准作为实验用菌，将已消毒的2-MPC涂层钛板（实验组）及普通钛板（对照组）置入5mL的细菌浓度为1.5×10 6 CFU /毫升的菌液中共同培养。
On Fully Secure MPC with Solitary Output
Multi-Party Computation Full Security Dishonest Majority Malicious Adversaries
2019/9/17
We study the possibility of achieving full security, with guaranteed output delivery, for secure multiparty computation of functionalities where only one party receives output, to which we refer as so...
Optimal-Round Preprocessing-MPC via Polynomial Representation and Distributed Random Matrix (extended abstract)
MPC with preprocessing correlated randomness optimal round complexity
2019/9/16
We present preprocessing-MPC schemes of arithmetic functions with optimal round complexity, function-independent correlated randomness, and communication and space complexities that grow linearly with...
We propose a mechanism for an m-party dishonest majority Multi-Party Computation (MPC) protocol to obtain the required pre-processing data (called Beaver Triples), from a subset of a set of cloud serv...
Securing DNSSEC Keys via Threshold ECDSA From Generic MPC
Multiparty computation Threshold ECDSA Honest majority
2019/8/6
A surge in DNS cache poisoning attacks in the recent years generated an incentive to push the deployment of DNSSEC forward. ICANN accredited registrars are required to support DNSSEC signing for their...
Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC
multiparty computation amortization information-theoretical security
2019/7/18
This paper deals with (1) asymptotics of ``strongly-multiplicative'' arithmetic secret sharing over an arbitrary fixed ring Rℓ:=Z/pℓZ (p>0 prime, ℓ>0 an integer) and supporting an un...
Communication-Efficient Unconditional MPC with Guaranteed Output Delivery
Multiparty Computation Information-theoretic Cryptography Communication Complexity
2019/6/5
We study the communication complexity of unconditionally secure MPC with guaranteed output delivery over point-to-point channels for corruption threshold t
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest
secure multiparty computation honest majority concrete efficiency
2019/6/5
Secure multiparty computation (MPC) enables a set of parties to securely carry out a joint computation of their private inputs without revealing anything but the output. Protocols for semi-honest adve...
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning
MPC Decision Trees SVM
2019/6/3
At CRYPTO 2018 Cramer et al. presented SPDZ2k, a new secret-sharing based protocol for actively secure multi-party computation against a dishonest majority, that works over rings instead of fields. Th...
Non-Interactive MPC with Trusted Hardware Secure Against Residual Function Attacks
Non-Interactive MPC Communication round complexity Trusted hardware
2019/5/9
Secure multiparty computation (MPC) has been repeatedly optimized, and protocols with two communication rounds and strong security guarantees have been achieved. While progress has been made construct...
We study approaches to generalized Feistel constructions with low-degree round functions with a focus on x → x^3. Besides known constructions, we also provide a new balanced Feistel construction...
Uncovering Algebraic Structures in the MPC Landscape
MPC Landscape Commuting Permutations Systems
2019/3/13
A fundamental problem in the theory of secure multi-party computation (MPC) is to characterize functions with more than 2 parties which admit MPC protocols with information-theoretic security against ...
Degree 2 is Complete for the Round-Complexity of Malicious MPC
foundations Multi-Party Computation
2019/3/1
We show, via a non-interactive reduction, that the existence of a secure multi-party computation (MPC) protocol for degree-22 functions implies the existence of a protocol with the same round complexi...