18 Hits in 3.7 sec

On the Provable Security of the Dragonfly Protocol [chapter]

Jean Lancrenon, Marjan Škrobot
2015 Lecture Notes in Computer Science  
Section 3 contains a description of the version of Dragonfly Dragonfly we analyze, while the description of the original Dragonfly protocol from [12] can be found in the appendix.  ...  In this paper, we prove the security of a very close variant of Dragonfly Dragonfly in the random oracle model.  ...  We thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1007/978-3-319-23318-5_14 fatcat:xbrir56lwjg7pgc7abv4bgcedq

SoK: Password-Authenticated Key Exchange - Theory, Practice, Standardization and Real-World Lessons [article]

Feng Hao, Paul C. van Oorschot
2021 IACR Cryptology ePrint Archive  
We provide a thorough and systematic review of the field, a summary of the state-of-the-art, a taxonomy to categorize existing protocols, and a comparative analysis of protocol performance using representative  ...  Challenges have included contrasts between heuristic protocols and schemes with security proofs, and subtleties in the assumptions of such proofs rendering some schemes unsuitable for practice.  ...  Of the many provable secure PAKE protocols proposed, why are so few used in practice?  ... 
dblp:journals/iacr/HaoO21 fatcat:sxnpw4g2gnc3xajsj3t6wtkhei

Tightly-Secure PAK(E) [chapter]

José Becerra, Vincenzo Iovino, Dimiter Ostrev, Petra Šala, Marjan Škrobot
2018 Lecture Notes in Computer Science  
Our proof is the first to show that the PAK protocol can provide meaningful security guarantees for values of the parameters typical in today's world.  ...  We discuss the implications of our results for concrete security.  ...  ACKNOWLEDGEMENTS We would like to thank the anonymous referees for their comments.  ... 
doi:10.1007/978-3-030-02641-7_2 fatcat:fwm55pakffhczmf6cwr4npj55i

On Composability of Game-Based Password Authenticated Key Exchange

Marjan Skrobot, Jean Lancrenon
2018 2018 IEEE European Symposium on Security and Privacy (EuroS&P)  
of composition, one that at least covers the case of implementing secure channels.  ...  More specifically, we show that PAKE protocols secure according to the game-based Real-or-Random (RoR) definition with the weak forward secrecy of Abdalla et al.  ...  SYM security. The definition of sym-security depends on the protocol in use.  ... 
doi:10.1109/eurosp.2018.00038 dblp:conf/eurosp/SkrobotL18 fatcat:dnuvsyegvrb4xe6wuon734z7le

Two More Efficient Variants of the J-PAKE Protocol [chapter]

Jean Lancrenon, Marjan Škrobot, Qiang Tang
2016 Lecture Notes in Computer Science  
Recently, the password-authenticated key exchange protocol J-PAKE of Hao and Ryan (Workshop on Security Protocols 2008) was formally proven secure in the algebraic adversary model by Abdalla et al.  ...  We show that they are provably secure following a similar strategy to that of Abdalla et al.  ...  The third author is also supported by the University of Luxembourg in an internal project REQUISITE. We want to thank Husen Wang for his help with respect to the EC instantiation in Section 2.4.  ... 
doi:10.1007/978-3-319-39555-5_4 fatcat:rjr3mwwqpravjpxxhxrrdnpndy

AME Blockchain: An Architecture Design for Closed-Loop Fluid Economy Token System [article]

Lanny Z.N. Yuan, Huaibing Jian, Peng Liu, Pengxin Zhu, ShanYang Fu
2018 arXiv   pre-print
To properly provide a cohesive, concise, yet comprehensive introduction to the AME system, we mainly focus on describing the unique definitions and features that guide the system implementation.  ...  In this white paper, we propose a blockchain-based system, named AME, which is a decentralized infrastructure and application platform with enhanced security and self-management properties.  ...  as compactness, efficiency and provable security, etc.  ... 
arXiv:1812.08017v1 fatcat:m2tgekvu2jcnnbhxssob4xgh7i

Industrial and Critical Infrastructure Security: Technical Analysis of Real-Life Security Incidents

Georgios Michail Makrakis, Constantinos Kolias, Georgios Kambourakis, Craig Rieger, Jacob Benjamin
2021 IEEE Access  
We provide a categorization of such threats and the corresponding vulnerabilities based on various criteria.  ...  Furthermore, our survey exposes that existing vulnerabilities in the design and implementation of several of the OTspecific network protocols and devices may easily grant adversaries the ability to decisively  ...  [22] discuss the security of SCADA communication protocols.  ... 
doi:10.1109/access.2021.3133348 fatcat:jcjpkvwmibh4tbdltwtugfknli

Efficiently Computing Data-Independent Memory-Hard Functions [chapter]

