Filters








28,611 Hits in 4.6 sec

Mode-Level vs. Implementation-Level Physical Security in Symmetric Cryptography: A Practical Guide Through the Leakage-Resistance Jungle [article]

Davide Bellizia, Olivier Bronchain, Gaëtan Cassiers, Vincent Grosso, Chun Guo, Charles Momin, Olivier Pereira, Thomas Peters, François-Xavier Standaert
2020 IACR Cryptology ePrint Archive  
requirements to guarantee confidentiality and integrity in front of leakage can be concretely different for the different parts of an implementation.  ...  Thanks to this (heuristic) translation, we observe that (i) security against physical attacks can be viewed as a tradeoff between mode-level and implementationlevel protection mechanisms, and (ii) security  ...  It enables strong composition results similar to the ones obtained without leakage, strong security against nonce misuse (i.e., misuse-resistance in the sense of Rogaway and Shrimpton [80] ) and has been  ... 
dblp:journals/iacr/BelliziaBCGGMPP20 fatcat:lzjczutcmvhtbidq6n2o6cszui

A metadata calculus for secure information sharing

Mudhakar Srivatsa, Dakshi Agrawal, Steffen Reidt
2009 Proceedings of the 16th ACM conference on Computer and communications security - CCS '09  
We model security metadata as a vector half-space (as against a lattice in a MLS-like approach) that supports three operators: Γ, + and ·.  ...  tightness of values estimates in the proposed approach.  ...  Army Research Laboratory and the U.K. Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001.  ... 
doi:10.1145/1653662.1653721 dblp:conf/ccs/SrivatsaAR09 fatcat:fh7gltuolvekfhrzun2rpqmtri

Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions [chapter]

Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi, Berk Sunar, Pim Tuyls
2010 Information Security and Cryptography  
PUFs enjoy their security from physical structures at submicron level and are very useful primitives to protect against memory attacks.  ...  We construct a block cipher based on PUF-PRFs that allows simultaneous protection against algorithmic and physical attackers, in particular against memory attacks.  ...  Acknowledgements We thank Stefan Lucks for fruitful comments and discussions. The work described in this paper has been supported  ... 
doi:10.1007/978-3-642-14452-3_6 dblp:series/isc/ArmknechtMSST10 fatcat:676z7f56arfo5b7viqnlcdmdlu

Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions [chapter]

Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi, Berk Sunar, Pim Tuyls
2009 Lecture Notes in Computer Science  
PUFs enjoy their security from physical structures at submicron level and are very useful primitives to protect against memory attacks.  ...  We construct a block cipher based on PUF-PRFs that allows simultaneous protection against algorithmic and physical attackers, in particular against memory attacks.  ...  Acknowledgements We thank Stefan Lucks for fruitful comments and discussions. The work described in this paper has been supported  ... 
doi:10.1007/978-3-642-10366-7_40 fatcat:3h5uf4q6yrghrfsgrn42qgfhga

Masking Proofs Are Tight and How to Exploit it in Security Evaluations [chapter]

Vincent Grosso, François-Xavier Standaert
2018 Lecture Notes in Computer Science  
Evaluating the security level of a leaking implementation against side-channel attacks is a challenging task.  ...  In this paper, we show that by taking advantage of the tightness of masking security proofs, we can significantly simplify this evaluation task in a very general manner.  ...  These works suggest that physical security via masking has strong analogies with the case of linear cryptanalysis.  ... 
doi:10.1007/978-3-319-78375-8_13 fatcat:7nfrs7mc2jh35ovsjw7m6suqay

New approaches to security and availability for cloud data

Ari Juels, Alina Oprea
2013 Communications of the ACM  
Iris offers strong integrity and freshness guarantees of both file system data and meta-data accessed while users perform file system operations.  ...  Two stand out as particularly important: integrity, meaning assurance against data tampering, and freshness, the guarantee that retrieved data reflects the latest updates.  ... 
doi:10.1145/2408776.2408793 fatcat:bikcezie4zegpocmqhw6r2fvsu

Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups [chapter]

Benoît Libert, Jean-Jacques Quisquater
2004 Lecture Notes in Computer Science  
The new scheme is also shown to satisfy really strong security notions and its strong unforgeability is tightly related to the Diffie-Hellman assumption in Gap Diffie-Hellman groups. 1.  ...  The challenger generates two key pairs (sk R,0 , pk R,0 ) and (sk R,1 , pk R,1 ). pk R,0 and pk R,1 are given to the distinguisher D.  ...  We proposed a new Diffie-Hellman based signcryption scheme satisfying strong security requirements.  ... 
doi:10.1007/978-3-540-24632-9_14 fatcat:6fcwug4sunashnppkjxqrk764q

XOR of PRPs in a Quantum World [chapter]

Bart Mennink, Alan Szepieniec
2017 Lecture Notes in Computer Science  
The analysis relies on a generic characterization of classical and quantum distinguishers and a universal transformation of classical security proofs to the quantum setting that is of general interest.  ...  We investigate security of this construction against adversaries who have access to quantum computers. We first present a key recovery attack in |K| r/(r+1) complexity.  ...  The PRP-PRF-switch only guarantees tight birthday bound security: security up to min{|K|, |X| 1/2 } queries [7, 8, 20, 23] . The same bound applies to counter mode.  ... 
doi:10.1007/978-3-319-59879-6_21 fatcat:7cae3w7j3reefes4sfmv2i3ewy

