搜索结果: 1-15 共查到“军事学 Making”相关记录21条 . 查询时间(0.071 秒)
Making AES great again: the forthcoming vectorized AES instruction
AES-NI SIMD cryptographic implementation
2018/5/2
The introduction of the processor instructions AES-NI and VPCLMULQDQ, that are designed for speeding up encryption, and their continual performance improvements through processor generations, has sign...
Flexible Signatures: Towards Making Authentication Suitable for Real-Time Environments
Partial Verification Unpredictable Resource constraints Trade-off
2018/4/17
This work introduces the concept of flexible signatures. In a flexible signature scheme, the verification algorithm quantifies the validity of a signature based on the number of computations performed...
Making Public Key Functional Encryption Function Private, Distributively
public-key cryptography functional encryption
2018/3/8
We then consider the problem of hosting services in the untrusted cloud. Boneh, Gupta, Mironov, and Sahai (Eurocrypt 2014) first studied such application and gave a construction based on indistinguish...
Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model
zk-snarks generic group model non-malleability
2018/3/6
We describe a variant of Groth's zk-SNARK [Groth, Eurocrypt 2016] that satisfies simulation extractability, which is a strong form of adaptive non-malleability. The proving time is almost identical to...
Overdrive: Making SPDZ Great Again
Multiparty computation somewhat homomorphic encryption BGV
2017/12/25
SPDZ denotes a multiparty computation scheme in the preprocessing model based on somewhat homomorphic encryption (SHE) in the form of BGV. At CCS '16, Keller et al. presented MASCOT, a replacement of ...
The Universal 2nd Factor (U2F) protocol is an open authentication standard to strengthen the two-factor authentication which is required to protect our authentication details online. It augments the e...
Cryptocurrencies record transactions in a decentralized data structure called a blockchain. Two of the most popular cryptocurrencies, Bitcoin and Ethereum, support the feature to encode rules or scrip...
RSA朇RT is the most widely used implementation for RSA signatures. However, deterministic and many probabilistic RSA signatures based on CRT are vulnerable to fault attacks. Nevertheless, Coron and M...
Efficiently Making Secure Two-Party Computation Fair
two party computation garbled circuit Yao抯 protocol
2016/1/6
Secure two-party computation cannot be fair in general against malicious
adversaries, unless a trusted third party (TTP) or a gradual-release type super-constant
round protocol is employed. Existing...
Making Masking Security Proofs Concrete Or How to Evaluate the Security of any Leaking Device
side-channel analysis masking security proofs
2016/1/4
We investigate the relationships between theoretical studies
of leaking cryptographic devices and concrete security evaluations
with standard side-channel attacks. Our contributions are in four part...
Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model
digital signatures strongly unforgeable quantum random-oracle
2015/12/23
Strongly unforgeable signature schemes provide a more stringent security guarantee than the
standard existential unforgeability. It requires that not only forging a signature on a new message
is har...
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits
Zero-Knowledge Probabilisticaly Checkable Proofs Leakage-Resilience
2015/12/21
A Probabilistically Checkable Proof (PCP) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form ``$x\in L$'' by querying onl...
Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices
public-key cryptography Lattice based cryptography
2013/2/21
NTRUEncrypt, proposed in 1996 by Hoffstein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic performance and conjectured resista...
Computer-Aided Decision-Making with Trust Relations and Trust Domains (Cryptographic Applications)
foundations / cryptographic-key management TTP Web of Trust PKI
2012/3/28
We propose generic declarative definitions of individual and collective trust relations between interacting agents and agent collections, and trust domains of trust-related agents in distributed syste...
Computer-Aided Decision-Making for Formal Relations and Domains of Trust, Distrust, and Mistrust with Cryptographic Applications
foundations / cryptographic-key management TTP Web of Trust PKI
2011/6/8
We propose generic declarative definitions of the concepts of weak and strong trust relations between interacting agents, and trust domains of trust-related agents in distributed or multi-agent system...