Joël Alwen, Jeremiah Blocki
2016 Lecture Notes in Computer Science  
Next we instantiate our attack for several general classes of DAGs which include those underlying many of the most important iMHF candidates in the literature.  ...  A data-independent MHF (iMHF) has the added property that it can be computed with almost optimal memory and time complexity by an algorithm which accesses memory in a pattern independent of the input value  ...  A Provably Secure MHF. Currently, the only candidate MHF equipped with a full proof of security is the one in [AS15] .  ... 
doi:10.1007/978-3-662-53008-5_9 fatcat:mmemp2rvkzhwljr3i7xbk3lqqi

CRISP: Compromise Resilient Identity-based Symmetric PAKE [article]

Moni Naor, Shahar Paz, Eyal Ronen
2020 IACR Cryptology ePrint Archive  
We propose stronger counterparts to state-of-the-art security notions from the asymmetric setting in the UC model, and construct protocols that provably realize them.  ...  We evaluate prototype implementations of our protocols and show that even though they offer stronger security, their performance is in line with, or even better than, state-of-the-art protocols.  ...  -2 and WPA3's DragonFly/SAE.  ... 
dblp:journals/iacr/NaorPR20 fatcat:mqwagfb5brc7xddndkctzyt4km

ETP4HPC's Strategic Research Agenda for High-Performance Computing in Europe 4 [article]

Michael Malms, Marcin Ostasz, Maike Gilliot, Pascale Bernier-Bruna, Laurent Cargemel, Estela Suarez, Herbert Cornelius, Marc Duranton, Benny Koren, Pascale Rosse-Laurent, María S. Pérez-Hernández, Manolis Marazakis (+11 others)
2020 Zenodo  
It continues the tradition of a structured approach to the identification of key research objectives.  ...  The main objective of this SRA is to identify the European technology research priorities in the area of HPC and High-Performance Data Analytics (HPDA), which should be used by EuroHPC to build its 2021  ...  of both standard and proprietary interfaces and protocols (e.g.  ... 
doi:10.5281/zenodo.4605343 fatcat:lcsgbea5dzgdfmj5dkw6pr7vni

Analysis of Bulk Power System Resilience Using Vulnerability Graph

Md Ariful Haque
This thesis focuses on the resilience analysis of BPS and proposes a ranking algorithm to identify critical nodes in the network.  ...  This can help security analysts and power system operators in the decision-making process.  ...  Some of those are discussed below. The NVD is the U.S. government repository of standards based vulnerability management data represented using the Security Content Automation Protocol (SCAP) [75] .  ... 
doi:10.25777/fqw2-xv37 fatcat:pusrzngpn5b3tfeoes3n3uqsui

"I Am Like the Unicorn": Desiring Language [chapter]

Vincent van Gerven Oei
Whoever loves it like the philologist, loves the love in it", Werner Hamacher suggests in a reading of the scene. is philological text attempts to trace the reins set on this love throughout a certain  ...  "Plato's 'philologist' is a friend and lover of language as that which is the language of love and self-loving language. [...] Language loves.  ...  (a) 9 = the number of planets. (b) It is provable that in arithmetic that 9 is not prime.  ... 
doi:10.17613/m6gb5t fatcat:3xiwoq6vyvaxtj3w6eam5cpq3u

Dagstuhl Reports, Volume 5, Issue 10, October 2015, Complete Issue [article]

In future scenarios for transport in Smart Cities, mobility providers might control the routes taken by a significant share of vehicles on the road.  ...  The seminar Our call for participation was exceptionally successful and right up to the actual start of the meeting we were in danger of exceeding the number of places allocated.  ...  From simple, yet not provably secure, technologies like pseudonymization to full encrypted processing with homomorphic cryptography or garbled circuits.  ... 
doi:10.4230/dagrep.5.10 fatcat:u44u5pkszbayti24uerfh3wifu

Representation is representation of similarities

Shimon Edelman
1998 Behavioral and Brain Sciences  
Advanced perceptual systems are faced with the problem of securing a principled (ideally, veridical) relationship between the world and its internal representation.  ...  Representation in terms of similarities to reference shapes supports processing (e.g., discrimination) of shapes that are radically different from the reference ones, without the need for the computationally  ...  The latter problem has to do with the very possibility of securing a principled relationship between the world and its representation.  ... 
doi:10.1017/s0140525x98001253 fatcat:ybnbqivwwnc5rdwqefit2oqlzq

Understanding Congestion in High Performance Interconnection Networks Using Sampling

Philip Adam Taffet
The computational needs of many applications outstrip the capabilities of a single compute node.  ...  Communication is necessary to employ multiple nodes, but slow communication often limits application performance on multiple nodes.  ...  Tuning the congestion control protocol parameters (see section 2.2) may also lessen the impact of one application on another.  ... 
doi:10.25611/0pec-yd57 fatcat:7yw5o2gyhzhf3loplwxj6a6nji
« Previous Showing results 1 — 15 out of 18 results