Filters








1,218 Hits in 7.5 sec

Cryptographically Sound and Machine-Assisted Verification of Security Protocols [chapter]

Michael Backes, Christian Jacobi
2003 Lecture Notes in Computer Science  
sound proof of a security protocol.  ...  We believe that a general methodology for verifying cryptographic protocols cryptographically sound can be derived by following the ideas of this example.  ...  Our goal is to link both approaches to get the best overall result: proofs of cryptographic protocols that allow abstraction and the use of formal methods, but retain a sound cryptographic semantics.  ... 
doi:10.1007/3-540-36494-3_59 fatcat:nzqjh5fhvjh3vnxqgzb5mrwe6y

The random oracle methodology, revisited

Ran Canetti, Oded Goldreich, Shai Halevi
2004 Journal of the ACM  
The main result of this paper is a negative one: There exist signature and encryption schemes that are secure in the Random Oracle Model, but for which any implementation of the random oracle results in  ...  We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by  ...  We thank Clemens Holenstein for uncovering a flaw in an earlier version of the proof of Proposition 5.5.  ... 
doi:10.1145/1008731.1008734 fatcat:i72j7bjkfzcahcytw7bwqqrd3a

Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042)

Jan Camenisch, Ralf Küsters, Anna Lysyanskaya, Alessandra Scafuro, Michael Wagner
2019 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 19042 "Practical Yet Composably Secure Cryptographic Protocols".  ...  security protocols in such a model; (3) how to prove security of protocols in such a model.  ...  Every component scheme yields a pair of a real and an ideal package.  ... 
doi:10.4230/dagrep.9.1.88 dblp:journals/dagstuhl-reports/CamenischKLS19 fatcat:j2dfgtcoxnbvtgpu7mtxdehequ

On the foundations of modern cryptography [chapter]

Oded Goldreich
1997 Lecture Notes in Computer Science  
"a signature scheme that is robust against chosen message attack cannot have a proof of security".  ...  We mention that the notion of computational indistinguishability has played a central role in the formulation of other cryptographic concepts (such as secure encryption and zero-knowledge).  ...  Bibliographic Abbreviations -STOC is ACM Symposium on the Theory of Computing. -FOeS is IEEE Symposium on Foundations of Computer Science.  ... 
doi:10.1007/bfb0052227 fatcat:g5eprxwuwncivbinj4qkonpvbe

Cryptography as the Means to Protect Fundamental Human Rights

Konstantinos Limniotis
2021 Cryptography  
This paper aims to provide a generic overview of the possible cryptographic applications that suffice to address privacy challenges.  ...  This aspect is clearly relevant to the fundamental human right of privacy, in terms of securing data from eavesdropping and tampering, as well as from masquerading their origin.  ...  Acknowledgments: The author would like to thank the anonymous reviewers for their very constructive comments and suggestions, which helped to greatly improve the manuscript.  ... 
doi:10.3390/cryptography5040034 fatcat:twql4tpkfjf4dnwvnu5jvvil4q

An Interactive Prover for Protocol Verification in the Computational Model

David Baelde, Stephanie Delaune, Charlie Jacomme, Adrien Koutsos, Solene Moreau
2021 2021 IEEE Symposium on Security and Privacy (SP)  
Given the central importance of designing secure protocols, providing solid mathematical foundations and computer-assisted methods to attest for their correctness is becoming crucial.  ...  Here, we elaborate on the formal approach introduced by Bana and Comon in [10], [11] , which was originally designed to analyze protocols for a fixed number of sessions and which more importantly lacks  ...  We have shown that it yields a simple, high-level methodology for carrying out computer-assisted proofs of cryptographic protocols, providing asymptotic security guarantees in the computational model.  ... 
doi:10.1109/sp40001.2021.00078 fatcat:uwakjv4sb5eyhpoc4m2ywr4sqm

IPDL: A Probabilistic Dataflow Logic for Cryptography [article]

Xiong Fan, Joshua Gancher, Greg Morrisett, Elaine Shi, Kristina Sojakova
2019 IACR Cryptology ePrint Archive  
Because of this, there is currently a large gap of formality between proofs of cryptographic protocols on paper and in mechanized theorem provers.  ...  Due to the novel design of our logic, we are able to deliver mechanized proofs of protocols which we believe are comprehensible to cryptographers without verification expertise.  ...  Our Contributions Our goal is to design a new technique for proving approximate equivalences of cryptographic protocols that is easy-to-use and matches the style of on-paper cryptographic proofs.  ... 
dblp:journals/iacr/FanGMSS19 fatcat:yetgnlzsobhqxj5ckyvf33etbq

Foundations of Cryptography – A Primer

