Results 281 to 290 of about 26,946 (315)
Some of the next articles are maybe not open access.
The Provable Security of Ed25519: Theory and Practice
2021 IEEE Symposium on Security and Privacy (SP), 2021A standard requirement for a signature scheme is that it is existentially unforgeable under chosen message attacks (EUF-CMA), alongside other properties of interest such as strong unforgeability (SUF-CMA), and resilience against key substitution attacks.
Cas Cremers +3 more
openaire +1 more source
A Brief Introduction to Provable Security
IEEE Latin America Transactions, 2016A recurring question when we design a cryptographic scheme is how to determine its security level. The provable security is a technique that can help to answer this question. In this paper we present a friendly introduction of this technique by analyzing a cryptographic scheme in the private-key setting, also we briefly discuss some alternatives to ...
Nareli Cruz Cortes +3 more
openaire +2 more sources
Practice-oriented provable-security
1998This 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 +3 more sources
Provable Security for Cryptocurrencies
2016The past several years have seen the surprising and rapid rise of Bitcoin and other “cryptocurrencies.” These are decentralized peer-to-peer networks that allow users to transmit money, tocompose financial instruments, and to enforce contracts between mutually distrusting peers, andthat show great promise as a foundation for financial infrastructure ...
openaire +3 more sources
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
Johannes Buchmann +2 more
openaire +2 more sources
Provable Security in the Real World
IEEE Security & Privacy Magazine, 2011Provable security plays an important role in the design and analysis of systems using cryptography. However, protocols can be vulnerable to attacks outside the scope of the existing formal analyses.
Gaven J. Watson +2 more
openaire +1 more source
An Architecture for Provably Secure Computation
2006We describe an architecture requiring very few changes to any standard von Neumann machine that provably withstands coalitions between a malicious operating system and other users, in the sense that: If the operating system permits a program to run, then the program produces the same outputs as it would produce if it were running on an ideal, single-
Miklós Ajtai +2 more
openaire +2 more sources
Data Deletion with Provable Security
2009In 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 +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 +2 more sources
An Analysis of Provable Security Frameworks for RFID Security
2020Radio frequency identification (RFID) has become one of the most eminent commercial technologies in the last few years. The RFID tags are embedded or latched with any item for their unique identification. These tags can carry small amounts of data and have capability to perform simple computations.
Aakanksha Tewari, Brij B. Gupta
openaire +2 more sources