Rafail Ostrovsky

International Association for Cryptologic Research

Rafail Ostrovsky Search web for home page

Program Committees

1	2011	Eurocrypt	pc
2	2010	TCC	pc
3	2009	Eurocrypt	pc
4	2007	PKC	pc
5	2006	PKC	pc
6	2005	Eurocrypt	pc
7	2005	TCC	pc
8	2004	Crypto	pc
9	2003	Crypto	pc
10	2002	Crypto	pc
11	1998	Crypto	pc

Publications

	year	title	booktitle	pages
1	2012	Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority	crypto	663-680
2	2012	Correlated Product Security from Any One-Way Function	pkc	558-575
3	2012	Extended-DDH and Lossy Trapdoor Functions	pkc	627-643
4	2012	On Homomorphic Encryption and Chosen-Ciphertext Security	pkc	52-65
5	2012	Identifying Cheaters without an Honest Majority	tcc	21-38
6	2012	Resettable Statistical Zero Knowledge	tcc	494-511
7	2012	Simultaneously Resettable Arguments of Knowledge	tcc	530-547
8	2012	Unconditionally-Secure Robust Secret Sharing with Compact Shares	eurocrypt	195-208
9	2012	Impossibility Results for Static Input Secure Computation	crypto	424-442
10	2011	Position-Based Quantum Cryptography: Impossibility and Constructions	crypto	423
11	2011	Constant-Rate Oblivious Transfer from Noisy Channels	crypto	664
12	2011	Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security	asiacrypt	70-88
13	2011	Effcient Non-Interactive Secure Computation	eurocrypt	406
14	2010	Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge	tcc	535-552
15	2010	On Complete Primitives for Fairness	tcc	91-108
16	2010	Throughput-Optimal Routing in Unreliable Networks	eprint	online
17	2010	Position-Based Quantum Cryptography	eprint	online
18	2010	Equivalence of Uniform Key Agreement and Composition Insecurity	crypto	447-464
19	2010	Password-Authenticated Session-Key Generation on the Internet in the Plain Model	crypto	277-294
20	2010	Secure Message Transmission with Small Public Discussion	eurocrypt	177-196
21	2010	Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security	eprint	online
22	2010	Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security	eprint	online
23	2009	Re-randomizable Encryption implies Selective Opening Security	eprint	online
24	2009	Position Based Cryptography	crypto	391-407
25	2009	Authenticated Adversarial Routing	tcc	163-182
26	2009	Simulation-Based Concurrent Non-malleable Commitments and Decommitments	tcc	91-108
27	2008	Communication Complexity in Algebraic Two-Party Protocols	crypto	379-396
28	2008	Circular-Secure Encryption from Decision Diffie-Hellman	crypto	108-125
29	2008	Public-Key Locally-Decodable Codes	crypto	126-143
30	2008	Public-Key Encryption with Efficient Amortized Updates	eprint	online
31	2008	Almost-Everywhere Secure Computation	eurocrypt	307-323
32	2008	Constant-Round Concurrent Non-Malleable Commitments and Decommitments	eprint	online
33	2008	Authenticated Adversarial Routing	eprint	online
34	2007	Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions	asiacrypt	444-459
35	2007	A Survey of Single Database PIR: Techniques and Applications	eprint	online
36	2007	Algebraic Lower Bounds for Computing on Encrypted Data	eprint	online
37	2007	Attribute-Based Encryption with Non-Monotonic Access Structures	eprint	online
38	2007	Public Key Encryption that Allows PIR Queries	eprint	online
39	2007	Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code	eprint	online
40	2007	Cryptography in the Multi-string Model	crypto	323-341
41	2007	Public Key Encryption That Allows PIR Queries	crypto	50-67
42	2007	Almost-everywhere Secure Computation	eprint	online
43	2007	Secure Two-Party k-Means Clustering	eprint	online
44	2007	A Survey of Single-Database Private Information Retrieval: Techniques and Applications	pkc	393-411
45	2007	Private Locally Decodable Codes	eprint	online
46	2006	Sequential Aggregate Signatures and Multisignatures Without Random Oracles	eurocrypt	online
47	2006	Cryptography from Anonymity	eprint	online
48	2006	Sequential Aggregate Signatures and Multisignatures without Random Oracles	eprint	online
49	2006	Perfect Non-interactive Zero Knowledge for NP	eurocrypt	online
50	2006	Non-interactive Zaps and New Techniques for NIZK	crypto	online
51	2006	Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions	eprint	online
52	2006	Cryptography in the Multi-string Model	eprint	online
53	2006	Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions	eprint	online
54	2005	Minimal Complete Primitives for Secure Multi-Party Computation	jofc	37-61
55	2005	Secure Remote Authentication Using Biometric Data	eurocrypt	online
56	2005	Perfect Non-Interactive Zero Knowledge for NP	eprint	online
57	2005	Sufficient Conditions for Collision-Resistant Hashing	tcc	online
58	2005	Private Searching on Streaming Data	crypto	online
59	2004	Efficient Consistency Proofs for Generalized Queries on a Committed Database	eprint	online
60	2004	Public Key Encryption with Keyword Search	eurocrypt	online
61	2004	Round-Optimal Secure Two-Party Computation	crypto	online
62	2003	Public Key Encryption with keyword Search	eprint	online
63	2003	Round Efficiency of Multi-party Computation with a Dishonest Majority	eurocrypt	online
64	2003	Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data	eprint	online
65	2002	Universally Composable Two-Party and Multi-Party Secure Computation	eprint	online
66	2001	Minimal Complete Primitives for Secure Multi-party Computation	crypto	80-100
67	2001	Universal Service-Providers for Private Information Retrieval	jofc	37-74
68	2001	Cryptographic Counters and Applications to Electronic Voting	eurocrypt	78-92
69	2001	Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords	eurocrypt	475-494
70	2001	Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords	eprint	online
71	2001	Efficient and Non-Interactive Non-Malleable Commitment	eprint	online
72	2001	Robust Non-interactive Zero Knowledge	crypto	566-598
73	2001	Efficient and Non-interactive Non-malleable Commitment	eurocrypt	40-59
74	2000	Randomness versus Fault-Tolerance	jofc	107-142
75	2000	Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP	eprint	online
76	2000	Single Database Private Information Retrieval Implies Oblivious Transfer	eurocrypt	122-138
77	2000	One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval	eurocrypt	104-121
78	1999	On Concurrent Zero-Knowledge with Pre-processing	crypto	485-502
79	1999	Conditional Oblivious Transfer and Timed-Release Encryption	eurocrypt	74-89
80	1998	Universal Service Providers for Database Private Information Retrieval	eprint	online
81	1998	Randomness versus Fault-Tolerance	eprint	online
82	1998	Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation	jofc	87-108
83	1998	Fast Digital Identity Revocation (Extended Abstract)	crypto	137-152
84	1997	Deniable Encryption	crypto	90-104
85	1997	Security of Blind Digital Signatures (Extended Abstract)	crypto	150-164
86	1997	Efficient Anonymous Multicast and Reception (Extended Abstract)	crypto	395-409
87	1996	Deniable Encryption	eprint	online
88	1996	Private Information Storage	eprint	online
89	1993	Interactive Hashing Simplifies Zero-Knowledge Protocol Design	eurocrypt	267-273
90	1992	Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)	crypto	196-214
91	1992	Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)	crypto	228-245
92	1991	A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems	asiacrypt	352-359
93	1989	An Efficient Software Protection Scheme	crypto	610-611
94	1989	Minimum Resource Zero-Knowledge Proofs (Extended Abstract)	crypto	545-546

Rafail Ostrovsky Search web for home page

Program Committees

Publications

Coauthors of Rafail Ostrovsky