搜索结果: 1-15 共查到“军事学 Reductions”相关记录33条 . 查询时间(0.07 秒)
Security Reductions for White-Box Key-Storage in Mobile Payments
White-box cryptography secure key storage hardware-binding
2019/9/16
The goal of white-box cryptography is to provide security even when the cryptographic implementation is executed in adversarially controlled environments. White-box implementations nowadays appear in ...
On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
non-tightness quantum random oracle model Fujisaki-Okamoto
2019/5/21
Key encapsulation mechanism (KEM) variants of the Fujisaki-Okamoto (FO) transformation (CRYPTO 1999 and Journal of Cryptology 2013) that turn a weakly-secure public-key encryption (PKE) into an IND-CC...
Contingent payments on a public ledger: models and reductions for automated verification
fair exchange security models blockchain
2019/5/9
We study protocols that rely on a public ledger infrastructure, concentrating on protocols for zero-knowledge contingent payment, whose security properties combine diverse notions of fairness and priv...
Fuchsbauer, Kiltz, and Loss~(Crypto'18) gave a simple and clean definition of an ￥emph{algebraic group model~(AGM)} that lies in between the standard model and the generic group model~(GGM). Specifica...
Supersingular isogeny graphs and endomorphism rings: reductions and solutions
post-quantum cryptography isogeny-based cryptography cryptanalysis
2018/4/26
In this paper, we study several related computational problems for supersingular elliptic curves, their isogeny graphs, and their endomorphism rings. We prove reductions between the problem of path fi...
In Crypto 2017, Auerbach et al. initiated the study on memory-tight reductions and proved two negative results on the memory-tightness of restricted black-box reductions from multi-challenge security ...
Bandwidth-Hard Functions: Reductions and Lower Bounds
Cryptanalysis Hash Functions Bandwidth-Hard Functions
2018/3/5
Memory Hard Functions (MHFs) have been proposed as an answer to the growing inequality between the computational speed of general purpose CPUs and Application Specific Integrated Circuits (ASICs). MHF...
On the Tightness of Forward-Secure Signature Reductions
Forward-security signatures lossy identification
2017/8/10
In this paper, we revisit the security of factoring-based signature schemes built via the Fiat-Shamir transform and show that they can admit tighter reductions to certain decisional complexity assumpt...
Efficient reductions in cyclotomic rings - Application to R-LWE based FHE schemes
Polynomial Reduction Number Theoretic Transform Residue Number Systems
2017/8/9
With Fully Homomorphic Encryption (FHE), it is possible to process encrypted data without having an access to the private-key. This has a wide range of applications, most notably the offloading of sen...
Cryptographic reductions typically aim to be tight by transforming an adversary A into an algorithm that uses essentially the same resources as A. In this work we initiate the study of memory efficien...
Multi-Key Authenticated Encryption with Corruptions: Reductions are Lossy
authenticated encryption black-box reductions multi-key security
2017/6/2
We study the security of symmetric encryption schemes in settings with multiple users and realistic adversaries who can adaptively corrupt encryption keys. To avoid confinement to any particular defin...
Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with A Counterexample
Unique Signatures Tight Reduction Impossibility
2017/6/2
Optimal security reductions for unique signatures (Coron, Eurocrypt 2002) and their generalization, i.e., efficiently re-randomizable signatures (Hofheinz et al., PKC 2012 and Baderet al., Eurocrypt 2...
Deja Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
assumptions reductions
2016/12/10
In this paper, we demonstrate that various cryptographic constructions--including ones for broadcast, attribute-based, and hierarchical identity-based encryption--can rely for security on only the sta...
Collusion Resistant Broadcast Encryption with Tight Reductions and Beyond
Broadcast Encryption Tight Reduction
2016/12/8
The issue of tight security in identity-based encryption scheme (IBE) has been widely investigated.
Recently, a tightly secure IBE scheme of bilinear groups in the weak multi-challenge setting has be...
Correlated Extra-Reductions Defeat Blinded Regular Exponentiation
side-channel analysis Montgomery modular multiplication extra-reduction leakage
2016/6/8
Walter & Thomson (CT-RSA '01) and Schindler (PKC '02) have shown that extra-reductions allow to break RSA-CRT even with message blinding. Indeed, the extra-reduction probability depends on the type of...