Arnab Roy
Artificial Intelligence · 2016–2021
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 22 citations into it
- Computational Theory and Mathematics — 7 citations into it
- Information Systems — 6 citations into it
Whom Arnab Roy trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Arnab Roy's perspective
Ordered by how strongly the researchers Arnab Roy trusts endorse each paper. Same corpus, a different order for every researcher.
- Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials (Annual International Cryptology Conference)
- Bulletproofs: Short Proofs for Confidential Transactions and More
- Constant-Size Commitments to Polynomials and Their Applications
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (IACR Cryptology ePrint Archive)
- Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (Conference on Computer and Communications Security)
- Scalable Zero Knowledge with No Trusted Setup
- On the Size of Pairing-Based Non-interactive Arguments
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS (IACR Cryptology ePrint Archive)
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (International Conference on the Theory and Application of Cryptology and Information Security)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup
Their papers
- Poseidon: A New Hash Function for Zero-Knowledge Proof Systems (2021) — 433 citations
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (2016) — 363 citations