Randen - fast backtracking-resistant random generator with AES+Feistel+Reverie [article]

Jan Wassenberg, Robert Obryk, Jyrki Alakuijala, Emmanuel Mogenet
2018 arXiv   pre-print
To protect non-cryptographic applications against such attacks, we propose 'strong' pseudorandom generators characterized by two properties: computationally indistinguishable from random and backtracking-resistant  ...  We introduce a new open-sourced generator called 'Randen' and show that it is 'strong' in addition to outperforming Mersenne Twister, PCG, ChaCha8, ISAAC and Philox in real-world benchmarks.  ...  What security guarantees can we provide? In this paper, a 'strong' generator is characterized by two properties: computational indistinguishability from random, and backtracking resistance.  ... 
arXiv:1810.02227v1 fatcat:ocbjk47j6re4vgqwdvlo7nl46u

Hardware Intrinsic Security from Physically Unclonable Functions [chapter]

Helena Handschuh, Geert-Jan Schrijen, Pim Tuyls
2010 Information Security and Cryptography  
Its stability with respect to external stresses is guaranteed by tight integration with the processing component. In Fig. 3 , a schematic overview of a Butterfly PUF cell is shown.  ...  Tamper Evidence PUFs provide very strong protection against physical attacks and are therefore very well suited to implement read-proof hardware.  ... 
doi:10.1007/978-3-642-14452-3_2 dblp:series/isc/HandschuhST10 fatcat:rbp3t3t5kvanre2n4emwdsbzki

The road to trustworthy systems

Gernot Heiser, June Andronick, Kevin Elphinstone, Gerwin Klein, Ihor Kuz, Leonid Ryzhyk
2010 Proceedings of the fifth ACM workshop on Scalable trusted computing - STC '10  
Computer systems are routinely deployed in life-and missioncritical situations, yet in most cases their security, safety or dependability cannot be assured to the degree warranted by the application.  ...  We report on what has been achieved to date, and what our plans are for the next 3-5 years.  ...  Acknowledgements NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council through the ICT Centre  ... 
doi:10.1145/1867635.1867638 fatcat:2c4qtcehivb7jgi3aj5s2k2v7a

A SECURE DATA FORWARDING SCHEMA FOR CLOUD STORAGE SYSTEMS

G.CHINNA PULLAIAH, DILIP VENKATA KUMAR VENGALA
2013 International Journal of Smart Sensor and Adhoc Network.  
Extensive security and performance analysis show that the proposed schemes are highly efficient and provably secure.  ...  The distributed storage system not only supports secure and robust data storage and retrieval, but also lets a user forward his data in the storage servers to another user without retrieving the data back  ...  This kind of proxy re-encryption schemes provides higher privacy guarantee against proxy servers.  ... 
doi:10.47893/ijssan.2013.1187 fatcat:oipnzxkw6vbuvolekrhbpcj7ke

Symmetric Cryptography (Dagstuhl Seminar 18021)

Joan Daemen, Tetsu Iwata, Nils Gregor Leander, Kaisa Nyberg, Michael Wagner
2018 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 18021 "Symmetric  ...  I wish to thank Eli Biham for discussions related to conditional linear cryptanalysis and Céline Blondeau for suggestions how to improve the presentation.  ...  We first discussed some inherent limitations and restrictions before showing a first attempt how the framework could be instantiated. Instantiating the Whitened Swap-Or-Not Construction  ... 
doi:10.4230/dagrep.8.1.1 dblp:journals/dagstuhl-reports/DaemenILN18 fatcat:qffcmfhvu5bappymycvy5pbxvy

Toward secure distributed spectrum sensing in cognitive radio networks

Ruiliang Chen, Jung-Min Park, Y.T. Hou, J.H. Reed
2008 IEEE Communications Magazine  
Specifically, we focus on two security threats-incumbent emulation and spectrum sensing data falsification-that may wreak havoc in distributed spectrum sensing.  ...  In this paper, we discuss security issues that may pose a serious threat to spectrum sensing.  ...  Second, both techniques cannot guarantee both a bounded false alarm probability and a bounded miss detection probability.  ... 
doi:10.1109/mcom.2008.4481340 fatcat:pr3lycfypjdevdjlsk5hdwrw4e

Versatile padding schemes for joint signature and encryption

Yevgeniy Dodis, Michael J. Freedman, Stanislaw Jarecki, Shabsi Walfish
2004 Proceedings of the 11th ACM conference on Computer and communications security - CCS '04  
We build a general and flexible framework for the design and analysis of secure Feistelbased padding schemes, as well as three composition paradigms for using such paddings to build optimized signcryption  ...  All our signcryption schemes, built directly from trapdoor permutations such as RSA, share features such as simplicity, efficiency, generality, near-optimal exact security, flexible and ad-hoc key management  ...  In contrast, we commit to m once and then apply a deterministic, length-preserving Feistel Transform to obtain the required w and s. Moreover, we are guaranteed to always obtain tight exact security.  ... 
doi:10.1145/1030083.1030129 dblp:conf/ccs/DodisFJW04 fatcat:zkv427awmjc2vk63gd6mvmw37y
« Previous Showing results 1 — 15 out of 28,611 results