Titlebook: Applied Cryptography and Network Security; 18th International C Mauro Conti,Jianying Zhou,Angelo Spognardi Conference proceedings 2020 Spri

尊重

employor

incisive

Lesamnta-LW Revisited: Improved Security Analysis of Primitive and New PRF Mode we propose a new mode for building a pseudo-random function (PRF) based on Lesamnta-LW. The previous PRF modes can only process 128 bits per block-cipher call, while the new mode can process 256 bits to achieve the double throughput. We prove its security both in the standard model and the ideal cipher model.

意外

Trapdoor Delegation and HIBE from Middle-Product LWE in Standard Modeler by proposing a novel trapdoor delegation mechanism for an extended family of polynomials from which we construct, for the first time, a Hierachical IBE scheme from MPLWE. Our Hierarchy IBE scheme is provably secure in the standard model.

FUSC

后天習(xí)得

Efficient AGCD-Based Homomorphic Encryption for Matrix and Vector Arithmetichomomorphic products between 128-dimensional vectors and . matrices in less than one second. We show how to use our scheme to homomorphically evaluate nondeterministic finite automata and also a Na?ve Bayes Classifier.

保留

Improving the Efficiency of Re-randomizable and Replayable CCA Secure Public Key Encryption scheme is more efficient than the state-of-art Rand-RCCA PKE scheme of Faonio et al.?(ASIACRYPT’19) but it achieves a weaker re-randomization property. On the other hand, our scheme achieves a strictly stronger re-randomization property than the PKE scheme of Phan and Pointcheval (ASIACRYPT’04).

collagenase

0302-9743 c protocols cryptographic primitives, attacks on cryptographic primitives, encryption and signature, blockchain and cryptocurrency, secure multi-party computation, post-quantum cryptography..978-3-030-57807-7978-3-030-57808-4Series ISSN 0302-9743 Series E-ISSN 1611-3349

合乎習(xí)俗

https://doi.org/10.1007/978-3-319-48138-8 and in other previous work, handling them simultaneously (and efficiently) in a single scheme faces non-trivial challenges. SomePSS protocols can handle batching of . secrets, but all of them are for the honest majority setting. The techniques typically used to accomplish such batching decrease the

subacute

https://doi.org/10.1007/978-3-031-05010-7ork models the network as a stochastic process where a new session is opened with probability . or an existing session receives the next message with probability .; the existing session can be chosen either in a first-in-first-out (.) or last-in-first-out (.) order. These two orders are fundamental