We introduce a new primitive, called trapdoor hash functions (TDH), which are hash functions H:{0, 1\}^ n → {0, 1\}^ λ with additional trapdoor function-like properties …
A Banerjee, C Peikert - Advances in Cryptology–CRYPTO 2014: 34th …, 2014 - Springer
A key-homomorphic pseudorandom function (PRF) family {F s: D→ R} allows one to efficiently compute the value F s+ t (x) given F s (x) and F t (x). Such functions have many …
We provide a formal treatment of security of digital signatures against subversion attacks (SAs). Our model of subversion generalizes previous work in several directions, and is …
Non-malleable codes, defined by Dziembowski, Pietrzak, and Wichs (ICS'10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to …
Yao's garbled-circuit approach enables constant-round secure two-party computation of any function. In Yao's original construction, each gate in the circuit requires the parties to perform …
M Bellare, D Cash, R Miller - … 2011: 17th International Conference on the …, 2011 - Springer
We show how to leverage the RKA (Related-Key Attack) security of blockciphers to provide RKA security for a suite of high-level primitives. This motivates a more general theoretical …
V Goyal, A O'Neill, V Rao - Theory of Cryptography: 8th Theory of …, 2011 - Springer
We undertake a general study of hash functions secure under correlated inputs, meaning that security should be maintained when the adversary sees hash values of many related …
Z Jafargholi, D Wichs - Theory of Cryptography Conference, 2015 - Springer
WeN consider a public and keyless code (Enc, Dec) which is used to encode a message m and derive a codeword c= Enc (m). The codeword can be adversarially tampered via a …
H Wee - International Workshop on Public Key Cryptography, 2012 - Springer
In this work, we present efficient public-key encryption schemes resilient against linear related key attacks (RKA) under standard assumptions and in the standard model …