Naor-Reingold construction of pseudorandom permutations.
M. Naor and O. Reingold, Synthesizers and their application to the parallel construction of pseudorandom functions, Journal of Computer and System Sciences (JCSS), 1999. Preliminary Version: FOCS 1995.
M. Bellare and P. Rogaway.
Random oracles
are practical: A paradigm for designing efficient protocols.
Proceedings First Annual Conference on Computer and Communications Security, ACM, 1993.
R. Canetti, O. Goldreich, S. Halevi.
The Random Oracle Methodology, Revisited
FOCS 1998
C. Dwork, M. Naor, O. Reingold and L. J. Stockmeyer.
Magic
functions,
J. ACM, 2003.
Feige, U. Lapidot, D. Shamir, A.
Multiple non-interactive zero knowledge proofs based on a single random string
Proceedings., 31st Annual Symposium on Foundations of Computer Science, 1990.
J. Camenisch and M. Stadler
Efficient Group Signature Schemes for Large Groups
J. Camenisch and J. Groth
Group Signatures: Better Efficiency and New Theoretical Aspects
G. Ateniese, J. Camenisch, M. Joye and G. Tsudik
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
R. Rivest, A. Shamir, and Y. Tauman
How to Leak a Secret
X. Boyen, Y. Dodis, J. Katz, R. Ostrovsky, and A. Smith
Secure remote authentication using biometric data
Moni Naor, Moti Yung:
Public-key Cryptosystems Provably Secure against Chosen Ciphertext
Attacks
STOC 1990: 427-437
Russell Impagliazzo and Moni Naor.
Efficient Cryptographic Schemes Provably as Secure as Subset Sum,
J. of Cryptology 9(4):, 1996, pp. 199--216.
O. Regev.
New Lattice Based Cryptographic Constructions
Journal of the ACM 51(6), pp. 899-942, 2004. Preliminary version in
Proc. of STOC 2003.
R. Cramer, R. Gennaro and B. Schoenmakers. O. Dolev, C. Dwork, and M. Naor B. Barak D. Chaum, A. Fiat and M. Naor. J. Camenisch, S. Hohenberger, A. Lysyanskaya.
A Secure and Optimally Efficient Multi-Authority Election Scheme,
Proceedings of EUROCRYPT '97, Konstanz, Germany, Springer Verlag LNCS, vol. 1233.
Non-malleability, Man-in-the-Middle Attacks
Non-malleable cryptography
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the
Shared Random String Model
Electronic Cash
Untraceable Electronic Cash
Compact E-Cash.
Eurocrypt 2005.
Multiparty Computation
D. Chaum, C. Crepeau, and I. Damgaard.
Multiparty unconditionally secure protocols.
In 19th Symp. on Theory of Computing , pages 11-19. ACM, 1988.
M. Ben-Or, S. GOldwasser, A. Wigderson
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Proceedings of the twentieth annual ACM symposium on Theory of Computing.