Dimitar Jetchev

Orcid: 0000-0002-1374-5138

According to our database1, Dimitar Jetchev authored at least 23 papers between 2007 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic.
J. Cryptol., July, 2023

XorSHAP: Privacy-Preserving Explainable AI for Decision Tree Models.
IACR Cryptol. ePrint Arch., 2023

Falkor: Federated Learning Secure Aggregation Powered by AES-CTR GPU Implementation.
IACR Cryptol. ePrint Arch., 2023

Revisiting Key Decomposition Techniques for FHE: Simpler, Faster and More Generic.
IACR Cryptol. ePrint Arch., 2023

Falkor: Federated Learning Secure Aggregation Powered by AESCTR GPU Implementation.
Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2023

2022
XORBoost: Tree Boosting in the Multiparty Computation Setting.
Proc. Priv. Enhancing Technol., 2022

2021
GenoPPML - a framework for genomic privacy-preserving machine learning.
IACR Cryptol. ePrint Arch., 2021

Manticore: Efficient Framework for Scalable Secure Multiparty Computation Protocols.
IACR Cryptol. ePrint Arch., 2021

2020
CHIMERA: Combining Ring-LWE-based Fully Homomorphic Encryption Schemes.
J. Math. Cryptol., 2020

2019
Simulating Homomorphic Evaluation of Deep Learning Predictions.
IACR Cryptol. ePrint Arch., 2019

2017
Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem.
IACR Cryptol. ePrint Arch., 2017

High-Precision Privacy-Preserving Real-Valued Function Evaluation.
IACR Cryptol. ePrint Arch., 2017

2016
Isogeny graphs of ordinary abelian varieties.
IACR Cryptol. ePrint Arch., 2016

2015
On Graphs of Isogenies of Principally Polarizable Abelian Surfaces and the Discrete Logarithm Problem.
CoRR, 2015

2013
How to Fake Auxiliary Input.
IACR Cryptol. ePrint Arch., 2013

2012
Collision Bounds for the Additive Pollard Rho Algorithm for Solving Discrete Logarithms.
IACR Cryptol. ePrint Arch., 2012

Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Understanding Adaptivity: Random Systems Revisited.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Hardness of Computing Individual Bits for Pairing-based One-way Functions.
IACR Cryptol. ePrint Arch., 2011

2008
Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group.
Proceedings of the Pairing-Based Cryptography, 2008

Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys.
Proceedings of the Advances in Cryptology, 2008

2007
On the Bits of Elliptic Curve Diffie-Hellman Keys.
Proceedings of the Progress in Cryptology, 2007


  Loading...