Secure Commitment Against A Powerful Adversary - A security primitive based on average intractability (Extended Abstract)

DMCA

Secure Commitment Against A Powerful Adversary - A security primitive based on average intractability (Extended Abstract) (1992)

Cached

Download Links

by Rafail Ostrovsky , Ramarathnam Venkatesan , Moti Yung

Citations:

14 - 6 self

Citations

858	A pseudorandom generator from any one-way function - Håstad, Impagliazzo, et al. - 1999
840	Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract - Ben-Or, Goldwasser, et al. - 1988
656	How to generate cryptographically strong sequences of pseudo-random bits - Blum, Micali - 1984
594	A randomized protocol for signing contracts - Even, Goldreich, et al. - 1985
379	How to exchange secrets by oblivious transfer - Rabin - 1981
338	Algebraic methods for interactive proof systems. - Lund, Fortnow, et al. - 1992
275	Bit Commitment Using Pseudorandomness - Naor - 1991
216	Average Case Complete Problems - Levin - 1986
146	On Hiding Information from an Oracle, - Abadi, Feigenbaum, et al. - 1989
133	Achieving oblivious transfer using weakened security assumptions - Cr'epeau, Kilian - 1988
86	Information theoretic reductions among disclosure problems - Brassard, Cr'epeau, et al. - 1986
77	Multiparty Computation with Faulty Majority, FOCS 89 - Beaver, Goldwasser
75	Average case completeness - Gurevich - 1991
68	No better ways to generate hard NP instances than picking uniformly at random. - Impagliazzo, Levin - 1990
54	Pseudo-Random Generators under Uniform Assumptions - Hastad
45	Direct minimum-knowledge computations - Impagliazzo, Yung - 1988
43	The (True) Complexity of Statistical Zero-Knowledge - Bellare, Micali, et al. - 1990
42	Random instances of a graph coloring problem are hard. - Venkatesan, Levin - 1988
40	Zero-Knowledge Arguments for NP can be Based on General Assumptions - Naor, Ostrovsky, et al. - 1998
39	Fair Games Against an All-Powerful Adversary, extended abstract in the proceedings of Sequences '91 - Ostrovsky, Venkatesan, et al. - 1991
35	Computational models of games - Condon - 1989
32	Equivalence between Two Flavors of Oblivious Transfer, Crypto 87 - Crepeau
30	One-way functions, hard on average problems, and statistical zeroknowledge proofs - Ostrovsky - 1991
28	One-way Functions are Essential for Complexity-Based Cryptography - Impagliazzo, Luby - 1989
22	Proofs that Yield Nothing but their Validity or - Goldreich, Micali, et al. - 1991
10	The Knowledge Complexity - Goldwasser, Micali, et al.
9	Private communication, - Ron, Stefansson - 2001
8	Coin Flipping over the Telephone - Blum - 1982
6	Racko An Oblivious Transfer Protocol Equivalent to Factoring, Manuscript - Fischer, Micali, et al.
5	Applications of Oblivious Transfer, Unpublished manuscript - Blum
5	Hard-core Predicate for ANY one-way function , STOC 89 - Goldreich, Levin
3	A Note On One-Prover, Instance-Hiding ZeroKnowledge Proof Systems - Feigenbaum, Ostrovsky
2	Everything in NP can be proven in Perfect Zero Knowledge in a bounded number of rounds," ICALP 89 - Brassard, Crepeau, et al.
2	Basing Cryptography on Oblivious Transfer , STOC - Killian - 1988
2	Interactive Proofs With Provable Security Against Honest Veri ers CRYPTO 90 - Kilian
2	How to Generate and Exchange Secrets, FOCS 86 - Yao - 1986
1	Veri able Secret Sharing and - Rabin, Ben-Or