连系
发表于 2025-3-23 09:57:18
http://reply.papertrans.cn/87/8642/864140/864140_11.png
Asymptomatic
发表于 2025-3-23 15:32:19
http://reply.papertrans.cn/87/8642/864140/864140_12.png
鸣叫
发表于 2025-3-23 18:06:53
0302-9743 ions, MAC algorithms, and authenticated encryption schemes, efficient implementations of symmetric and public key algorithms, mathematical and algorithmic aspects of applied cryptology, and secure elections and related cryptographic constructions.978-3-030-81651-3978-3-030-81652-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
monochromatic
发表于 2025-3-24 01:45:08
http://reply.papertrans.cn/87/8642/864140/864140_14.png
jettison
发表于 2025-3-24 03:16:34
http://reply.papertrans.cn/87/8642/864140/864140_15.png
Exhilarate
发表于 2025-3-24 10:10:36
Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems overand 2 s respectively on an Intel i5-8400H CPU. Since the field size for LESS-II is relatively small . our algorithm does not improve on existing methods. Nonetheless, we estimate that LESS-II can be broken with approximately . row operations.
行乞
发表于 2025-3-24 12:01:49
Efficient Lattice-Based Polynomial Evaluation and Batch ZK Argumentshe polynomial argument as a building block. Our contribution is motivated by the discrete log based construction (EUROCRYPT’16), where in our case we employ different techniques to obtain a communication efficient lattice-based scheme. In the zero-knowledge polynomial batch-protocol, we prove the kn
allergen
发表于 2025-3-24 16:07:13
FROST: Flexible Round-Optimized Schnorr Threshold Signaturesmmon private key. Consequently, generating signatures in a threshold setting imposes overhead due to network rounds among signers, proving costly when secret shares are stored on network-limited devices or when coordination occurs over unreliable networks. In this work, we present FROST, a Flexible
不能根除
发表于 2025-3-24 19:24:21
http://reply.papertrans.cn/87/8642/864140/864140_19.png
宽敞
发表于 2025-3-25 01:19:29
Obfuscating Finite Automataby extending an existing matrix fully homomorphic encryption scheme. Using obfuscated deterministic finite automata we can for example evaluate secret . or disjunctive normal forms on public inputs. In particular, the possibility of evaluating regular expressions solves the open problem of ..