搜索结果: 1-15 共查到“密码学 Free”相关记录86条 . 查询时间(0.171 秒)
A Coin-Free Oracle-Based Augmented Black Box Framework
Black Box Construction Zero-Knowledge Proof NIZK
2019/7/25
After the work of Impagliazzo and Rudich (STOC, 1989), the black box framework has become one of the main research domain of cryptography. However black box techniques say nothing about non-black box ...
New Semi-Free-Start Collision Attack Framework for Reduced RIPEMD-160
hash function RIPEMD-160 freedom degree utilization
2019/6/10
RIPEMD-160 is a hash function published in 1996, which shares similarities with other hash functions designed in this time-period like MD4, MD5 and SHA-1. However, for RIPEMD-160, no (semi-free-start)...
Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free
Secure search Fully homomorphic encryption Randomized algorithms
2019/1/2
We present a novel secure searchsecure search protocol on data and queries encrypted with Fully Homomorphic Encryption (FHE). Our protocol enables organizations (client) to (1) securely upload an unso...
Pseudo-Free Families of Computational Universal Algebras
universal algebras families of computational universal algebras pseudo-freeness
2018/12/3
Let ΩΩ be a finite set of operation symbols. We initiate the study of (weakly) pseudo-free families of computational ΩΩ-algebras in arbitrary varieties of ΩΩ-algebras. Most of our results concern (wea...
Efficient UC Commitment Extension with Homomorphism for Free (and Applications)
cryptographic protocols UC
2018/11/5
Homomorphic universally composable (UC) commitments allow for the sender to reveal the result of additions and multiplications of values contained in commitments without revealing the values themselve...
The necessary conditions for SETUP implementation are building in entropy source (otherwise generated secret will be predictable). In this article, it's considered subscriber whose protocol implementa...
Free IF: How to Omit Inactive Branches and Implement S-Universal Garbled Circuit (Almost) for Free
Garbled Circuit Universal Circuit GC framework
2018/9/6
Two-party Secure Function Evaluation (SFE) allows two parties to evaluate a function known to both parties on their private inputs. In some settings, the input of one of the parties is the de finition...
New Protocols for Secure Linear Algebra: Pivoting-Free Elimination and Fast Block-Recursive Matrix Decomposition
secure linear algebra multiparty computation
2018/8/2
Cramer and Damgård were the first to propose a constant-rounds protocol for securely solving a linear system of unknown rank over a finite field in multiparty computation (MPC). For mm linear equ...
On the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomials
sum-free sets Dickson polynomials
2017/12/11
On the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomials.
A Certain Family of Subgroups of Zn⋆ Is Weakly Pseudo-Free under the General Integer Factoring Intractability Assumption
families of computational groups weak pseudo-freeness abelian groups
2017/11/28
A Certain Family of Subgroups of Zn⋆ Is Weakly Pseudo-Free under the General Integer Factoring Intractability Assumption.
Formal Analysis of a TTP-Free Blacklistable Anonymous Credentials System (Full Version)
Formal analysis Anonymous Credential ProVerif
2017/11/21
This paper firstly introduces a novel security definition for BLAC-like schemes (BLAC represents TTP-free BLacklist-able Anonymous Credentials) in the symbolic model using applied pi calculus, which i...
Shortest Vector from Lattice Sieving: a Few Dimensions for Free
Cryptanalysis Lattice Sieving
2017/10/12
Asymptotically, the best known algorithms for solving the Shortest Vector Problem (SVP) in a lattice of dimension nn are sieve algorithms, which have heuristic complexity estimates ranging from (4/3)n...
It is tempting to think that if we encrypt a sequence of messages {xi} using a semantically secure encryption scheme, such that each xi is encrypted with its own independently generated public key pki...
Collisions and Semi-Free-Start Collisions for Round-Reduced RIPEMD-160
RIPEMD-160 semi-free-start collision collision
2017/8/29
In this paper, we propose an improved cryptanalysis of the double-branch hash function RIPEMD-160 standardized by ISO/IEC. Firstly, we show how to theoretically calculate the step differential probabi...
Write-Only Oblivious RAM (WoORAM) protocols provide privacy by encrypting the contents of data and also hiding the pattern of write operations over that data. WoORAMs provide better privacy than plain...