Filters








38 Hits in 4.4 sec

Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions [chapter]

Ilan Komargodski, Moni Naor, Eylon Yogev
2018 Lecture Notes in Computer Science  
A collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find a collision, i.e. a x 1 = x 2 s.t. h(x 1 ) = h(x 2 ).  ...  Collision resistant hash functions are one of the more useful cryptographic primitives both in theory and in practice and two prominent applications are in signature schemes and succinct zero-knowledge  ...  Acknowledgments We are grateful to Noga Ron-Zewi for telling us about list-recoverable codes, for multiple useful discussions, and for sharing with us a preliminary version of [HRZW17] .  ... 
doi:10.1007/978-3-319-78375-8_6 fatcat:ikqwey5xpff55nysmvvu7nmvd4

A Revised Attack Taxonomy for a New Generation of Smart Attacks

Robert Koch, Mario Golling, Gabi Dreo Rodosek
2014 Computer and Information Science  
Department of Defense, this publication starts with defining the terms, primarily the group of Smart Attacks.  ...  Collision attacks, in which two different sources of plaintext generate identical cryptographic hashes, have long been theorized, but Flame is the first known example of an MD5 collision attack being actively  ...  Because current taxonomies were not able to represent and analyse the special characteristics of Smart Attacks, we proposed a new taxonomy for dealing with a new generation of Smart Attacks.  ... 
doi:10.5539/cis.v7n3p18 fatcat:xwux5bn4izgapfq2arq5b42h64

Lizard: Cut Off the Tail! A Practical Post-quantum Public-Key Encryption from LWE and LWR [chapter]

Jung Hee Cheon, Duhyeong Kim, Joohee Lee, Yongsoo Song
2018 Lecture Notes in Computer Science  
The Learning with Errors (LWE) is one of the most promising primitive for post-quantum cryptography due to its strong security reduction from the worst-case of NP-hard problems and its lightweight operations  ...  The Public Key Encryption (PKE) scheme based on LWE has a simple and fast decryption, but its encryption is rather slow due to large parameter sizes for Leftover Hash Lemma or expensive Gaussian samplings  ...  The authors would like to thank Leo Ducas, Andrey Kim, Kyoohyung Han, Junbeom Shin, and Estsoft for valuable discussions.  ... 
doi:10.1007/978-3-319-98113-0_9 fatcat:iois4ha23ndnncav35gtuiuxam

A Secure Submission System for Online Whistleblowing Platforms [article]

Volker Roth, Benjamin Güldenring, Eleanor Rieffel, Sven Dietrich, Lars Ries
2013 arXiv   pre-print
Its back-end design assures that AdLeaks must process only a fraction of the resulting traffic in order to receive disclosures with high probability.  ...  Such a whistleblower's browser replaces the output with encrypted information so that the transmission is indistinguishable from that of a regular browser.  ...  An abridged version of this paper has been accepted for publication in the proceedings of Financial Cryptography and Data Security 2013 [33] .  ... 
arXiv:1301.6263v1 fatcat:qrivixvi4vf7znupssp6uhvkwa

A Secure Submission System for Online Whistleblowing Platforms [chapter]

Volker Roth, Benjamin Güldenring, Eleanor Rieffel, Sven Dietrich, Lars Ries
2013 Lecture Notes in Computer Science  
Its back-end design assures that AdLeaks must process only a fraction of the resulting traffic in order to receive disclosures with high probability.  ...  Such a whistleblower's browser replaces the output with encrypted information so that the transmission is indistinguishable from that of a regular browser.  ...  An abridged version of this paper has been accepted for publication in the proceedings of Financial Cryptography and Data Security 2013 [33] .  ... 
doi:10.1007/978-3-642-39884-1_30 fatcat:t55ihk5tpfdaxcst7rjrznaepi

Journal of Internet Banking and Commerce BLOCKCHAIN: BITCOIN WALLET CRYPTOGRAPHY SECURITY, CHALLENGES AND COUNTERMEASURES

