Aleksandr Yampolskiy
International Conference on Theory and Practice of Public Key Cryptography · 2005
A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 28 researchers here, as inferred from the citation graph.
Whom Aleksandr Yampolskiy trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Aleksandr Yampolskiy overall
- Dan Boneh
- Jan Camenisch
- Rafik Chaabouni
- Melissa Chase
- Stanislaw Jarecki
- Xavier Boyen
- Man Ho Allen Au
- Siavosh Benabbas
- Vladimir Kolesnikov
- Susan Hohenberger
Papers from Aleksandr Yampolskiy's perspective
Ordered by how strongly the researchers Aleksandr Yampolskiy trusts endorse each paper. Same corpus, a different order for every researcher.
- Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles (IACR Cryptology ePrint Archive)
- Short Signatures Without Random Oracles
- A New Traitor Tracing (IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences)
- Completeness theorems for non-cryptographic fault-tolerant distributed computation
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Identity-Based Encryption from the Weil Pairing
- Random oracles are practical: a paradigm for designing efficient protocols
- Short Signatures from the Weil Pairing
- On the Exact Security of Full Domain Hash (Annual International Cryptology Conference)
- Efficient Identity-Based Encryption Without Random Oracles (International Conference on the Theory and Application of Cryptographic Techniques)
Their papers
- A Verifiable Random Function with Short Proofs and Keys (2005) — 483 citations