Oded Goldreich
2005 Foundations and Trends® in Theoretical Computer Science  
Acknowledgments 115 116 General Cryptographic Protocols I wish to thank Minh-Huyen Nguyen for carefully reading this manuscript and pointing out various difficulties and errors.  ...  I also wish to thank Madhu Sudan and an anonymous referee for their comments.  ...  Loosely speaking, zero-knowledge proofs are proofs that yield nothing beyond the validity of the assertion.  ... 
doi:10.1561/0400000001 fatcat:qaczeoomwvh7bhu4wquga6eipi

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Oded Goldreich, Silvio Micali, Avi Wigderson
1991 Journal of the ACM  
In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated.  ...  Loosely speaking, it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula, in particular, without yielding neither a satis@ing assignment nor  ...  Special thanks to Gilles Brassard, Ariel Kahn, Hugo Krawczyk, Eyal Kushilevitz, Yair Oren, and the anonymous referees for their remarks on earlier versions of this manuscript.  ... 
doi:10.1145/116825.116852 fatcat:snodcvveqnez3c2zc5fqcyrmsm

A Model for Provably Secure Software Design

Alexander van den Berghe, Koen Yskout, Riccardo Scandariato, Wouter Joosen
2017 2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)  
Therefore, there is a need for techniques that ensure a correct application of a security design solution.  ...  We illustrate this model with a sizeable model of a banking system and show how the precise semantics of this model enables the tool-supported construction of proofs about the correctness of the applied  ...  ACKNOWLEDGMENT This research is partially funded by the Research Fund KU Leuven and the Secure Design project of the imec HI2 Distributed Trust program.  ... 
doi:10.1109/formalise.2017.6 dblp:conf/icse/BergheYSJ17 fatcat:xwwgxjdg5ber3acstnkfp33wey

Proof of All: Verifiable Computation in a Nutshell [article]

Mario Alessandro Barbara
2019 arXiv   pre-print
In this master thesis I propose a unifying Verifiable Computation model for the simplification and efficient comparison of all cryptographic proof systems.  ...  Furthermore, I expand on the future of Verifiable Computation, Universal proof compilers and "Proofs of All", by approaching the state-of-the-art zk-STARK construction from a more accessible and informal  ...  and definitions, By using a standardised model for defining protocols, researchers can attempt to merge the fragmented domain of cryptographic proofs, and thus unite their efforts under a single research  ... 
arXiv:1908.02327v2 fatcat:fdhmpzpnqfhprhijoy3zdradze

A Method for Patching Interleaving-Replay Attacks in Faulty Security Protocols

Juan Carlos Lopez Pimentel, Raul Monroy, Dieter Hutter
2007 Electronical Notes in Theoretical Computer Science  
Experience has shown that the analysis of counterexamples or failed proof attempts often holds the key to the completion of proofs and for the correction of a faulty model.  ...  Our method makes use of Abadi and Needham's principles for the prudent engineering practice for cryptographic protocols in order to guide the location of the fault in a protocol as well as the proposition  ...  The flaw in the faulty protocols that were left out from our validation test set have nothing to do with a replay attack.  ... 
doi:10.1016/j.entcs.2006.12.034 fatcat:p4oslnczmrcafoippaufapz4wu

Formally Verified Cryptographic Web Applications in WebAssembly

Jonathan Protzenko, Benjamin Beurdouche, Denis Merigoux, Karthikeyan Bhargavan
2019 2019 IEEE Symposium on Security and Privacy (SP)  
Then, we present LibSignal*, a brand new, verified implementation of the Signal protocol in WebAssembly, that can be readily used by messaging applications like WhatsApp, Skype, and Signal.  ...  The problem is that these components are often implemented in JavaScript, a language that is both hostile to cryptographic code and hard to reason about.  ...  This design choice imposes a small performance penalty during decryption, but yields protocol code that is simpler and easier to verify. Implementing the Core Protocol Functions.  ... 
doi:10.1109/sp.2019.00064 dblp:conf/sp/ProtzenkoBMB19 fatcat:jjsgr4xuk5ck3abi62qymurceu

Quantum cryptography beyond quantum key distribution

Anne Broadbent, Christian Schaffner
2015 Designs, Codes and Cryptography  
Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks.  ...  In this review article, aimed primarily at cryptographers unfamiliar with the quantum world, we survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations  ...  We also thank Ronald Mullin for his invitation to submit this paper to the 25th anniversary edition of Designs, Codes and Cryptography, and an anonymous reviewer for helpful comments.  ... 
doi:10.1007/s10623-015-0157-4 pmid:32226229 pmcid:PMC7089691 fatcat:zm7zdq4l6babtd4y5ygwmttt2q

Non-interactive Zero-knowledge for Blockchain: A Survey

Juha Partala, Tri Hong Nguyen, Susanna Pirttikangas
2020 IEEE Access  
ACKNOWLEDGEMENTS DECLARATION OF INTERESTS Declarations of interest: none  ...  For example, ZKBoo and ZKB++ have exactly the same asymptotic complexities, but ZKB++ has a proof length that is only half of that of ZKBoo.  ...  Through verifiable computing a client can verify the validity of the computation from a proof of its correctness.  ... 
doi:10.1109/access.2020.3046025 fatcat:crl77kezmbfydhtvvv6i3lrzdi
« Previous Showing results 1 — 15 out of 1,218 results