Results 201 to 210 of about 1,931,179 (234)
Some of the next articles are maybe not open access.
Provably Secure Homomorphic Signcryption
2017Signcryption 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 ...
Fatemeh Rezaeibagha +3 more
openaire +3 more sources
Cryptography and the Methodology of Provable Security
2003Public key cryptography was proposed in the 1976 seminal article of Diffie and Hellman [6]. One year later, Rivest, Shamir and Adleman introduced the RSA cryptosystem as a first example. From an epistemological perspective, one can say that Diffie and Hellman have drawn the most extreme consequence of a principle stated by Auguste Kerckhoffs in the ...
openaire +1 more source
On the Efficiency of Provably Secure NTRU
2014It is still a challenge to find a lattice-based public-key encryption scheme that combines efficiency (as e.g. NTRUEncrypt) with a very strong security guarantee (as e.g. the ring-LWE based scheme of Lyubashevsky, Peikert, and Regev LPR-LWE). Stehle and Steinfeld (EUROCRYPT 11) presented a provably secure variant of NTRUEncrypt (pNE), perhaps the first
Daniel Cabarcas +2 more
openaire +2 more sources
Symbolic Methods for Provable Security
2009Rigorous proofs are notoriously difficult to produce and verify even for seemingly simple cryptographic tasks. As a result, many published papers contain proofs that are most of the time incomplete and ocasionally flawed. Arguably, this indicates that the provable security paradigm is heading towards an undesirable crisis of rigor.
openaire +1 more source
Provable Implementations of Security Protocols
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006Proving security protocols has been a challenge ever since Needham and Schroeder threw down the gauntlet in their pioneering 1978 paper: Protocols such as those developed here are prone to extremely subtle errors that are unlikely to be detected in normal operation.
openaire +2 more sources
Provably secure ciphertext policy ABE
Proceedings of the 14th ACM conference on Computer and communications security, 2007In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on attributes. Decryption is enabled if and only if the user's attribute set satisfies the ciphertext access structure. This provides fine-grained access control on shared data in
Ling Cheung, Calvin C. Newport
openaire +3 more sources
Provably Secure Identity Based Provable Data Possession
2015Provable 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.
Yong Yu 0002 +4 more
openaire +2 more sources
Provably Secure (Broadcast) Homomorphic Signcryption
International Journal of Foundations of Computer Science, 2019Signcryption 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.
Fatemeh Rezaeibagha +3 more
openaire +4 more sources
Cryptanalysis vs. Provable Security
2012In 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 +2 more sources
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
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