搜索结果: 1-15 共查到“密码学 ITS”相关记录185条 . 查询时间(0.164 秒)
The Local Forking Lemma and its Application to Deterministic Encryption
Deterministic public-key encryption searchable encryption forking lemma
2019/9/16
We bypass impossibility results for the deterministic encryption of public-key-dependent messages, showing that, in this setting, the classical Encrypt-with-Hash scheme provides message-recovery secur...
At CRYPTO 2017, Rosca et al. introduce a new variant of the Learning With Errors (LWE) problem, called the Middle-Product LWE (MP-LWE). The hardness of this new assumption is based on the hardness of ...
Graph Similarity and Its Applications to Hardware Security
Graph Similarity Hardware Reverse Engineering Hardware Trojan
2019/8/30
Hardware reverse engineering is a powerful and universal tool for both security engineers and adversaries. From a defensive perspective, it allows for detection of intellectual property infringements ...
Structure-Preserving and Re-randomizable RCCA-secure Public Key Encryption and its Applications
public-key cryptography Rand-RCCA PKE
2019/8/22
Re-randomizable RCCA-secure public key encryption (Rand-RCCA PKE) schemes reconcile the property of re-randomizability of the ciphertexts with the need of security against chosen-ciphertexts attacks.
A Practicable Timing Attack Against HQC and its Countermeasure
HQC BCH decoding Timing attack
2019/8/8
In this paper, we present a practicable chosen ciphertext timing attack retrieving the secret key of HQC. The attack exploits a correlation between the weight of the error to be decoded and the runnin...
HoneyBadgerMPC and AsynchroMix: Practical AsynchronousMPC and its Application to Anonymous Communication
multiparty computation robustness
2019/8/2
Multiparty computation as a service (MPSaaS) is a promising approach for building privacy-preserving communication systems.However, in this paper, we argue that existing MPC implementations are inadeq...
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...
Homomorphism learning problems and its applications to public-key cryptography
Learning With Errors isogenies non-commutative cryptography
2019/6/19
We present a framework for the study of a learning problem over abstract groups, and introduce a new technique which allows for public-key encryption using generic groups. We proved, however, that in ...
About Wave Implementation and its Leakage Immunity
preimage sampleable function hash and sign signature provable security
2019/5/23
Wave is a recent digital signature scheme. It is based on a family of trapdoor one-way Preimage Sampleable Functions and is proven EUF-CMA in the random oracle model under two code-based computational...
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...
Improved quantum attack on Type-1 Generalized Feistel Schemes and Its application to CAST-256
Generalized Feistel Scheme Quantum attack Simon's algorithm
2019/4/1
Generalized Feistel Schemes (GFS) are important components of symmetric ciphers, which have been extensively researched in classical setting. However, the security evaluations of GFS in quantum settin...
Related-Tweak Statistical Saturation Cryptanalysis and Its Application on QARMA
Related-Tweak Statistical Saturation KDIB Conditional Equivalence
2019/3/1
Statistical saturation attack takes advantage of a set of plaintext with some bits fixed while the others vary randomly, and then track the evolution of a non-uniform plaintext distribution through th...
A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Application to Identity Management
Group Signatures Anonymity Revocation
2019/1/26
Group signatures are signatures providing signer anonymity where signers can produce signatures on behalf of the group that they belong to. Although such anonymity is quite attractive considering priv...
Multi-Protocol UC and its Use for Building Modular and Efficient Protocols
Building Modular Efficient Protocols
2019/1/26
We want to design and analyze protocols in a modular way by combining idealized components that we realize individually. While this is in principle possible using security frameworks that provide gene...
FE for Inner Products and Its Application to Decentralized ABE
functional encryption ABE LWE DDH
2019/1/18
In this work, we revisit the primitive functional encryption (FE) for inner products and show its application to decentralized attribute- based encryption (ABE). Particularly, we derive an FE for inne...