搜索结果: 1-15 共查到“extension”相关记录344条 . 查询时间(0.093 秒)
Armenia and Russia discuss Armenian 2 operating extension, and new nuclear（图）
亚美尼亚 俄罗斯 亚美尼亚2号核电站
2023/5/9
Further extending the operating life of the Armenian Nuclear Power Plant's second unit was identified as a priority during a meeting between Rosatom Director General Alexei Likhachev and Armenia's Pri...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Extension of Kahler currents
Kahler-currents 扩展 解析奇点
2023/4/14
In this lecture I will talk about Collins-Tosatti's proof on the extension of Kahler currents with analytic singularities.
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Richberg's extension theory
里奇伯格 扩展理论 多次调和函数扩展 卡勒几何
2023/4/18
In this talk I will recall Richberg's extension theorem of plurisubharmonic functions and discuss its application in Kahler geometry.
Black-Box Language Extension of Non-Interactive Zero-Knowledge Arguments
NIZK USS-NIZK black-box construction
2019/6/13
Highly efficient non-interactive zero-knowledge arguments (NIZK) are often constructed for limited languages and it is not known how to extend them to cover wider classes of languages in general. In t...
SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension
private set intersection OT extension
2019/6/4
We describe a novel approach for two-party private set intersection (PSI) with semi-honest security. Compared to existing PSI protocols, ours has a more favorable balance between communication and com...
Protecting ECC Against Fault Attacks: The Ring Extension Method Revisited
Elliptic curves formal groups degenerate curves
2019/5/21
Due to its shorter key size, elliptic curve cryptography (ECC) is gaining more and more popularity. However, if not properly implemented, the resulting cryptosystems may be susceptible to fault attack...
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More
Secure computation correlated randomness pseudorandom correlation generator
2019/5/9
Secure multiparty computation (MPC) often relies on sources of correlated randomness for better efficiency and simplicity. This is particularly useful for MPC with no honest majority, where input-inde...
安徽三联学院外语学院外贸函电课件Unit 6 Amendament and Extension of LC
安徽三联学院外语学院 外贸函电 课件 Unit 6 Amendament and Extension of LC
2019/4/28
安徽三联学院外语学院外贸函电课件Unit 6 Amendament and Extension of LC。
Field Extension in Secret-Shared Form and Its Applications to Efficient Secure Computation
secure computation secret sharing, active security
2019/4/16
Secure computation enables participating parties to jointly compute a function over their inputs while keeping them private. Secret sharing plays an important role for maintaining privacy during the c...
Faster Initial Splitting for Small Characteristic Composite Extension Degree Fields
Discrete Log Finite fields Function Field Sieve Cryptography
2019/3/21
Let pp be a small prime and n=n1n2>1n=n1n2>1 be a composite integer. For the function field sieve algorithm applied to FpnFpn, Guillevic (2019) had proposed an algorithm for initial splitting of the t...
Security Evaluation for Snow 2.0-like Stream Ciphers Against Correlation Attacks over Extension Fields
symmetric cryptography stream cipher correlation attack
2019/3/20
We propose a general method for security evaluation of SNOW 2.0-like ciphers against correlation attacks that are built similarly to known attacks on SNOW 2.0. Unlike previously known methods, the met...
Efficient UC Commitment Extension with Homomorphism for Free (and Applications)
cryptographic protocols UC
2018/11/5
Homomorphic universally composable (UC) commitments allow for the sender to reveal the result of additions and multiplications of values contained in commitments without revealing the values themselve...
Actively Secure OT-Extension from q-ary Linear Codes
cryptographic protocols oblivious transfer
2018/6/19
We consider recent constructions of 11-out-of-NN OT-extension from Kolesnikov and Kumaresan (CRYPTO 2013) and from Orrú et al. (CT-RSA 2017), based on binary error-correcting codes. We generalize thei...
On the Round Complexity of OT Extension
Oblivious Transfer Extension Symmetric Key Primitives Random Oracle Model
2017/12/13
We show that any OT extension protocol based on one-way functions (or more generally any symmetric-key primitive) either requires an additional round compared to the base OTs or must make a non-black-...
SWiM: Secure Wildcard Pattern Matching From OT Extension
Pattern Matching Oblivious Transfer PRF
2017/11/28
Suppose a server holds a long text string and a receiver holds a short pattern string. Secure pattern matching allows the receiver to learn the locations in the long text where the pattern appears, wh...