搜索结果: 1-15 共查到“军事学 commitments”相关记录49条 . 查询时间(0.187 秒)
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...
A Note on Key Agreement and Non-Interactive Commitments
Non-interactive commitments key agreement
2019/3/13
We observe that any key agreement protocol satisfying perfect completeness, regardless of its round complexity, can be used to construct a non-interactive commitment scheme.
Function-Dependent Commitments from Homomorphic Authenticators
public-key cryptography Homomorphic Authenticators Commitments
2019/3/2
In cloud computing, delegated computing raises the security issue of guaranteeing data authenticity during a remote computation. In this context, the recently introduced function-dependent commitments...
Function-Dependent Commitments for Verifiable Multi-Party Computation
Commitments Homomorphic Cryptography Verifiable Computation
2018/7/9
In cloud computing, delegated computing raises the security issue of guaranteeing data authenticity during a remote computation. Existing solutions do not simultaneously provide fast correctness verif...
One-Message Zero Knowledge and Non-Malleable Commitments
Zero-Knowledge Non-Malleable-Commitments Concurrency
2018/6/25
We introduce a new notion of one-message zero-knowledge (1ZK) arguments that satisfy a weak soundness guarantee — the number of false statements that a polynomial-time non-uniform adversary can convin...
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments
non-malleable codes continuous non-malleable codes non-malleable commitments
2018/6/19
Non-Malleable Codes (NMC) were introduced by Dziembowski, Pietrzak and Wichs in ICS 2010 as a relaxation of error correcting codes and error detecting codes. Faust, Mukherjee, Nielsen, and Venturi in ...
Non-Malleability vs. CCA-Security: The Case of Commitments
non-malleability CCA security commitments
2017/11/13
In this work, we settle the relations among a variety of security notions related to non-malleability and CCA-security that have been proposed for commitment schemes in the literature. Interestingly, ...
Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments
secret sharing commitments malicious model
2017/6/9
We present a new approach to secure multiparty computation against a static and malicious dishonest majority. Unlike previous protocols that were based on working on MAC-ed secret shares, our approach...
SplitCommit: Implementing and Analyzing Homomorphic UC Commitments
Homomorphic Commitment non-homomorphic
2017/5/15
In this paper we present SplitCommit, a portable and efficient C++ implementation of the recent additively homomorphic commmitment scheme of Frederiksen et al. [FJNT16]. We describe numerous optimizat...
Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions
non-malleable commitments two rounds
2017/4/5
Despite fifteen years of research on the round complexity of non-malleable commitments, their exact round complexity has remained open. In particular, the goal of achieving non-malleable commitment pr...
Switch Commitments: A Safety Switch for Confidential Transactions
commitments cryptographic agility everlasting security
2017/3/13
Cryptographic agility is the ability to switch to larger cryptographic parameters or different algorithms in the case of security doubts. This very desirable property of cryptographic systems is inher...
Faster LEGO-based Secure Computation without Homomorphic Commitments
cryptographic protocols maliciously secure two-party computation
2017/3/9
LEGO-style cut-and-choose is known for its asymptotic efficiency in realizing actively-secure computations. The dominant cost of LEGO protocols is due to wire-soldering — the key technique enabling to...
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions
Commitment schemes functional commitments accumulators
2016/12/10
We propose a construction of functional commitment (FC) for linear functions based on constant-size assumptions in composite order groups endowed with a bilinear map. The construction has commitments ...
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems
Efficient Commitments Zero-Knowledge Protocols
2016/12/8
We present an additively homomorphic commitment scheme
with hardness based on the Ring-SIS problem. Our construction is statistically
hiding as well as computationally binding and allows to commit
...
Improving Practical UC-Secure Commitments based on the DDH Assumption
universally composable commitments adaptive security public-key cryptography
2016/6/29
At Eurocrypt 2011, Lindell presented practical static and adaptively UC-secure commitment
schemes based on the DDH assumption. Later, Blazy et al. (at ACNS 2013) improved the effi-
ciency of the Lin...