搜索结果: 1-7 共查到“军事学 functionality”相关记录7条 . 查询时间(0.031 秒)
Extended Functionality in Verifiable Searchable Encryption
Verifiable Searchable Encryption Verifiable Computation Attribute-based Encryption
2015/12/22
When outsourcing the storage of sensitive data to an (untrusted)
remote server, a data owner may choose to encrypt the data
beforehand to preserve confidentiality. However, it is then difficult to
...
A Secure Obfuscator for Encrypted Blind Signature Functionality
Obfuscation Blind signature Indistinguishable security
2014/3/6
This paper introduces a new obfuscation called obfuscation of encrypted blind signature. Informally, Alice is Signer and Bob is User. Bob needs Alice to sign a message, but he does not want Alice to k...
An Efficient Protocol for the Commit-Prove-Fair-Open functionality
cryptographic protocols / commit-prove-fair-open functionality resource fairness time-lines secure multi-party computation
2012/3/21
In TCC 2006, Garay et al. introduced the notion of "commit-prove-fair-open" functionality in order to achieve what they called "resource fairness" of secure multi-party computation(MPC) with corrupted...
An Efficient Protocol for the Commit-Prove-Fair-Open functionality
cryptographic protocols / commit-prove-fair-open functionality resource fairness ime-lines secure multi-party computation
2012/3/23
In TCC 2006, Garay et al. introduced the notion of "commit-prove-fair-open" functionality in order to achieve what they called "resource fairness" of secure multi-party computation(MPC) with corrupted...
A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality
Zero-Knowledge Proofs Knowledge and the ZKPOK Ideal Functionality
2010/11/2
In this note, we provide a formal proof of the fact that any protocol that is a zero-knowledge proof of knowledge for a relation $R$ is also a secure protocol for the zero-knowledge proof of knowledge...
How to Break and Repair a Universally Composable Signature Functionality
digital signature schemes universal composability adaptive chosenmessage attack
2009/4/10
Canetti and Rabin recently proposed a universally composable
ideal functionality FSIG for digital signatures. We show that
this functionality cannot be securely realized by any signature scheme,
th...
Games and the Impossibility of Realizable Ideal Functionality
Games Realizable Ideal Functionality security mechanism
2009/2/17
A cryptographic primitive or a security mechanism can be
specified in a variety of ways, such as a condition involving a game against
an attacker, construction of an ideal functionality, or a list o...