A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Filters
Secret Public Key Protocols Revisited
[chapter]
2009
Lecture Notes in Computer Science
In this paper, we revisit the concept and introduce the notion of identity-based secret public keys. ...
We examine identity-based secret public key protocols and give informal security analyses, indicating that they are secure against off-line password guessing and other attacks. ...
Acknowledgements The authors would like to thank Qiang Tang for his very helpful feedback on an earlier draft of this paper, and Kim-Kwang Raymond Choo for pointing out a flaw in an earlier version of ...
doi:10.1007/978-3-642-04904-0_33
fatcat:uvirsmmk4vgercvstgqn243emm
Secret Public Key Protocols Revisited
[chapter]
2009
Lecture Notes in Computer Science
In this paper, we revisit the concept and introduce the notion of identity-based secret public keys. ...
We examine identity-based secret public key protocols and give informal security analyses, indicating that they are secure against off-line password guessing and other attacks. ...
Acknowledgements The authors would like to thank Qiang Tang for his very helpful feedback on an earlier draft of this paper, and Kim-Kwang Raymond Choo for pointing out a flaw in an earlier version of ...
doi:10.1007/978-3-642-04904-0_32
fatcat:htm653rrfzc3bjiez2dehyqhim
'Disembodied Spirits' Revisiting Manderley
2002
Anachronist
Rebecca as writing and narrative. ...
These layers do not appear separately in the text, as they all depend on one another in their methods and purpose of constructing Rebecca. ...
be restored, and his masculine identity secured with another marriage. ...
doi:10.53720/cweq7043
fatcat:7kskikh7yzb5dbmxmpfuiv6aea
From Stateless to Stateful: Generic Authentication and Authenticated Encryption Constructions with Application to TLS
[chapter]
2016
Lecture Notes in Computer Science
We present a hierarchy of authentication and AEAD security notions, interpolating between the lowest level of protection (against forgeries) and the highest level (against forgeries, replays, reordering ...
The definitions in the literature and the constructions used in practice all protect against forgeries, but offer varying levels of protection against replays, reordering, and drops. ...
First, we construct a hierarchy of authentication levels: 1. protection against forgeries, 2. protection against forgeries and replays, 3. protection against forgeries, replays, and reordering of messages ...
doi:10.1007/978-3-319-29485-8_4
fatcat:h4ghizualjccjbm6itomo7uyfq
Confidentiality and Integrity: A Constructive Perspective
[chapter]
2012
Lecture Notes in Computer Science
Others appear unsuitable for symmetric encryption, such as IND-CCA. ...
This makes the guarantees achieved by cryptographic schemes explicit, and leads to security definitions that are composable. ...
We thank Kenny Paterson for fruitful discussions and the anonymous reviewers for their very helpful comments and suggestions. ...
doi:10.1007/978-3-642-28914-9_12
fatcat:tpok6m5pxzboxec6udms45sq5m
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
[chapter]
2001
Lecture Notes in Computer Science
This is rather cumbersome because homomorphic cryptosystems are known to be malleable and therefore not to be CCA secure. ...
Semantic security against chosen-ciphertext attacks (IND-CCA) is widely believed as the correct security level for public-key encryption scheme. ...
The proof of equality of plaintexts consists in proving the existence of r and s such that β 0 = g r , β 1 = g s and α 0 /α 1 = y r 0 y −s 1 . ...
doi:10.1007/3-540-45682-1_21
fatcat:xzigglz2obde7p6tvfjrmkykje
Using Identity-based Secret Public Keys Cryptography For Heuristic Security Analyses In Grid Computing
2011
Journal of Mathematics and Computer Science
We examine identity-based secret public key protocols and give informal security analyses which show that they may well be secure against online password guessing and other attacks. ...
The majority of current security architectures for grid systems use public key infrastructure (PKI) to authenticate identities of grid members and to secure resource allocation to these members. ...
Since the encryption scheme is IND-ID-CCA secure, E only has a negligible success probability to find the correct aP. ...
doi:10.22436/jmcs.03.04.01
fatcat:4xhbphl5kjhq7efkro4h2ng7xa
Security Notions for Bidirectional Channels
2017
IACR Transactions on Symmetric Cryptology
And, in the first place, what does security in the bidirectional setting actually mean? ...
We note that, while most security models for channels consider exclusively unidirectional communication, real-world protocols like TLS and SSH are rather used for bidirectional interaction. ...
Acknowledgments We thank Marc Fischlin, Felix Günther, Martijn Stam, and anonymous reviewers for helpful discussions and insightful comments on early versions of this work. ...
doi:10.46586/tosc.v2017.i1.405-426
fatcat:p5hwy4sztnf4zietwkoyqjrbgi
Security Notions for Bidirectional Channels
2017
IACR Transactions on Symmetric Cryptology
And, in the first place, what does security in the bidirectional setting actually mean? ...
We note that, while most security models for channels consider exclusively unidirectional communication, real-world protocols like TLS and SSH are rather used for bidirectional interaction. ...
Acknowledgments We thank Marc Fischlin, Felix Günther, Martijn Stam, and anonymous reviewers for helpful discussions and insightful comments on early versions of this work. ...
doi:10.13154/tosc.v2017.i1.405-426
dblp:journals/tosc/MarsonP17
fatcat:xodfbjptefawlfaouzrgoyueoa
Efficient eCK-Secure Authenticated Key Exchange Protocols in the Standard Model
[chapter]
2013
Lecture Notes in Computer Science
In this paper, we study the open problem on constructing eCK secure AKE protocol without random oracles and NAXOS like trick. ...
On the second a concrete protocol is proposed which is the first eCK secure protocol in the standard model under both standard assumptions and post-specified peer setting. ...
, IND-CCA secure KEM schemes and CKS-light secure NIKE schemes. ...
doi:10.1007/978-3-319-02726-5_14
fatcat:sjsfqi6hsjclpdgem5jhgoogea
Mitigating Server Breaches in Password-Based Authentication: Secure and Efficient Solutions
[chapter]
2016
Lecture Notes in Computer Science
Our protocols rely on smooth projective hash functions and are proven secure under classical assumption in the standard model (i.e. do not require idealized assumption, such as random oracles). ...
It is one of the most widely used and fundamental cryptographic primitives. ...
IND-CCA. ...
doi:10.1007/978-3-319-29485-8_1
fatcat:gstbmlp7onfyfdlvmp3uwrkgxq
What Public Keys Can Do for 3-Party, Password-Authenticated Key Exchange
[chapter]
2014
Lecture Notes in Computer Science
Let η be the security parameter. In the ideal world, the only parameters η determines are the length SK of the session keys, and the length of the password pw . ...
We dene new simulation-based security models specically tailored to 3-PAKEs with server private keys and illustrate our work with several protocols. 1 Introduction 1.1 Password-Authenticated Key Exchange ...
Ryan, Qiang Tang, and Jeroen van de Graaf for fruitful discussions on this topic. ...
doi:10.1007/978-3-642-53997-8_6
fatcat:rqk4f25punbvph6p3xqxfn5er4
Anonymous Two-Factor Authentication in Distributed Systems: Certain Goals Are Beyond Attainment
2015
IEEE Transactions on Dependable and Secure Computing
We first revisit two foremost proposals, i.e. Tsai et al.'s scheme and Li's scheme, revealing some subtleties and challenges in designing such schemes. ...
and privacy. ...
This research was supported by the National Natural Science Foundation of China (NSFC) under Grants No.61170263 and No.6137024, ...
doi:10.1109/tdsc.2014.2355850
fatcat:v6skqorlw5fcffqwd6ikmdqiaq
Quantum Indistinguishability for Public Key Encryption
[article]
2021
arXiv
pre-print
Boneh and Zhandry (CRYPTO'13) initiated this research area for PKE and symmetric key encryption (SKE), albeit restricted to a classical indistinguishability phase. Gagliardoni et al. ...
In this work we study the quantum security of public key encryption schemes (PKE). ...
The authors also thank Cecilia Boschini and Marc Fischlin for helpful discussions regarding the correctness of public key encryption schemes and Andreas Hülsing for general discussions on the content of ...
arXiv:2003.00578v5
fatcat:jeeomm7oy5bo7asdlnxqebaurq
Formal Models and Techniques for Analyzing Security Protocols: A Tutorial
2014
Foundations and Trends® in Programming Languages
They are for instance used to secure electronic payments, home banking and more recently electronic elections. ...
Security protocols are distributed programs that aim at securing communications by the means of cryptography. ...
We also thank the editors for their suggestion to write this tutorial and their patience and support until it came to a final version. ...
doi:10.1561/2500000001
fatcat:wzzskipj3zeczkge42wiimt7ja
« Previous
Showing results 1 — 15 out of 52 results