M. Fischlin. Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications. Eurocrypt '99. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Encryption-Scheme Security in the Presence of.. - Black, Rogaway, Shrimpton (2002) (5 citations) (Correct)
....to depend on the underlying decryption key. Our definitions are strictly stronger than indistinguishability under chosen plaintext attacks (IND CPA) 3, 11] and the idea is orthogonal to strengthenings in the direction of non malleability [8] chosen ciphertext security [18] and anonymity [10]. We show that, in the symmetric key setting, KDM security is achievable, and by simple means, within the random oracle model [5] Why, at this time, do we put forth a new definition for encryption scheme security Our goal has been to nudge the computational treatment of encryption in a ....
M. Fischlin. "Pseudorandom function tribe ensembles based on one-way permutations: Improvements and applications". In Advances in Cryptology -- EUROCRYPT '99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000) (26 citations) (Correct)
....of which key concealing encryption, with which ciphertexts do not manifest whether they were produced using the same key (see Section 4.2) Independently and concurrently, the work of M. Fischlin and that of Bellare, Boldyreva, Desai, and Pointcheval study this concept from di#erent perspectives [6, 19]. 3 Formal Encryption and Expression Equivalence In this section we present the formal view of cryptography, specifically treating symmetric encryption. We describe the space of expressions on which encryption operates, and what it means for two expressions to be equivalent. As explained in the ....
Marc Fischlin. Pseudorandom function tribe ensembles based on oneway permutations: Improvements and applications. In Advances in 30 Cryptology---Eurocrypt '99, volume 1592 of Lecture Notes in Computer Science, pages 429--444. Springer-Verlag, 1999.
Encryption-Scheme Security in the Presence of.. - Black, Rogaway, Shrimpton (2002) (5 citations) (Correct)
....to depend on the underlying decryption key. Our de nitions are strictly stronger than indistinguishability under chosen plaintext attacks (IND CPA) 3, 11] and the idea is orthogonal to strengthenings in the direction of non malleability [8] chosen ciphertext security [18] and anonymity [10]. We show that, in the symmetric key setting, KDM security is achievable, and by simple means, within the random oracle model [5] Why, at this time, do we put forth a new de nition for encryption scheme security Our goal has been to nudge the computational treatment of encryption in a ....
M. Fischlin. \Pseudorandom function tribe ensembles based on one-way permutations: Improvements and applications". In Advances in Cryptology { EUROCRYPT '99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
Formal Eavesdropping and its Computational Interpretation - Abadi, Jürjens (2000) (39 citations) (Correct)
....D) is confusion free if for all m 2 String the probability Pr[k; k 0 R K( x R E k (m) D k 0 (x) 6= is negligible. M. Fischlin s related concept of committing encryption requires the encryption function to be essentially injective (to map di erent plaintexts to di erent ciphertexts) [9]. Confusion freedom di ers in that it allows some collisions and puts requirements on the decryption function. The long version of this paper [2] describes a construction of confusion free encryption schemes. Finally, we need to rule out encryption cycles (such as encrypting a key with itself) ....
Marc Fischlin. Pseudorandom function tribe ensembles based on one-way permutations: Improvements and applications. In Advances in Cryptology| Eurocrypt '99, volume 1592 of Lecture Notes in Computer Science, pages 429-444. Springer-Verlag, 1999.
Encryption-Scheme Security in the Presence of.. - Black, Rogaway, Shrimpton (2002) (5 citations) (Correct)
....plaintexts to depend on the underlying decryption key. Our de nitions are stronger than indistinguishability under chosen plaintext attacks (IND CPA) 11, 3] and the idea is orthogonal to strengthenings in the direction of non malleability [8] chosen ciphertext security [21] and anonymity [10]. We show that, in the symmetric key setting, KDM security is achievable, and by simple means, within the random oracle model [5] Why, at this time, do we put forth a new de nition for encryption scheme security Our goal has been to nudge the computational treatment of encryption in a ....
M. Fischlin. \Pseudorandom function tribe ensembles based on one-way permutations: Improvements and applications". In Advances in Cryptology { EUROCRYPT '99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
Modeling Insider Attacks on Group Key-Exchange Protocols - Katz, Shin (2005) (4 citations) (Correct)
No context found.
M. Fischlin. Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications. Eurocrypt '99.
On Obfuscating Point Functions - Wee (2005) (1 citation) (Correct)
No context found.
Marc Fischlin, "Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications", Proceedings of Eurocrypt 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC