搜索结果: 1-11 共查到“密码学 Commitment schemes”相关记录11条 . 查询时间(0.187 秒)
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...
UC-Commitment Schemes with Phase-Adaptive Security from Trapdoor Functions
Commitment Universal Composability Global Random Oracle
font style='font-size:12px;'>
2019/5/21
We propose a generic framework for perfectly hiding UC-Commitment schemes in the Global Random Oracle model of Canetti \textit{el at.} (CCS 14). The main building block of our construction is a novel ...
DL-Extractable UC-Commitment Schemes
CRS model extractable commitment RPK model
font style='font-size:12px;'>
2019/3/1
We define a new UC functionality (DL-extractable commitment scheme) that allows committer to open a commitment to a group element gxgx; however, the simulator will be able to extract its discrete loga...
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions
Commitment schemes functional commitments accumulators
font style='font-size:12px;'>
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 ...
Analysis and Improvement of Lindell's UC-Secure Commitment Schemes
cryptographic protocols / UC Commitment
font style='font-size:12px;'>
2013/4/18
In 2011, Lindell proposed an efficient commitment scheme, with a non-interactive opening algorithm, in the Universal Composability (UC) framework. He recently acknowledged a bug in its security analy...
A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC)
cryptography zero knowledge instant-dependent commitment schemes
font style='font-size:12px;'>
2009/9/27
Zero-knowledge protocols are often studied through specific problems, like GRAPH-ISOMORPHISM.
In many cases this approach prevents an important level of abstraction and leads to limited results,
whe...
A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC)
cryptography zero knowledge instant-dependent commitment schemes
font style='font-size:12px;'>
2009/9/22
Zero-knowledge protocols are often studied through specific problems, like GRAPH-ISOMORPHISM.
In many cases this approach prevents an important level of abstraction and leads to limited results,
whe...
A generalized Framework for Crisp Commitment Schemes
Cryptography Commitment Schemes Discrete Mathematics
font style='font-size:12px;'>
2009/6/12
Crisp Commitment schemes are very useful building blocks in the design of high-level
cryptographic protocols. They are used as a mean of flipping fair coins between two players and
others. In this p...
The Multireceiver Commitment Schemes
Multireceiver Commitment Schemes optimal MRA-code
font style='font-size:12px;'>
2009/6/4
Existing commitment schemes were addressed under the classic two-party scenario.
However, popularity of the secure multi-party computation in today's lush network commu-
nication is motivating us to...
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
Perfect Hiding Perfect Binding Universally Composable Commitment Schemes Constant Expansion Factor
font style='font-size:12px;'>
2009/4/16
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
Non-interactive and Reusable Non-malleable Commitment Schemes
Commitment non-malleability universal composability
font style='font-size:12px;'>
2009/4/9
We consider non-malleable (NM) and universally composable (UC)
commitment schemes in the common reference string (CRS) model.
We show how to construct non-interactive NM commitments that re-
main n...