Results 251 to 260 of about 1,527 (301)

Provably Secure (Broadcast) Homomorphic Signcryption

International Journal of Foundations of Computer Science, 2019
Signcryption has drawn a lot of attention due to its useful applications in many areas, in particular for applications where the computation and communication resources are constrained, for example, for lightweight devices. The traditional signcryption scheme does not support the homomorphic property. Recent work by Rezaeibagha et al.
Rezaeibagha, Fatemeh, Mu, Yi, Zhang, Shiwei, Wang, Xiaofen   +3 more
openaire   +3 more sources

Provably Secure Encryption

2002
This chapter deals with provable security. It is desirable that mathematical proofs show that a given cryptosystem resists certain types of attacks. The security of cryptographic schemes and randomness are closely related. An encryption method provides secrecy only if the ciphertexts appear sufficiently random to the adversary. Therefore, probabilistic
Hans Delfs, Helmut Knebl
openaire   +1 more source

Provably Secure Identity Based Provable Data Possession

2015
Provable Data Possession PDP, which enables cloud users to verify the integrity of their outsourced data without retrieving the entire file from cloud servers, is highly essential in secure cloud storage. A majority of the existing PDP schemes rely on the expensive Public Key Infrastructure PKI.
Yu, Yong, Zhang, Yayfang, Mu, Yi, Susilo, Willy, Liu, Hongyu   +4 more
openaire   +2 more sources

Provably-Secure Logic Locking

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017
Logic locking has been conceived as a promising proactive defense strategy against intellectual property (IP) piracy, counterfeiting, hardware Trojans, reverse engineering, and overbuilding attacks. Yet, various attacks that use a working chip as an oracle have been launched on logic locking to successfully retrieve its secret key, undermining the ...
Muhammad Yasin, Abhrajit Sengupta, Mohammed Thari Nabeel, Mohammed Ashraf, Jeyavijayan (JV) Rajendran, Ozgur Sinanoglu   +5 more
openaire   +1 more source

Provably Secure Homomorphic Signcryption

2017
Signcryption has shown many useful applications, in particular for the environment where the computation and communication resources are constrained, for instance, for applications on lightweight devices. However, we notice that traditional signcryption schemes do not support homomorphic properties, which are very useful in many application scenarios ...
Rezaeibagha, Fatemeh, Mu, Yi, Zhang, Shiwei, Wang, Xiaofen   +3 more
openaire   +2 more sources

Practice-oriented provable-security

1998
This short article is intended to complement my talk. I would like to try to introduce you to a certain, relatively new sub-area of cryptography that we have been calling practice-oriented provable-security. It is about applying the ideas of “provably security” to the derivation of practical, secure protocols. I believe it is a fruitful blend of theory
openaire   +1 more source

Cryptanalysis vs. Provable Security

2012
In 2004, Koblitz and Menezes started [2] a series of papers questioning the methodology and impact of provable security. We take another look, by comparing cryptanalysis results and provable security results on a variety of topics. We argue that security is complex, and that there is much to gain from better interaction between cryptanalysis and ...
openaire   +1 more source

Secure Untrusted Binaries — Provably!

2006
Most of the previous comparisons of formal analyses of security protocols have concentrated on the tabulation of attacks found or missed. More recent investigations suggest that such cursory comparisons can be misleading. The original context of a protocol as well as the operating assumptions of the analyst have to be taken into account before ...
Simon Winwood, Manuel M. T. Chakravarty
openaire   +1 more source