Roman Oliynykov

Orcid: 0000-0002-3494-0493

According to our database1, Roman Oliynykov authored at least 27 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Snarktor: A Decentralized Protocol for Scaling SNARKs Verification in Blockchains.
IACR Cryptol. ePrint Arch., 2024

2023
Models for Generation of Proof Forest in zk-SNARK Based Sidechains.
Cryptogr., March, 2023

Privacy-Preserving Decision-Making Over Blockchain.
IEEE Trans. Dependable Secur. Comput., 2023

A Scalable Coercion-resistant Blockchain Decision-making Scheme.
IACR Cryptol. ePrint Arch., 2023

Reputation-Based Incentive Model for Decentralized Analysis of Development Proposals.
Proceedings of the 12th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2023

2022
Trustless Cross-chain Communication for Zendoo Sidechains.
IACR Cryptol. ePrint Arch., 2022

Game theory analysis of incentive distribution for prompt generation of the proof tree in zk-SNARK based sidechains.
Proceedings of the IEEE International Carnahan Conference on Security Technology, 2022

A Game-Theoretic Analysis of Delegation Incentives in Blockchain Governance.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2022

Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria.
Proceedings of the 4th ACM Conference on Advances in Financial Technologies, 2022

2021
Blockchain Technologies: Probability of Double-Spend Attack on a Proof-of-Stake Consensus.
Sensors, 2021

Latus Incentive Scheme: Enabling Decentralization in Blockchains based on Recursive SNARKs.
IACR Cryptol. ePrint Arch., 2021

Game-Theoretic View on Decentralized Proof Generation in zk-SNARK-based Sidechains.
Proceedings of the Paper Proceedings of the Selected Papers on Publishing Papers with CEUR-WS co-located with Workshop on Cybersecurity Providing in Information and Telecommunication Systems (CPITS 2021), 2021

2020
Zendoo: a zk-SNARK Verifiable Cross-Chain Transfer Protocol Enabling Decoupled and Decentralized Sidechains.
IACR Cryptol. ePrint Arch., 2020

Decreasing security threshold against double spend attack in networks with slow synchronization.
Comput. Commun., 2020

Upper bound probability of double spend attack on SPECTRE.
Proceedings of the CryBlock@MOBICOM 2020: Proceedings of the 3rd Workshop on Cryptocurrencies and Blockchains for Distributed Systems, 2020

The Method of Searching for Differential Trails of ARX-based Block Cipher Cypress.
Proceedings of the 11th IEEE International Conference on Dependable Systems, 2020

2018
A Treasury System for Cryptocurrencies: Enabling Better Collaborative Intelligence.
IACR Cryptol. ePrint Arch., 2018

Number of confirmation blocks for Bitcoin and GHOST consensus protocols on networks with delayed message delivery: Extended abstract.
Proceedings of the 1st Workshop on Cryptocurrencies and Blockchains for Distributed Systems, 2018

2017
Analysis of splitting attacks on Bitcoin and GHOST consensus protocols.
Proceedings of the 9th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2017

Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
A Provably Secure Proof-of-Stake Blockchain Protocol.
IACR Cryptol. ePrint Arch., 2016

Influence of addition modulo 2 n on algebraic attacks.
Cryptogr. Commun., 2016

2015
A New Encryption Standard of Ukraine: The Kalyna Block Cipher.
IACR Cryptol. ePrint Arch., 2015

A New Standard of Ukraine: The Kupyna Hash Function.
IACR Cryptol. ePrint Arch., 2015

2013
A Method For Generation Of High-Nonlinear S-Boxes Based On Gradient Descent.
IACR Cryptol. ePrint Arch., 2013

2011
Cryptanalysis of Symmetric Block Ciphers Based on the Feistel Network with Non-bijective S-boxes in the Round Function.
IACR Cryptol. ePrint Arch., 2011

Improvement for distinguisher efficiency of the 3-round Feistel network and a random permutation.
Proceedings of the IEEE 6th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2011


  Loading...