mikero's library 20 articles Export

	Universally composable two-party and multi-party secure computation [My Copy] In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002), pp. 494-503. by Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai posted to crs mpc uc by mikero on 2009-01-29 20:36:15 as along with 1 group Crypto
	Relaxing Chosen-Ciphertext Security [My Copy] Lecture Notes in Computer Science : Advances in Cryptology - CRYPTO 2003 (2003), pp. 565-582. by Ran Canetti, Hugo Krawczyk, Jesper B. Nielsen posted to cca encryption non-malleability rcca by mikero on 2009-01-29 20:35:30 as along with 3 people and 1 group hci02 network01 mgran Crypto
	On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions [My Copy] Journal of Cryptology, Vol. 19, No. 2. (6 April 2006), pp. 135-167. by Ran Canetti, Eyal Kushilevitz, Yehuda Lindell posted to mpc uc by mikero on 2009-01-29 20:34:54 as along with 1 group Crypto
	The All-or-Nothing Nature of Two-Party Secure Computation [My Copy] Advances in Cryptology — CRYPTO’ 99 (1999), pp. 786-786. by Amos Beimel, Tal Malkin, Silvio Micali posted to mpc zero-one by mikero on 2009-01-29 20:34:09 as
	Perfect privacy for two-party protocols [My Copy] In Proceedings of DIMACS Workshop on Distributed Computing and Cryptology, Vol. 2 (1989), pp. 65-77. by Donald Beaver edited by J. Feigenbaum, M. Merritt posted to honest-but-curious mpc sfe by mikero on 2009-01-29 20:33:13 as
	On $ε$-biased generators in NC$^0$ [My Copy] Random Structures and Algorithms, Vol. 29, No. 1. (2006), pp. 56-81. by Elchanan Mossel, Amir Shpilka, Luca Trevisan posted to nc0 prg by mikero on 2009-01-29 20:27:20 as
	On Pseudorandom Generators in NC0 [My Copy] Mathematical Foundations of Computer Science 2001 (2001), pp. 272-284. by Mary Cryan, Peter Miltersen posted to nc0 prg by mikero on 2009-01-29 20:25:56 as
	Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information [My Copy] Advances in Cryptology - CRYPTO '97: 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 1997. Proceedings (1997), 455. by Ran Canetti posted to ddh hashing random-oracle by mikero on 2009-01-29 20:19:12 as along with 1 person cyc
	A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack [My Copy] Advances in Cryptology — CRYPTO '98 (1998), pp. 1-3. by Ronald Cramer, Victor Shoup posted to cca ddh encryption non-malleability by mikero on 2009-01-29 20:14:11 as
	Rerandomizable RCCA Encryption [My Copy] Advances in Cryptology - CRYPTO 2007 (2007), pp. 517-534. by Manoj Prabhakaran, Mike Rosulek posted to cca encryption non-malleability rcca rerandomization by mikero on 2009-01-29 20:11:30 as
	Harvesting credentials in trust negotiation as an honest-but-curious adversary [My Copy] In WPES '07: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007), pp. 64-67. by Lars E. Olson, Michael J. Rosulek, Marianne Winslett posted to trust-negotiation by mikero on 2009-01-29 20:10:28 as along with 1 person aravindmc
	Homomorphic Encryption with CCA Security [My Copy] Automata, Languages and Programming (2008), pp. 667-678. by Manoj Prabhakaran, Mike Rosulek posted to cca encryption hcca homomorphic-encryption non-malleability by mikero on 2009-01-29 20:09:36 as along with 1 person H-Arrietaumn
	Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations [My Copy] Advances in Cryptology – CRYPTO 2008 (2008), pp. 262-279. by Manoj Prabhakaran, Mike Rosulek posted to mpc uc by mikero on 2009-01-29 20:05:51 as
	Towards Robust Computation on Encrypted Data [My Copy] Advances in Cryptology - ASIACRYPT 2008 (2008), pp. 216-233. by Manoj Prabhakaran, Mike Rosulek posted to encryption hcca homomorphic-encryption verifiable-shuffle by mikero on 2009-01-29 20:04:38 as
	Exact enumeration of acyclic deterministic automata [My Copy] Discrete Applied Mathematics, Vol. 154, No. 3. (1 March 2006), pp. 537-551. by Valery A. Liskovets posted to automata by mikero on 2006-05-09 20:33:12 as
	On the number of distinct languages accepted by finite automata with <i>n</i> states [My Copy] J. Autom. Lang. Comb., Vol. 7, No. 4. (September 2002), pp. 469-486. by Michael Domaratzki, Derek Kisman, Jeffrey Shallit posted to automata by mikero on 2006-05-09 19:50:31 as
	Non-Black-Box Techniques in Cryptography [My Copy] (2004) by Boaz Barak posted to commitment non-black-box zero-knowledge by mikero on 2006-03-18 16:41:03 as
	On the Composition of Zero-Knowledge Proof Systems [My Copy] SIAM J. Comput., Vol. 25, No. 1. (February 1996), pp. 169-192. by Oded Goldreich, Hugo Krawczyk posted to black-box lower-bounds zero-knowledge by mikero on 2006-03-18 16:27:10 as
	Candidate One-Way Functions Based on Expander Graphs [My Copy] (4 December 2000) by Oded Goldreich posted to circuits crypto expanders nc0 by mikero on 2005-12-09 18:50:03 as
	Cryptography in NC^0 [My Copy] Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on In Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on (2004), pp. 166-175. by B. Applebaum, Y. Ishai, E. Kushilevitz posted to nc0 prg by mikero on 2005-12-09 18:37:43 as along with 1 person and 2 groups camu Crypto Randomness

Note: You may cite this page as: http://www.citeulike.org/user/mikero

encryption	5
mpc	5
cca	4
nc0	4
non-malleability	4
prg	3
uc	3
zero-knowledge	2
hcca	2
rcca	2
automata	2
ddh	2
homomorphic-encryption	2
honest-but-curious	1
hashing	1
verifiable-shuffle	1
rerandomization	1
zero-one	1
lower-bounds	1
crypto	1
commitment	1
crs	1
non-black-box	1
random-oracle	1
black-box	1
circuits	1
expanders	1
sfe	1
trust-negotiation	1

mikero's library 20 articles Export

mikero's tags