Josef Pieprzyk
International Conference on the Theory and Application of Cryptology and Information Security · 2002–2016
A researcher in the Science corpus: 2 papers; trusts 3 researchers and is trusted by 9 researchers here, as inferred from the citation graph.
Whom Josef Pieprzyk trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Josef Pieprzyk overall
- Mihir Bellare
- Itai Dinur
- Nicolas T. Courtois
- Elad Barkan
- Willi Meier
- Andrey Bogdanov
- Adi Shamir
- Tadayoshi Kohno
Papers from Josef Pieprzyk's perspective
Ordered by how strongly the researchers Josef Pieprzyk trusts endorse each paper. Same corpus, a different order for every researcher.
- Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations (International Conference on the Theory and Application of Cryptographic Techniques)
- How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)
- Matrix multiplication via arithmetic progressions
- Communication theory of secrecy systems
- How to share a secret
- A single quantum cannot be cloned
- Quantum cryptography: Public key distribution and coin tossing (Theoretical Computer Science)
- A practical scheme for non-interactive verifiable secret sharing
- Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
- "PROOF"
Their papers
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations (2002) — 901 citations
- Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding (2016) — 405 citations