搜索结果: 1-15 共查到“密码学 Simulation-Based”相关记录16条 . 查询时间(0.137 秒)
Simulation-based Receiver Selective Opening CCA Secure PKE from Standard Computational Assumptions
public key encryption receiver selective opening security chosen ciphertext security
2018/11/12
In the situation where there are one sender and multiple receivers, a receiver selective opening (RSO) attack for a public key encryption (PKE) scheme considers adversaries that can corrupt some of th...
Simulation-Based Selective Opening Security for Receivers under Chosen-Ciphertext Attacks
simulation-based security selective opening security for receivers chosen-ciphertext attacks
2018/8/21
Security against selective opening attack (SOA) for receivers requires that in a multi-user setting, even if an adversary has access to all ciphertexts, and adaptively corrupts some fraction of the us...
Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts
Public-key encryption selective-opening security lossy encryption
2016/2/24
In a selective-opening (SO) attack on an encryption scheme, an adversary A gets a number of ciphertexts (with possibly related plain- texts), and can then adaptively select a subset of those ciphertex...
Simulation-Based Secure Functional Encryption in the Random Oracle Model
Functional Encryption Random Oracle Model Simulation-Based Security
2016/1/6
One of the main lines of research in functional encryption (FE) has consisted in studying the security notions for FE and their achievability. This study was initiated by [Boneh et al. -- TCC'11, O'Ne...
Simulation-based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms
public-key cryptography selective opening
2016/1/5
We study simulation-based, selective opening security against chosen-ciphertext attacks (SIM-SO-CCA security) for public key encryption (PKE). In a selective opening, chosen-ciphertext attack (SO-CCA)...
On the Achievability of Simulation-Based Security for Functional Encryption
Simulation-Based Functional Encryption
2014/3/12
This work attempts to clarify to what extent simulation-based security (SIM-security) is achievable for functional encryption (FE) and its relation to the weaker indistinguishability-based security (I...
Automata Evaluation and Text Search Protocols with Simulation Based Security
text search malicious adversary simulation based security
2010/9/21
This paper presents an efficient protocol for securely computing the fundamental problem of {\em pattern matching}. This problem is defined in the two-party setting, where party P1 holds a pattern and...
Ideal Key Derivation and Encryption in Simulation-based Security
cryptographic protocols simulation-based security
2010/7/13
Many real-world protocols, such as SSL/TLS, SSH, IPsec, IEEE 802.11i, DNSSEC, and Kerberos, derive new keys from other keys. To be able to analyze such protocols in a composable way, in this paper we ...
Efficient Oblivious Polynomial Evaluation with Simulation-Based Security
secure two-party computation efficient protocols full simulation-based security
2009/9/27
The study of secure multiparty computation has yielded powerful feasibility results showing
that any efficient functionality can be securely computed in the presence of malicious adver-
saries. Desp...
Efficient Oblivious Polynomial Evaluation with Simulation-Based Security
secure two-party computation efficient protocols full simulation-based security
2009/9/22
The study of secure multiparty computation has yielded powerful feasibility results showing
that any efficient functionality can be securely computed in the presence of malicious adver-
saries. Desp...
A Simulation-Based Treatment of Authenticated Message Exchange
Simulation-Based Treatment Authenticated Message Exchange
2009/8/7
Simulation-based security notions for cryptographic protocols
are regarded as highly desirable, primarily because they admit strong
composability and, consequently, a modular design. In this paper, ...
Simulation based security in the applied pi calculus
security protocols applied pi calculus Needham-Schroeder-Lowe protocol
2009/6/15
We present a symbolic framework for refinement and composition of
security protocols. The framework uses the notion of ideal functionalities. These
are abstract systems which are secure by construct...
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
expected polynomial-time black-box simulation secure multiparty computation
2009/3/12
The standard class of adversaries considered in cryptography is that of strict polynomial-time
probabilistic machines. However, expected polynomial-time machines are often also considered.
For examp...
On the Relationships Between Notions of Simulation-Based Security
simulation-based security universal composability reactive simulatability
2008/11/19
Several compositional forms of simulation-based security have been proposed in the literature,
including universal composability, black-box simulatability, and variants thereof. These
relations betw...
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Simulation-Based Security Interactive Turing Machines
2008/11/18
Recently, there has been much interest in extending models
for simulation-based security in such a way that the runtime of protocols
may depend on the length of their input. Finding such extensions ...