Er-Rajy Latifa, E Kiram, M Ahemed, Morocco El, Ghazouani Mohamed
2017 Journal of Internet Banking and Commerce   unpublished
The problem with slow confirmations is combined with the semantics of the confirmations which are not definitive, requiring several confirmations and further delaying the transaction acceptance.  ...  Moreover, For Bitcoin enhancements and additional mitigations we provide ideas for node auditing users in the network in aim to keep clients from the trusted transaction branch database generated by the  ...  Buldas and Laur have shown that, to build a secure timestamping service, the hash functions used on the server side need not be resistant to collisions, resistant to preimages and not only one-way [35  ... 
fatcat:fzh5q2u47fewljmd23jynvyhhm

Applied cryptography: Protocols, algorithms, and source code in C

1994 Computer Law and Security Review  
After all of this, a, b, c, and d are added to A, B, C, D, respectively, and the algorithm continues with the next block of data. The final output is the concatenation of A, B, C, and D.  ...  Would you send a stranger a pile of cash to buy groceries for you? Would you play poker with someone if you couldn't see him shuffle and deal?  ...  Additionally, there should be some mechanism for dealing with people who can't promptly return the timestamp. Some subset of k is all that would be required for a valid timestamp.  ... 
doi:10.1016/0267-3649(94)90017-5 fatcat:y5tchirflfdwno7dm4dv6ljx2a

Security Issues in Ubiquitous Computing* [chapter]

Frank Stajano
2010 Handbook of Ambient Intelligence and Smart Environments  
Acknowledgements This chapter is based on copyrighted material from my book Security for Ubiquitous Computing (both from the first edition published by Wiley in 2002 and from the draft  ...  When a reader asks tags in range to respond with the next bit of their code, if there is no collision then the bit common to all the tags that responded is a secret for the remote eavesdropper.  ...  Note that the Assassination principle implies that a duckling-compliant device must be endowed with some appropriate amount of tamper resistance.  ... 
doi:10.1007/978-0-387-93808-0_11 fatcat:avldavvpmrgqhamk6ewpck7k7y

Continuous and secure monitoring of biometric sensors in distributed environments [article]

Theodoros Kampouris, University Of Thessaly, Alexandros Papanikolaou
2020
Collision resistant hash function (CRHF) A collision resistant hash function is a function h satisfying the following conditions: • The description of h must be publicly known and should not require any  ...  is "hard" to find a message X = X such that h(X ) = h(X). • The hash function must be collision resistant: this means that it is "hard" to find two distinct messages that hash to the same result (PRENEEL  ... 
doi:10.26253/heal.uth.8882 fatcat:ukigdkbp6rekte5qewncdong6a

The RSA and Rabin cryptosystems [chapter]

Steven D. Galbraith
Mathematics of Public Key Cryptography  
One can make this provable using the AKS method, with asymptotic complexity O(κ 5+o(1) ) bit operations using fast arithmetic.  ...  We also present some security arguments and techniques for efficient implementation. Throughout the chapter we take 3072 bits as the benchmark length for an RSA modulus.  ...  For digital signatures we always sign a hash of the message, and it is necessary that the hash function used in signatures is collision resistant.  ... 
doi:10.1017/cbo9781139012843.025 fatcat:szplsw27njdabbherrdi7tfiw4

Java Cryptography

Jonathan Knudsen
1999 EDPACS: The EDP Audit, Control, and Security Newsletter  
If you work with sensitive data, you'll find this book indispensable.  ...  MD5 has recently been found to have some weaknesses in its collision resistance, which normally prevents an attacker from finding two messages with the same digest.  ...  Classes that deal with the latter case implement this interface, which is used strictly for type identification.  ... 
doi:10.1201/1079/43250.27.4.19991001/30275.5 fatcat:exerh23znrh4rbwwwfwk3nivry

Trustworthy Cloud Storage

Maxime Augier
2016
Acknowledgements Acknowledgements We thank Peter Eckersley from EFF for his invaluable assistance and Don Johnson for pointing out [Joh99] to us.  ...  We thus deal with a series of sets of solutions, for which all solutions in the same set are located at the same depth in the tree.  ...  For smaller tree-sizes s is larger, for larger trees multiple occurrence of moduli is more common.  ... 
doi:10.5075/epfl-thesis-6976 fatcat:kbemxzjulbdlpmmfn3hyssffxy

Finding our way: On the sharing and reuse of animal telemetry data in Australasia

Hamish A. Campbell, Hawthorne L. Beyer, Todd E. Dennis, Ross G. Dwyer, James D. Forester, Yusuke Fukuda, Catherine Lynch, Mark A. Hindell, Norbert Menke, Juan M. Morales, Craig Richardson, Essie Rodgers (+3 others)
2015 Science of the Total Environment  
The original Project Solarium was a competitive strategy development process that is credited with helping articulate several pillars of American Cold War strategy.  ...  Revised papers from the commissioned authors are included along with a new strategy paper by CNAS authors that was informed, in part, by the papers and the conference.  ...  Over the summer of 1953, President Eisenhower tasked multiple teams with articulating strategic options for dealing with the Soviet Union.  ... 
doi:10.1016/j.scitotenv.2015.01.089 pmid:25669144 fatcat:6d6hd3rl3navhjxv5d45jdoniq

The therapeutic community

D. H. Clark
1977 British Journal of Psychiatry  
How do you deal with them? In most cases with multiple rather than singular leadership, even in the family.  ...  a head-on collision with hierarchies, power, money, and so on.  ... 
doi:10.1192/bjp.131.6.553 pmid:339983 fatcat:4iaul23orrfwbcldfpfkk4paiu

Biometrics & [and] Security:Combining Fingerprints, Smart Cards and Cryptography

Claude Barral
2010
Hashing is a one-way function (i.e. irreversible: one can't retrieve the message from its hash value) and is ideally collision-free (i.e. two different messages can't have the same hash value).  ...  Moreover this approach would for sure results in a very high FRR or FTE in a system having to deal with elder people, manual workers and so on.  ...  Coming from pure biometricians, this interesting technique however lacks cryptographically proven irreversibility and general security (e.g. collision resistance).  ... 
doi:10.5075/epfl-thesis-4748 fatcat:jhoo5maeebcnjm5yf4nypv4y74
« Previous Showing results 1 — 15 out of 38 results