886 Hits in 7.2 sec

Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks [chapter]

Mihir Bellare, David Cash
2010 Lecture Notes in Computer Science  
(PRPs) resisting rich and relevant forms of related-key attacks (RKA).  ...  This paper fills an important foundational gap with the first proofs, under standard assumptions and in the standard model, of the existence of pseudorandom functions (PRFs) and pseudorandom permutations  ...  abortive our attempts to obtain RKA-security via this function.  ... 
doi:10.1007/978-3-642-14623-7_36 fatcat:trxt6lojhjecrbxvw23hvkieji

Efficient Pseudorandom-Function Modes of a Block-Cipher-Based Hash Function

Shoichi HIROSE, Hidenori KUWAKADO
2009 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
It is shown that the keyed-via-IV mode and the key-prefix mode of the iterated hash function are pseudorandom functions if the underlying block cipher is a pseudorandom permutation under a related-key  ...  This article discusses the provable security of pseudorandom-function (PRF) modes of an iterated hash function using a block cipher.  ...  Yoshida and Dr. Ideguchi at Hitachi, Ltd. and Prof. Ohta at The University of Electro-Communications for their fruitful discussions and comments on this research.  ... 
doi:10.1587/transfun.e92.a.2447 fatcat:dazzpeuiobbfhjfhy7mj5klpyu

BEAST: A fast block cipher for arbitrary blocksizes [chapter]

Stefan Lucks
1996 IFIP Advances in Information and Communication Technology  
Keywords Block-cipher, Luby-Rackoff, pseudorandom permutation, provably secure, smartcard, remote key P.  ...  It is a Luby-Rackoff cipher and fast when the blocks are large. BEAST is assembled from cryptographic hash functions and stream ciphers. It is provably secure if these building blocks are secure.  ...  INTRODUCTION Based on random functions, Luby and Rackoff (1988) described provably secure block ciphers.  ... 
doi:10.1007/978-0-387-35083-7_13 fatcat:ph6v7juqjbaa3kwoxeag2t7tda

Building Secure Block Ciphers on Generic Attacks Assumptions [chapter]

Jacques Patarin, Yannick Seurin
2009 Lecture Notes in Computer Science  
By opposition, other provably secure symmetric primitives, as for example C [3] and KFC [4], designed using information-theoretic results, are only proved to resist a limited (though significant) range  ...  Under these assumptions, the cryptographic primitives we obtain are perfectly secure against any adversary with computational resources less than a given bound.  ...  The notion of pseudorandom function (PRF) was introduced by [12] , and the notion of pseudorandom and strong (or super-) pseudorandom permutation (PRP and SPRP) by [18] .  ... 
doi:10.1007/978-3-642-04159-4_5 fatcat:lbxt5nkisza3paoaizw3wpuozu

A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications [chapter]

Mihir Bellare, Tadayoshi Kohno
2003 Lecture Notes in Computer Science  
We begin by introducing definitions for the concepts of PRPs and PRFs secure against classes of RKAs, each such class being specified by an associated set of "related-key deriving (RKD) functions."  ...  We initiate a theoretical investigation of the popular block-cipher design-goal of security against "related-key attacks" (RKAs).  ...  We motivate our interest in such families by presenting related-key attacks against several provably secure (under the standard models) block ciphers and pseudorandom function families.  ... 
doi:10.1007/3-540-39200-9_31 fatcat:ideklcfebffzpnfc5k3cyl7t7q

Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited [chapter]

Liting Zhang, Wenling Wu, Peng Wang, Lei Zhang, Shuang Wu, Bo Liang
2010 Lecture Notes in Computer Science  
are provably secure when their underlying block ciphers are related-key unpredictable.  ...  Under this assumption, we study the security of 64 rate-1 MACs in keyed PGV model, and find that 1) 15 MACs are meaningless; 2) 25 MACs are vulnerable to three kinds of attacks respectively and 3) 24 MACs  ...  underlying block ciphers are PseudoRandom Permutations (PRPs) or even Related-Key PseudoRandom Permutations (RK-PRPs).  ... 
doi:10.1007/978-3-642-13858-4_14 fatcat:3xeqkg4laza3nniqcnzu4jw2zi

New Security Proofs for the 3GPP Confidentiality and Integrity Algorithms [chapter]

Tetsu Iwata, Tadayoshi Kohno
2004 Lecture Notes in Computer Science  
Our results clarify the assumptions necessary in order for f 8 and f 9 to be secure and, since no related-key attacks are known against the full eight rounds of KASUMI, lead us to believe that the confidentiality  ...  We address this issue here, showing that it is possible to prove f 8 and f 9 secure if we make the assumption that the underlying block cipher is a secure PRP-RKA against a certain class of related-key  ...  Kohno was supported by a National Defense Science and Engineering Fellowship.  ... 
doi:10.1007/978-3-540-25937-4_27 fatcat:irhogdu47fgglkhbu5yox3o6ya

How to Enhance the Security of the 3GPP Confidentiality and Integrity Algorithms [chapter]

