搜索结果: 1-15 共查到“密码学 both schemes”相关记录402条 . 查询时间(0.156 秒)
Subversion-Resistant Commitment Schemes: Definitions and Constructions
Commitment schemes subversion security common reference string model
font style='font-size:12px;'>
2019/9/23
A commitment scheme allows a committer to create a commitment to a secret value, and later may open and reveal the secret value in a verifiable manner. In the common reference string model, commitment...
Modeling Memory Faults in Signature and Encryption Schemes
fault attacks security model fault resilience deterministic signatures
font style='font-size:12px;'>
2019/9/19
Memory fault attacks, inducing errors in computations, have been an ever-evolving threat to cryptographic schemes since their discovery for cryptography by Boneh et al. (Eurocrypt 1997). Initially req...
Generic Side-channel attacks on CCA-secure lattice-based PKE and KEM schemes
Lattice based cryptography side-channel attacks CCA transformation
font style='font-size:12px;'>
2019/8/21
In this article, we demonstrate practical side-channel assisted chosen-ciphertext attacks (CCA) over multiple CCA-secure lattice-based public-key encryption schemes (PKE) and key-encapsulation mechani...
Security analysis of two lightweight certi ficateless signature schemes
Certificateless cryptography Cryptanalysis Signature
font style='font-size:12px;'>
2019/8/19
Certificateless cryptography can be considered as an intermediate solution to overcome the issues in traditional public key infrastructure (PKI) and identity-based public key cryptography (ID-PKC). Th...
Provable Security for PKI Schemes
public-key infrastrcture certificates
font style='font-size:12px;'>
2019/7/15
In this work we apply the systematic approach of game-based security specifications and proofs by reductions, to the design and evaluation of public key infrastructure (PKI) schemes. The importance of...
The Key is Left under the Mat: On the Inappropriate Security Assumption of Logic Locking Schemes
Logic Locking Optical Contactless Probing Tamper-proof Memory
font style='font-size:12px;'>
2019/6/19
Logic locking has been proposed as an obfuscation technique to protect outsourced IC designs from Intellectual Property (IP) piracy by untrusted entities in the design and fabrication process. It obfu...
Breaking Tweakable Enciphering Schemes using Simon's Algorithm
TES Simon's algorithm Quantum period finding algorithm
font style='font-size:12px;'>
2019/6/19
The threat of the possible advent of quantum computers has motivated the cryptographic community to search for quantum safe solutions. There have been some works in past few years showing the vulnerab...
A New Approach to Constructing Digital Signature Schemes (Extended Paper)
digital signatures hash functions public-key cryptography
font style='font-size:12px;'>
2019/6/10
A new hash-based, server-supported digital signature scheme was proposed recently. We decompose the concept into forward-resistant tags and a generic cryptographic time-stamping service. Based on the ...
On the Local Leakage Resilience of Linear Secret Sharing Schemes
Secret Sharing leakage resilience information theory
font style='font-size:12px;'>
2019/6/5
We consider the following basic question: to what extent are standard secret sharing schemes and protocols for secure multiparty computation that build on them resilient to leakage? We focus on a simp...
Cryptanalysis of Ring Homomorphic Encryption Schemes
homomorphic encryption schemes quantum computing key-recovery attack
font style='font-size:12px;'>
2019/6/3
We analyze the structure of finite commutative rings with respect to its idempotent and nilpotent elements. Based on this analysis we provide a quantum-classical IND-CCA^1 attack for ring homomorphic ...
2-threshold Ideal Secret Sharing Schemes Can Be Uniquely Modeled by Latin Squares
secret sharing ideal secret sharing 2-threshold secret sharing
font style='font-size:12px;'>
2019/5/31
In a secret sharing scheme, a secret value is encrypted into several shares, which are distributed among corresponding participants. It requires that only predefined subsets of participants can recons...
Subliminal channels in post-quantum digital signature schemes
Subliminal channels post-quantum digital signatures
font style='font-size:12px;'>
2019/5/29
We analyze the digital signatures schemes submitted to NIST's Post-Quantum Cryptography Standardization Project in search for subliminal channels.
Group-homomorphic Secret Sharing Schemes Are Group-characterizable with Normal Subgroups
homomorphic secret sharing schemes group-characterizable distribution quasi-uniform distribution
font style='font-size:12px;'>
2019/5/29
A group-characterizable random variable [Chan and Yeung 2002] is induced by a joint distribution on the (left) cosets of some subgroups of a main group. A homomorphic secret sharing scheme [Benaloh 19...
Evaluation of Code-based Signature Schemes
post-quantum cryptography code-based cryptography signature scheme
font style='font-size:12px;'>
2019/5/23
Code-based cryptographic schemes recently raised to prominence as quantum-safe alternatives to the currently employed number-theoretic constructions, which do not resist quantum attacks. In this artic...
On sigma protocols with helper for MQ and PKP, fishy signature schemes and more
zero knowledge Post-Quantum digital signatures Multivariate cryptography
font style='font-size:12px;'>
2019/5/21
We then remove the helper from the protocol with a "cut-and-choose" protocol and we apply the Fiat-Shamir transform to obtain signature schemes with security proof in the QROM. We show that the result...