搜索结果: 1-15 共查到“密码学 Encoding”相关记录33条 . 查询时间(0.066 秒)
A New Variant of the Winternitz One Time Signature Scheme Based on Graded Encoding Schemes
graded encoding schemes multi-linear maps GDL problem
2019/2/28
The Winternitz one-time signature (WOTS) scheme, which can be described using a certain number of so-called ``function chains", plays an important role in the design of both stateless and stateful man...
Fault Resilient Encoding Schemes in Software: How Far Can We Go?
software encoding schemes fault attacks countermeasures
2018/3/5
Cryptographic implementations are often vulnerable against physical attacks, fault injection analysis being among the most popular techniques. On par with development of attacks, the area of counterme...
Graded Encoding Schemes from Obfuscation
Multilinear maps graded encoding schemes indistinguishability obfuscation
2018/1/12
We construct a graded encoding scheme (GES), an approximate form of graded multilinear maps. Our construction relies on indistinguishability obfuscation, and a pairing-friendly group in which (a suita...
On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications
Predicates verifiable random functions predicate encryption schemes
2017/8/29
Predicates are used in cryptography as a fundamental tool to control the disclosure of secrets. However, how to embed a particular predicate into a cryptographic primitive is usually not given much at...
CCA-secure Predicate Encryption from Pair Encoding in Prime Order Groups: Generic and Efficient
Predicate Encryption CCA Security Pair Encoding Scheme
2017/7/6
Attrapadung (Eurocrypt 2014) proposed a generic framework called pair encoding to simplify the design and proof of security of CPA-secure predicate encryption (PE) instantiated in composite order grou...
(Finite) Field Work: Choosing the Best Encoding of Numbers for FHE Computation
Fully Homomorphic Encryption FHE Encoding
2017/6/22
Fully Homomorphic Encryption (FHE) schemes are a powerful tool that allows arbitrary computations on encrypted data. This makes them a promising tool for a variety of use cases that require outsourcin...
In this work, we design a new lattice encoding structure for vectors. Our encoding can be used to achieve a packed FHE scheme that allows some SIMD operations and can be used to improve all the prior ...
Faster Homomorphic Function Evaluation using Non-Integral Base Encoding
public-key cryptography homomorphic function evaluation
2017/4/19
In this paper we present an encoding method for fixed-point numbers tailored for homomorphic function evaluation. The choice of the degree of the polynomial modulus used in all popular somewhat homomo...
We implementated (a simplified version of) the branching-program obfuscator due to Gentry et al.\@ (GGH15), which is itself a variation of the first obfuscation candidate by Garg et al. (GGHRSW13). To...
Feeding Two Cats with One Bowl: On Designing a Fault and Side-Channel Resistant Software Encoding Scheme (Extended Version)
software encoding schemes side-channel attacks fault attacks
2016/12/8
When it comes to side-channel countermeasures, software encoding
schemes are becoming popular and provide a good level of security for generalpurpose
microcontrollers. However, these schemes are not...
Mistakes Are Proof That You Are Trying: On Verifying Software Encoding Schemes' Resistance to Fault Injection Attacks
software encoding schemes formal code analysis fault injection attacks
2016/12/8
Software encoding countermeasures are becoming increasingly popular among researchers proposing code-level prevention against data-dependent leakage allowing an attacker to mount a side-channel attack...
Quantum Key Recycling with eight-state encoding (The Quantum One Time Pad is more interesting than we thought)
quantum cryptography eight-state encoding
2016/12/7
Perfect encryption of quantum states using the Quantum One-Time Pad (QOTP) requires 2 classical key bits per qubit. Almost-perfect encryption, with information-theoretic security, requires only slight...
A Tag Based Encoding: An Efficient Encoding for Predicate Encoding in Prime Order Groups
encodings prime order groups inner product encryption
2016/6/29
We introduce a tag based encoding, a new generic framework for
modular design of Predicate Encryption (PE) schemes in prime order groups. Our
framework is equipped with a compiler which is adaptivel...
FMNV Continuous Non-malleable Encoding Scheme is More Efficient Than Believed
non-malleable continuous non-malleability tamper-resilient cryptography
2016/6/12
Non-malleable codes are kind of encoding schemes which are resilient to tampering attacks. The main idea behind the non-malleable coding is that the adversary can't be able to obtain any valuable info...
Encoding Rational Numbers for FHE-based Applications
Continued fractions Gosper algorithm Rational numbers
2016/4/6
This work addresses a basic problem of security systems that operate on very sensitive
information, such as healthcare data. Specifically, we are interested in the problem of privately
handling medi...