搜索结果: 1-15 共查到“军事学 B-smooth”相关记录15条 . 查询时间(0.069 秒)
A Framework for UC-Secure Commitments from Publicly Computable Smooth Projective Hashing
UC commitment smooth projective hash function SPHF
2019/9/23
Hash proof systems or smooth projective hash functions (SPHFs) have been proposed by Cramer and Shoup (Eurocrypt'02) and can be seen as special type of zero-knowledge proof system for a language. Whil...
Oblivious transfer is an important tool against malicious cloud server providers. Halevi-Kalai OT, which is based on smooth projective hash(SPH), is a famous and the most efficient framework for 11-ou...
Founding Cryptography on Smooth Projective Hashing
oblivious transfer secure multiparty computation malicious adversaries
2018/5/16
Oblivious transfer (OT) is a fundamental primitive in cryptography. Halevi-Kalai OT (Halevi, S. and Y. Kalai (2012), Journal of Cryptology 25(1)), which is based on smooth projective hash(SPH), is a f...
Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions
Cryptographic reverse firewall malleable smooth projective hash function oblivious signature-based envelope
2016/12/9
Motivated by the revelations of Edward Snowden, post-Snowden cryptography has become a prominent research direction in recent years. In Eurocrypt 2015, Mironov and Stephens-Davidowitz proposed a novel...
Adversary-dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli
factoring assumption semi-smooth RSA subgroup modulus lossy trapdoor function
2016/6/6
Lossy trapdoor functions (LTDFs), proposed by Peikert and Waters (STOC'08), are known to have a number of applications in cryptography. They have been constructed based on various assumptions, which i...
Probability that the k-gcd of products of positive integers is B-smooth
gcd of products of positive integers B-smooth k-gcd
2016/4/7
In 1849, Dirichlet[5] proved that the probability that two positive integers are relatively prime is 1/zeta(2). Later, it was generalized into the case that positive integers has no nontrivial kth pow...
Smooth projective hashing has proven to be an extremely
useful primitive, in particular when used in conjunction with commitments
to provide implicit decommitment. This has lead to applications
pro...
Smooth NIZK Arguments with Applications to Asymmetric UC-PAKE
UC-PAKE bilinear pairings SXDH
2016/3/4
We introduce a novel notion of smooth (-verifier) non- interactive
zero-knowledge proofs (NIZK) which parallel the familiar notion of
smooth projective hash functions (SPHF). We also show that the r...
Distributed Smooth Projective Hashing and its Application to Two-Server PAKE
Smooth Projective Hash Functions Two-Server PAKE
2016/1/9
Smooth projective hash functions have been used as building block for various cryptographic
applications, in particular for password-based authentication.
A Comprehensive Comparison of Shannon Entropy and Smooth Renyi Entropy
Entropy Estimators Smooth Entropy Randomness Extractors
2016/1/5
We provide a new result that links two crucial entropy notions: Shannon entropy H1 and collision entropy H2. Our formula gives the \emph{worst possible} amount of collision entropy in a probability di...
KDM-Security via Homomorphic Smooth Projective Hashing
public-key cryptography Homomorphic Smooth Projective Hashing
2015/12/24
We present new frameworks for constructing public-key encryption schemes satisfying key-dependent
message (KDM) security and that yield efficient, universally composable oblivious transfer (OT) proto...
Smooth Projective Hash Functions are one of the base tools to build interactive protocols; and this notion has lead to the construction of numerous protocols enjoying strong security notions, such as ...
Trapdoor Smooth Projective Hash Functions
Authenticated Key Exchange Zero-Knowledge Arguments
2014/3/12
Katz and Vaikuntanathan recently improved smooth projective hash functions in order to build one-round password-authenticated key exchange protocols (PAKE). To achieve security in the UC framework the...
New Smooth Projective Hash Functions and One-Round Authenticated Key Exchange
Authenticated Key Exchange Blind Signatures Smooth Projective Hash Functions
2013/2/21
Password-Authenticated Key Exchange (PAKE) has received deep attention in the last few years, with a recent improvement by Katz-Vaikuntanathan, and their one-round protocols: the two players just have...
Smooth Projective Hashing and Two-Message Oblivious Transfer
Smooth Projective Hashing Two-Message Oblivious Transfer
2008/9/5
We present a general framework for constructing two-message oblivious transfer protocols
using a modification of Cramer and Shoup’s notion of smooth projective hashing (2002). This
framework is an a...