Stanislav Peceny

Orcid: 0009-0002-6247-4255

According to our database1, Stanislav Peceny authored at least 9 papers between 2017 and 2024.

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

2024
Efficient Permutation Correlations and Batched Random Access for Two-Party Computation.
IACR Cryptol. ePrint Arch., 2024

Logstar: Efficient Linear* Time Secure Merge.
IACR Cryptol. ePrint Arch., 2024

2023
Towards Generic MPC Compilers via Variable Instruction Set Architectures (VISAs).
IACR Cryptol. ePrint Arch., 2023

Fast ORAM with Server-aided Preprocessing and Pragmatic Privacy-Efficiency Trade-off.
IACR Cryptol. ePrint Arch., 2023

2022
Communication Efficient Secure Logistic Regression.
IACR Cryptol. ePrint Arch., 2022

2021
Garbling, Stacked and Staggered: Faster k-out-of-n Garbled Function Evaluation.
IACR Cryptol. ePrint Arch., 2021

Masked Triples: Amortizing Multiplication Triples across Conditionals.
IACR Cryptol. ePrint Arch., 2021

2020
MOTIF: (Almost) Free Branching in GMW via Vector-Scalar Multiplication.
IACR Cryptol. ePrint Arch., 2020

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


  Loading...