Results 261 to 270 of about 2,875 (293)

Data Deletion with Provable Security

2009
In many systems one of the most important and essential functionalities necessary for secure data processing is the permanent and irreversible deletion of stored bits. According to recent results, it is possible to retrieve data from numerous (especially magnetic) data storage devices, even if some erasing techniques like wiping have been applied.
Marek Klonowski, Michal Przykucki, Tomasz Struminski   +2 more
openaire   +1 more source

Provable Implementations of Security Protocols

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006
Proving 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   +1 more source

Symbolic Methods for Provable Security

2009
Rigorous 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

On the Efficiency of Provably Secure NTRU

2014
It 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, Patrick Weiden, Johannes Buchmann 0001   +2 more
openaire   +1 more source

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.
Fatemeh Rezaeibagha, Yi Mu 0001, Shiwei Zhang 0003, Xiaofen Wang   +3 more
openaire   +3 more sources

Provably secure ciphertext policy ABE

Proceedings of the 14th ACM conference on Computer and communications security, 2007
In 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   +2 more sources

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.
Yong Yu 0002, Yafang Zhang, Yi Mu 0001, Willy Susilo, Hongyu Liu   +4 more
openaire   +2 more sources

Cryptography and the Methodology of Provable Security

2003
Public 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

Asynchronous Provably-Secure Hidden Services

2018
The client-server architecture is one of the most widely used in the Internet for its simplicity and flexibility. In practice the server is assigned a public address so that its services can be consumed. This makes the server vulnerable to a number of attacks such as Distributed Denial of Service (DDoS), censorship from authoritarian governments or ...
Philippe Camacho, Fernando Krell
openaire   +2 more sources

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