Handan Kilinç Alper

According to our database1, Handan Kilinç Alper authored at least 16 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient Execution Auditing for Blockchains under Byzantine Assumptions.
IACR Cryptol. ePrint Arch., 2024

2023
Sassafras and Semi-Anonymous Single Leader Election.
IACR Cryptol. ePrint Arch., 2023

Ethical identity, ring VRFs, and zero-knowledge continuations.
IACR Cryptol. ePrint Arch., 2023

2022
Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation.
ACM Trans. Priv. Secur., 2022

2021
Coin-Based Multi-party Fair Exchange.
Proceedings of the Applied Cryptography and Network Security, 2021

2020
Overview of Polkadot and its Design Considerations.
IACR Cryptol. ePrint Arch., 2020

Two-round trip Schnorr multi-signatures via delinearized witnesses.
IACR Cryptol. ePrint Arch., 2020

2019
Consensus on Clock in Universally Composable Timing Model.
IACR Cryptol. ePrint Arch., 2019

Ouroboros Clepsydra: Ouroboros Praos in the Universally Composable Relative Time Model.
IACR Cryptol. ePrint Arch., 2019

2018
Implications of Position in Cryptography.
PhD thesis, 2018

Formal Analysis of Distance Bounding with Secure Hardware.
IACR Cryptol. ePrint Arch., 2018

Secure Contactless Payment.
Proceedings of the Information Security and Privacy - 23rd Australasian Conference, 2018

2017
Contactless Access Control Based on Distance Bounding.
Proceedings of the Information Security - 20th International Conference, 2017

2016
Efficient Public-Key Distance Bounding Protocol.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Optimal Proximity Proofs Revisited.
Proceedings of the Applied Cryptography and Network Security, 2015

2014
Efficiently Making Secure Two-Party Computation Fair.
IACR Cryptol. ePrint Arch., 2014


  Loading...