Tetsu Iwata, Kaoru Kurosawa
2005 Lecture Notes in Computer Science  
Following the results, it was shown that it is possible to prove f 8 and f 9 secure if we make the assumption that the underlying block cipher is a secure PRP-RKA against a certain class of related-key  ...  attacks; here f 8 is a generalized version of f 8.  ...  Intuitively, this implies that the security of f 8 + and f 9 + is irrelevant to the resistance of KASUMI against related key attacks. f 8 + and f 9 + are provably secure if KASUMI is merely secure in the  ... 
doi:10.1007/11502760_18 fatcat:3v4gz4p7trfc3czhykn6c4rtaa

Notions and relations for RKA-secure permutation and function families

Jongsung Kim, Jaechul Sung, Ermaliza Razali, Raphael C.-W. Phan, Marc Joye
2010 Designs, Codes and Cryptography  
The notion of provable security of block ciphers against related-key attacks was initiated by Bellare and Kohno, and subsequently treated by Lucks.  ...  We also show that function families of a certain form secure in the sense of a pseudorandom function (PRF) can be transformed into secure permutation families in the sense of PRP against some classes of  ...  G, G −1 ) are indistinguishable under related-key attack models, we then say that E is secure in the sense of a pseudorandom permutation (PRP) (resp. a strong pseudorandom permutation (SPRP)) against related-key  ... 
doi:10.1007/s10623-010-9414-8 fatcat:ajkmyhcgojfx3mryyogqjrnaiu

Faster Luby-Rackoff ciphers [chapter]

Stefan Lucks
1996 Lecture Notes in Computer Science  
Based on dedicated hash functions, block ciphers are proposed which are more efficient and operate on larger blocks than their original Luby-Rackoff counterparts.  ...  This paper deals with a generalization of Luby's and Rackoff's results [9] on the construction of block ciphers and their consequences for block cipher implementations.  ...  Based on pseudorandom functions, Luby and Rackoff [9] described provably secure block ciphers.  ... 
doi:10.1007/3-540-60865-6_53 fatcat:dnpyqexejnazbcqtclamwdd7l4

Secure searching on cloud storage enhanced by homomorphic indexing

Shu Qin Ren, Benjamin Hong Meng Tan, Sivaraman Sundaram, Taining Wang, Yibin Ng, Victor Chang, Khin Mi Mi Aung
2016 Future generations computer systems  
Acknowledgment The authors would like to thank Agency for Science, Technology and Research (A*STAR) for supporting the project under Future Data Centre Technologies grant; the project is entitled Secured  ...  Suppose E is a (t, l, e E )-secure pseudorandom permutation, F is a (t, l, e F )-secure pseudorandom function, f is a (t, l, e f )secure pseudorandom functions, G is a (t, e G )-secure pseudorandom generator  ...  Pseudorandom permutation P. If the above function F is permutation function P.  ... 
doi:10.1016/j.future.2016.03.013 fatcat:o4urxwvf4fdo3alchox2qeoy2e

The Related-Key Analysis of Feistel Constructions [chapter]

Manuel Barbosa, Pooya Farshim
2015 Lecture Notes in Computer Science  
In this paper we show that, under suitable reuse of round keys, security under related-key attacks can be provably attained.  ...  It is well known that the classical three-and four-round Feistel constructions are provably secure under chosen-plaintext and chosen-ciphertext attacks, respectively.  ...  by national funds, through the Foundation for Science and Technology (FCT).  ... 
doi:10.1007/978-3-662-46706-0_14 fatcat:gg7huflgxvebdns7mcphyuma5u

A Security Analysis of Key Expansion Functions Using Pseudorandom Permutations [chapter]

Ju-Sung Kang, Nayoung Kim, Wangho Ju, Ok-Yeon Yi
2014 Lecture Notes in Computer Science  
In this paper we wish to examine the soundness of the key expansion functions on the view point of provable security framework.  ...  permutations) is secure, while the variants of Counter and Feedback modes using PRPs are insecure.  ...  Pseudorandom Functions and Permutations A pseudorandom function is a function family with the property that the inputoutput behavior of a random instance of the family is computationally indistinguishable  ... 
doi:10.1007/978-3-662-43826-8_2 fatcat:kp7xr3k5afh3rb5w2e5mldhwca

On Related-Secret Pseudorandomness [chapter]

David Goldenberg, Moses Liskov
2010 Lecture Notes in Computer Science  
Security against related-key attacks has been a subject of study in numerous recent cryptographic papers.  ...  Related-key attacks are attacks against constructions which use a secret key (such as a blockcipher) in which an attacker attempts to exploit known or chosen relationships among keys to circumvent security  ...  We start by stating the definitions of a related key secure pseudorandom permutation and a related key secure pseudorandom function in the above notation. The definitions are taken from [8] .  ... 
doi:10.1007/978-3-642-11799-2_16 fatcat:wd2uryvka5debpshxp3bsm3rba

Page 5697 of Mathematical Reviews Vol. , Issue 2003g [page]

2003 Mathematical Reviews  
5697 secure against chosen-plaintext attacks.”  ...  Next, under the decision Ko-Lee assumption, we construct two provably secure pseudoran- dom schemes: a pseudorandom generator and a pseudorandom synthesizer.”  ... 
« Previous Showing results 1 — 15 out of 886 results