Results 211 to 220 of about 956 (257)
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 ...
Rezaeibagha, Fatemeh +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 +1 more source
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 +1 more source
Secure Untrusted Binaries — Provably!
2006Most 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
Provably Secure Digital Signatures
2002In previous sections we discussed signature schemes (PSS and PSS-R in Section 3.4.3; the Fiat-Shamir signature scheme in Section 4.2.5) that include a hash function h and whose security can be proven in the random oracle model. It is assumed that the hash function h is a random oracle, i.e. it behaves like a perfectly random function.
Hans Delfs, Helmut Knebl
openaire +1 more source
Developing Provable Secure M-Commerce Applications
2006We present a modeling framework and a verification technique for m-commerce applications. Our approach supports the development of secure communication protocols for such applications as well as the refinement of the abstract protocol descriptions into executable Java code without any gap.
Grandy, Holger +3 more
openaire +2 more sources
Climate change impacts on plant pathogens, food security and paths forward
Nature Reviews Microbiology, 2023Brajesh K Singh +2 more
exaly
The rumen microbiome: balancing food security and environmental impacts
Nature Reviews Microbiology, 2021Itzhak Mizrahi, Robert Wallace
exaly
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 +2 more sources