搜索结果: 46-60 共查到“知识库 计算机工程”相关记录1100条 . 查询时间(2.531 秒)
We study the strength of certain obfuscation techniques used to protect software from reverse engineering and tampering. We show that some common obfuscation methods can be defeated using a fault inje...
We construct a fully collusion resistant tracing traitors system with sublinear size ciphertexts and constant size private keys. More precisely, let N be the total number of users. Our system generate...
Strongly Unforgeable Signatures Based on Computational Diffie-Hellman
Computational Diffie-Hellman Unforgeable Signatures
2015/8/5
A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some message M, the adversary cannot produce a new signature on M. Strongly...
Fast variants of RSA
RSA systems
2015/8/5
We survey four variants of RSA designed to speed up RSA decryption and signing. We only consider variants that are backwards compatible in the sense that a system using one of these variants can inter...
Chosen-Ciphertext Security from Identity-Based Encryption
Identity-Based Encryption Chosen-Ciphertext Security
2015/8/5
We propose simple and efficient "CCA-secure" public-key encryption schemes (i.e., schemes secure against adaptive chosen-ciphertext attacks) based on any identity-based encryption (IBE) scheme. When i...
Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys
Resistant Broadcast Encryption Short Ciphertexts
2015/8/5
We describe two new public key broadcast encryption systems for stateless receivers. Both systems are fully secure against any number of colluders. In our first construction both ciphertexts and priva...
Let F be a 2-DNF formula on boolean variables x1,...,xn. We present a homomorphic public key encryption system that allows the public evaluation of F given an encryption of the variables x1,...,xn. In...
Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity Based Encryption
Cryptosystems Built Identity Based Encryption
2015/8/5
Recently, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure encryption from identity-based encryption in the standard model. We improve the efficiency of their construction...
Group Signatures with Verifier-Local Revocation
Verifier-Local Revocation signature verifiers
2015/8/5
Group signatures have recently become important for enabling privacy-preserving attestation in projects such as Microsoft's {\sc ngscb} effort (formerly Palladium). Revocation is critical to the secur...
On the Effectiveness of Address-Space Randomization
Address-Space Randomization running code
2015/8/5
Address-space randomization is a technique used to fortify systems against buffer overflow attacks. The idea is to introduce artificial diversity by randomizing the memory location of certain system c...
We construct a short group signature scheme. Signatures in our scheme are approximately the size of a standard RSA signature with the same security. Security of our group signature is based on the Str...
Efficient Selective Identity-Based Encryption Without Random Oracles
Random Oracles Identity-Based Encryption
2015/8/5
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model Selective identity secure IBE is a slightly weaker security model ...
Homomorphic MACs: MAC-Based Integrity for Network Coding
Network Coding MAC-Based Integrity
2015/8/5
Network coding has been shown to improve the capacity and robustness in networks. However, since intermediate nodes modify packets en-route, integrity of data cannot be checked using traditional MACs ...
A traitor tracing system enables a publisher to trace a pirate decryption box to one of the secret keys used to create the box. We present the first traitor tracing system where ciphertext size is "co...
Circular-Secure Encryption from Decision Diffie-Hellman
Decision Diffie-Hellman Circular-Secure Encryption
2015/8/5
We describe a public-key encryption system that remains secure even encrypting messages that depend on the secret keys in use. In particular, it remains secure under a ``key cycle'' usage, where we ha...