|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14 occurrences of 11 keywords
|
|
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao |
Lower bounds on information complexity via zero-communication protocols and applications.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao |
Lower bounds on information complexity via zero-communication protocols and applications  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland |
Non-local box complexity and secure function evaluation.  |
Quantum Information & Computation  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Shengyu Zhang |
A quantum protocol for sampling correlated equilibria unconditionally and without a mediator  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | André Chailloux, Iordanis Kerenidis, Bill Rosgen |
Quantum Commitments from Complexity Assumptions.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | André Chailloux, Iordanis Kerenidis |
Optimal Bounds for Quantum Bit Commitment.  |
FOCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang |
On the Power of a Unique Quantum Witness.  |
ICS  |
2010 |
DBLP BibTeX RDF |
|
| 1 | André Chailloux, Iordanis Kerenidis, Jamie Sikora |
Lower bounds for Quantum Oblivious Transfer.  |
FSTTCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iordanis Kerenidis |
Quantum multiparty communication complexity and circuit lower bounds.  |
Mathematical Structures in Computer Science  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | André Chailloux, Iordanis Kerenidis |
Optimal Quantum Strong Coin Flipping.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
strong coin-flipping protocol, quantum cryptography |
| 1 | Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland |
Non-Local Box Complexity and Secure Function Evaluation.  |
FSTTCS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography.  |
SIAM J. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis |
Exponential Separation of Quantum and Classical One-Way Communication Complexity.  |
SIAM J. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan |
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.  |
TCC  |
2008 |
DBLP DOI BibTeX RDF |
noninteractive zero-knowledge proofs, quantum zero knowledge, computational complexity, cryptography, Arthur-Merlin games, commitment schemes |
| 1 | André Chailloux, Iordanis Kerenidis |
Increasing the power of the verifier in Quantum Zero Knowledge.  |
FSTTCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elham Kashefi, Iordanis Kerenidis |
Statistical Zero Knowledge and quantum one-way functions.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan |
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.  |
IACR Cryptology ePrint Archive  |
2007 |
DBLP BibTeX RDF |
|
| 1 | André Chailloux, Iordanis Kerenidis |
The role of help in Classical and Quantum Zero-Knowledge.  |
IACR Cryptology ePrint Archive  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis |
Quantum Multiparty Communication Complexity and Circuit Lower Bounds.  |
TAMC  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
Exponential separations for one-way quantum communication complexity, with applications to cryptography.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
cryptography, communication complexity, quantum |
| 1 | Iordanis Kerenidis, Ran Raz |
The one-way communication complexity of the Boolean Hidden Matching Problem.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ran Raz |
The one-way communication complexity of the Boolean Hidden Matching Problem  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Quantum symmetrically-private information retrieval.  |
Inf. Process. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ashwin Nayak |
Weak coin flipping with small bias.  |
Inf. Process. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis |
Exponential Separation of Quantum and Classical One-Way Communication Complexity  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Exponential lower bound for 2-query locally decodable codes via a quantum argument.  |
J. Comput. Syst. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis |
Exponential separation of quantum and classical one-way communication complexity.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
hidden matching, quantum computation, communication complexity, separation |
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Quantum Symmetrically-Private Information Retrieval  |
CoRR  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Exponential lower bound for 2-query locally decodable codes via a quantum argument.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
quantum computing, private information retrieval, locally decodable codes |
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Exponential Lower Bound for 2-Query Locally Decodable Codes  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument  |
CoRR  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Petros Drineas, Iordanis Kerenidis, Prabhakar Raghavan |
Competitive recommendation systems.  |
STOC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Harrelson, Iordanis Kerenidis |
Quantum Clock Synchronization with one qubit  |
CoRR  |
2001 |
DBLP BibTeX RDF |
|
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|