搜索结果: 1-15 共查到“密码学 Weak”相关记录73条 . 查询时间(0.152 秒)
Weak Keys in the Rekeying Paradigm: Attacks on COMET-128 and mixFeed
weak keys authenticated encryption comet
2019/8/6
In this article, we analyze two of the NIST Round 1 Candidates for the Lightweight Cryptography Standardization Process: COMET and mixFeed. We show how AEAD modes that are based on rekeying can be mod...
Invariant subspaces (Crypto'11) and subspace trails (FSE'17) are two related recent cryptanalytic approaches that led to new results on, e. g. PRINTCipher and AES. We extend the invariant subspace app...
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification
PFG iO
2019/6/4
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...
Biased Nonce Sense: Lattice Attacks against Weak ECDSA Signatures in Cryptocurrencies
Hidden number problem ECDSA Lattices
2019/1/10
In this paper, we compute hundreds of Bitcoin private keys and dozens of Ethereum, Ripple, SSH, and HTTPS private keys by carrying out cryptanalytic attacks against digital signatures contained in pub...
Weak Zero-Knowledge Beyond the Black-Box Barrier
zero knowledge non-black-box techniques fully-homomorphic encryption
2018/11/9
The round complexity of zero-knowledge protocols is a long-standing open question, yet to be settled under standard assumptions. So far, the question has appeared equally challenging for relaxations s...
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants
cryptographic protocols secure multiparty computation
2018/8/21
Protocols for secure multiparty computation enable a set of parties to compute a joint function of their inputs, while preserving \emph{privacy}, \emph{correctness} and more. In theory, secure computa...
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness
Indistinguishability Obfuscation Functional Encryption
2018/6/25
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...
Quantum Attacks against Indistinguishablility Obfuscators Proved Secure in the Weak Multilinear Map Model
Cryptanalysis Obfuscation
2018/6/5
We present a quantum polynomial time attack against the GMMSSZ branching program obfuscator of Garg et al. (TCC'16), when instantiated with the GGH13 multilinear map of Garg et al. (EUROCRYPT'13). Thi...
Weak Compression and (In)security of Rational Proofs of Storage
information theory proofs of storage rational security
2018/5/28
We point out an implicit unproven assumption underlying the security of rational proofs of storage that is related to a concept we call weak randomized compression.
Correlation Cube Attacks: From Weak-Key Distinguisher to Key Recovery
cryptanalysis cube attack stream cipher
2018/3/7
In this paper, we describe a new variant of cube attacks called correlation cube attack. The new attack recovers the secret key of a cryptosystem by exploiting conditional correlation properties betwe...
Ubiquitous Weak-key Classes of BRW-polynomial Function
weak key polynomial evaluation hash BRW-polynomial
2018/1/12
BRW-polynomial function is suggested as a preferred alternative of polynomial function, owing to its high efficiency and seemingly non-existent weak keys. In this paper we investigate the weak-key iss...
Weak-Unforgeable Tags for Secure Supply Chain Management
light-weight cryptography unforgeability One-time Hash function
2017/12/25
Given the value of imported counterfeit and pirated goods, the need for secure supply chain management is pertinent. Maleki et al. (HOST 2017) propose a new management scheme based on RFID tags (with ...
The Strength of Weak Randomization: Efficiently Searchable Encryption with Minimal Leakage
efficiently searchable encryption encrypted databases
2017/11/13
Efficiently searchable and easily deployable encryption schemes enable an untrusted, legacy service such as a relational database engine to perform searches over encrypted data. The ease with which su...
Authentication from Weak PRFs with Hidden Auxiliary Input
3 round authentication protocol weak PRF
2017/9/1
In this work, we study a class of randomized weak pseudorandom functions, which we call weak PRFs with hidden auxiliary input (HIwPRF). Compared to Learning Parity with Noise (LPN) or Learning with Er...
Lattice-Based Techniques for Accountable Anonymity: Composition of Abstract Stern’s Protocols and Weak PRF with Efficient Protocols from LWR
Lattice-Based Cryptography Zero-Knowledge Arguments of Knowledge Privacy-Preserving Protocol
2017/8/17
In an accountable anonymous system, a user is guaranteed anonymity and unlinkability unless some well-defined condition is met. A line of research focus on schemes that do not rely on any trusted thir...