Filters








8,659 Hits in 4.8 sec

Provable Cryptographic Security and its Applications to Mobile Wireless Computing

Craig Gentry, Zulfikar Ramzan
2004 Wireless personal communications  
Unfortunately, the concept of "provable security" is often misunderstood. In this survey paper, we state precisely what provable security is and is not, and describe the benefits of the approach.  ...  By designing provably secure algorithms and protocols, we not only minimize the time required to gain confidence in the security of a system, but we virtually eliminate the possibility of a cryptographic  ...  A new cryptographic protocol inspires instant confidence if its security is provably based on factoring.  ... 
doi:10.1023/b:wire.0000047062.69722.82 fatcat:7tesxbvujrcspijxvb2cbhoto4

Provable Secured Hash Password Authentication

T.S. Thangavel, A. Krishnan
2010 International Journal of Computer Applications  
The proposed techniques are designed to transparently provide novice users with the benefits of password practices that are otherwise only feasible for security experts.  ...  This work developed an improved secure hash function, whose security is directly related to the syndrome decoding problem from the theory of error-correcting codes.  ...  Using this function with a random matrix instead of the usual parity check matrix of a Goppa code, a provably secure one-way function has been constructed since there is no trapdoor, its security can be  ... 
doi:10.5120/406-602 fatcat:c7nqvntt7ffcrh3clbuy3b26xu

Another Look at Provable Security [chapter]

Alfred Menezes
2012 Lecture Notes in Computer Science  
We give an informal analysis and critique of several typical "provable security" results.  ...  Because our paper is aimed at the general mathematical public, it is self-contained and as jargon-free as possible.  ...  This means that it is not feasible to find any pair m, m such that H(m) = H(m ).  ... 
doi:10.1007/978-3-642-29011-4_2 fatcat:2ellu74n55bxrbr3ka7fk2thre

Another Look at "Provable Security"

Neal Koblitz, Alfred J. Menezes
2005 Journal of Cryptology  
We give an informal analysis and critique of several typical "provable security" results.  ...  Because our paper is aimed at the general mathematical public, it is self-contained and as jargon-free as possible.  ...  This means that it is not feasible to find any pair m, m such that H(m) = H(m ).  ... 
doi:10.1007/s00145-005-0432-z fatcat:7cnlak7isjhn7enzjqdpm7sdbi

Robustly Safe Compilation or, Efficient, Provably Secure Compilation [article]

Marco Patrignani, Deepak Garg
2020 arXiv   pre-print
Through these, we also establish that proving RSC is simpler than proving fully abstraction.  ...  We show that RSC can be attained easily and results in code that is more efficient than that generated by fully abstract compilers.  ...  While such compilation is feasible, it is at odds with our view of monitors as specifications of safety properties.  ... 
arXiv:1804.00489v5 fatcat:z3qxgvihyngdhj5kllgysi7kne

Provable Security for PKI Schemes [article]

Hemi Leibowitz, Amir Herzberg, Ewa Syta
2019 IACR Cryptology ePrint Archive  
Finally, we use our specifications to formalize and prove X.509 version 2 PKI, showing that provable security is achievable for 'real' PKI designs.  ...  Achieving provable security for PKI is necessary and long overdue, as PKI provides the foundation for important applications of public key cryptography, such as TLS/SSL.  ...  PROVABLY-SECURE PKI: X.509 VERSION 2 To demonstrate the feasibility of our approach, we formalized and analyzed X.509 version 2 (X.509v2), a simple yet realistic PKI scheme.  ... 
dblp:journals/iacr/LeibowitzHS19 fatcat:wkwzr7kdajhezhoi4kmpqbv7ri

Another Look at "Provable Security". II [chapter]

Neal Koblitz, Alfred Menezes
2006 Lecture Notes in Computer Science  
We discuss the question of how to interpret reduction arguments in cryptography. We give some examples to show the subtlety and difficulty of this question.  ...  Acknowledgments We would like to thank Andrey Sidorenko for his valuable comments on pseudorandom bit generators and Bart Preneel for answering our queries about the provable security of MAC algorithms  ...  Is it more secure to do the padding before or after hashing? What do the available "provable security" results tell us about this question?  ... 
doi:10.1007/11941378_12 fatcat:fatlcjwmj5gdthxhx7pylbn3li

Towards Provable Security for Ubiquitous Applications [chapter]

Mike Burmester, Tri Van Le, Breno de Medeiros
2006 Lecture Notes in Computer Science  
We articulate a formal security framework that is tuned for the analysis of protocols for constrained systems and show how this can be used with applications that involve MANET and RFID systems.  ...  In our approach we shall use optimistic protocols for which the overhead is minimal when the adversary is passive.  ...  It is our goal is to design protocols for RFID applications that: 1. are provably secure under formal simulation frameworks that capture the behavior of honest and adversarial parties, and that articulate  ... 
doi:10.1007/11780656_25 fatcat:dcj6wxvgerekbfihi7727jaa5m

