Accountable-Subgroup Multisignatures (2000)

by Silvio Micali , Kazuo Ohta , Leonid Reyzin
Venue:In Proceedings of CCS 2001
Citations:43 - 2 self

Active Bibliography

24 Improved non-committing encryption schemes based on a general complexity assumption – Jesper Buus Nielsen - 2000
Advanced Cryptography March 3, 2003 – Lecture Variations On, Scribed Joel Alwen
1 Improved Non-Committing Encryption Schemes based on a General Complexity Assumption – Ivan B. Damg Ard, Ivan B. Damg Ard, Ivan Damgård, Jesper Buus Nielsen, Jesper Buus Nielsen, Jesper Buus Nielsen - 2000
Mathematical Foundations of Modern Cryptography: Computational Complexity Perspective – Shafi Goldwasser - 2002
Efficient – Jacques Dubrois, Jean-guillaume Dumas
Generating Random Factored Gaussian Integers, Easily – Noah Lebowitz-lockard, Advisor Carl Pomerance - 2013
1 Cryptology – Prof Ronald Rivest, L. Rivest
The Computational Complexity of Randomness – Thomas Weir Watson - 2013
7 Evaluation may be easier than generation (Extended Abstract) – Moni Naor - 1996
1 Time Hierarchies for Sampling Distributions – Thomas Watson - 2012
11 Generating Random Factored Numbers, Easily – Adam Kalai - 2003
21 The Dark Side of "Black-Box" Cryptography or: Should We Trust Capstone? – Adam Young, Moti Yung - 1996
42 Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions – Moni Naor , Omer Reingold - 1995
40 The (True) Complexity of Statistical Zero Knowledge (Extended Abstract) – Mihir Bellare, Silvio Micali, Rafail Ostrovsky - 1990
11 Improved Non-Committing Encryption with Applications to Adaptively Secure Protocols – Seung Geol Choi, Dana Dachman-soled, Tal Malkin, Hoeteck Wee
16 Fully homomorphic encryption over the integers with shorter public keys – Jean-sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi, École Normale Supérieure - 2011
16 On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators – Oded Goldreich, Rehovot Israel, Vered Rosen - 2000
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
22 Asymptotic semismoothness probabilities – Eric Bach, René Peralta - 1996