搜索结果: 1-15 共查到“军事学 UC”相关记录44条 . 查询时间(0.059 秒)
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...
Your Money or Your Life---Modeling and Analyzing the Security of Electronic Payment in the UC Framework
EMV Universal Composability Security Models
2019/8/19
EMV, also known as Chip and PIN, is the world-wide standard for card-based electronic payment. Its security wavers: over the past years, researchers have demonstrated various practical attacks, rangin...
Post-Quantum UC-Secure Oblivious Transfer in the Standard Model with Adaptive Corruptions
Smooth Projective Hash Functions Oblivious Transfer
2019/6/19
Since the seminal result of Kilian, Oblivious Transfer has proven to be a fundamental primitive in cryptography. In such a scheme, a user is able to gain access to an element owned by a server, withou...
UC-Commitment Schemes with Phase-Adaptive Security from Trapdoor Functions
Commitment Universal Composability Global Random Oracle
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 ...
Zero-knowledge SNARKs (zk-SNARKs) have recently found various applications in verifiable computation and blockchain applications (Zerocash), but unfortunately they rely on a common reference string (C...
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...
A Post-Quantum UC-Commitment Scheme in the Global Random Oracle Model from Code-Based Assumptions
Commitment Scheme Universal Composability
2019/2/27
In this work, we propose the first post-quantum UC-commitment scheme in the Global Random Oracle Model, where only one non-programmable random oracle is available. The security of our proposal is base...
Multi-Protocol UC and its Use for Building Modular and Efficient Protocols
Building Modular Efficient Protocols
2019/1/26
We want to design and analyze protocols in a modular way by combining idealized components that we realize individually. While this is in principle possible using security frameworks that provide gene...
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...
A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models
secure computation black-box constructions
2017/9/28
We present a unified framework for obtaining black-box constructions of Universal Composable (UC) protocol in trusted setup models. Our result is analogous to the unified framework of Lin, Pass, and V...
Looking more closely, our characterization applies only to a very wide class of ff, and only for protocols that are deterministic or logarithmic-round. However, we give concrete examples showing that ...
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...
Too Simple to be UC-Secure: On the UC-Insecurity of the ``Simplest Protocol for Oblivious Transfer'' of Chou and Orlandi
oblivious transfer universal composability
2017/5/2
In 2015, Chou and Orlandi presented an oblivious transfer protocol that already drew a lot of attention both from theorists and practitioners due to its extreme simplicity and high efficiency. Chou an...
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...
New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs
Physically uncloneable functions UC security hardware setup assumptions
2016/6/22
Brzuska \etal. (Crypto 2011) proved that unconditional UC-secure computation is possible if parties have access to honestly generated physically unclonable functions (PUFs). Dachman-Soled \etal. (Cryp...