Towards provable secure neighbor discovery in wireless networks

Marcin Poturalski, Panos Papadimitratos, Jean-Pierre Hubaux
2008 Proceedings of the 6th ACM workshop on Formal methods in security engineering - FMSE '08  
As we are particularly concerned with the practicality of provably secure ND protocols, we investigate availability and redefine accordingly the ND specification, and also consider composability of ND  ...  In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of  ...  CONCLUSIONS In this paper, we investigate how to analyze and design provably secure ND protocols, building on top of the framework introduced in [24] .  ... 
doi:10.1145/1456396.1456400 dblp:conf/ccs/PoturalskiPH08a fatcat:c3xng4yfdvgobigfrk7crwkdmu

Dynamic Provable Data Possession

C. Chris Erway, Alptekin Küpçü, Charalampos Papamanthou, Roberto Tamassia
2015 ACM Transactions on Privacy and Security  
In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of meta-data.  ...  We also show how to apply our DPDP scheme to outsourced file systems and version control systems (e.g., CVS).  ...  Acknowledgments A preliminary version of this work appeared in the 16th ACM Conference on Computer and Communications Security (ACM CCS 2009) [Erway et al. 2009 ]. Work supported in part by the U.S.  ... 
doi:10.1145/2699909 fatcat:ih3gjwgi5bcdjkeoiwgtzey2vi

Fundamental problems in provable security and cryptography

A. W Dent
2006 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
We also present a new approach to one of the more controversial aspects of provable security: the random oracle model.  ...  This paper examines methods for formally proving the security of cryptographic schemes.  ...  However, a security proof in a game-based security model makes no claims about how secure a scheme is when it is placed in the context of a larger system.  ... 
doi:10.1098/rsta.2006.1895 pmid:17090456 fatcat:kbia7avak5dvpl5tgh7h66eosu

Dynamic provable data possession

Chris Erway, Alptekin Küpçü, Charalampos Papamanthou, Roberto Tamassia
2009 Proceedings of the 16th ACM conference on Computer and communications security - CCS '09  
In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of metadata.  ...  We also show how to apply our DPDP scheme to outsourced file systems and version control systems (e.g., CVS).  ...  Using the above provably secure authenticated data structure based on [25] to secure the tags (where security is based on the strong RSA assumption), we obtain the following result: Note that sending  ... 
doi:10.1145/1653662.1653688 dblp:conf/ccs/ErwayKPT09 fatcat:7oknmdy7grenhoua4zrfiujy2i

Towards Provable Secure Neighbor Discovery in Wireless Networks [article]

Marcin Poturalski, Panos Papadimitratos, Jean-Pierre Hubaux
2008 arXiv   pre-print
As we are particularly concerned with the practicality of provably secure ND protocols, we investigate availability and redefine accordingly the ND specification, and also consider composability of ND  ...  In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of  ...  CONCLUSIONS In this paper, we investigate how to analyze and design provably secure ND protocols, building on top of the framework introduced in [24] .  ... 
arXiv:0808.2586v1 fatcat:ujtkkdvukvbs7jg6u6kvk4qpcy

DetectorGuard: Provably Securing Object Detectors against Localized Patch Hiding Attacks [article]

Chong Xiang, Prateek Mittal
2021 arXiv   pre-print
If all objectness is well explained, we output the predictions made by the conventional object detector; otherwise, we issue an attack alert.  ...  ., it either detects the object or triggers an alert, against any patch hiding attacker within our threat model; 2) in the clean setting, we have almost the same performance as state-of-the-art object  ...  How to secure object detection is a much less studied area due to the complexity of this task. Saha et al.  ... 
arXiv:2102.02956v3 fatcat:ds2f6iffmnb47otjoa43q4drne

DeepSecure: Scalable Provably-Secure Deep Learning [article]

Bita Darvish Rouhani, M. Sadegh Riazi, Farinaz Koushanfar
2017 arXiv   pre-print
The secure DL computation in DeepSecure is performed using Yao's Garbled Circuit (GC) protocol. We devise GC-optimized realization of various components used in DL.  ...  Our framework is the first to empower accurate and scalable DL analysis of data generated by distributed clients without sacrificing the security to maintain efficiency.  ...  Note that using conventional GC protocol, it is not feasible to skip the multiplication/addition in evaluating a particular neural (unit) in a DL model.  ... 
arXiv:1705.08963v1 fatcat:c2v2pnrt6jgvzm2y7mpitk62su
« Previous Showing results 1 — 15 out of 8,659 results