Vladimir Kolesnikov

Orcid: 0000-0002-0211-1244

Affiliations:
  • Georgia Institute of Technology, GA, USA


According to our database1, Vladimir Kolesnikov authored at least 115 papers between 2004 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Block-Accumulate Codes: Accelerated Linear Codes for PCGs and ZK.
IACR Cryptol. ePrint Arch., 2025

Towards Building Efficient SCALES Protocols.
IACR Cryptol. ePrint Arch., 2025

Stationary Syndrome Decoding for Improved PCGs.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Multiparty Garbling from OT with Linear Scaling and RAM Support.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Distance-Aware OT with Application to Fuzzy PSI.
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

Toss: Garbled PIR from Table-Only Stacking.
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

2024
LogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK.
IACR Cryptol. ePrint Arch., 2024

Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Malicious Security for SCALES - Outsourced Computation with Ephemeral Servers.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

sfLogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Tri-State Circuits: A Better Model of Computation for Garbling.
IACR Cryptol. ePrint Arch., 2023

Adaptive Garbled Circuits and Garbled RAM from Non-Programmable Random Oracles.
IACR Cryptol. ePrint Arch., 2023

Angler: Dark Pool Resource Allocation.
Proceedings of the IEEE/ACM Symposium on Edge Computing, 2023

Fast ORAM with Server-Aided Preprocessing and Pragmatic Privacy-Efficiency Trade-Off.
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2023

Tri-State Circuits - A Circuit Model that Captures RAM.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Towards Generic MPC Compilers via Variable Instruction Set Architectures (VISAs).
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

Batchman and Robin: Batched and Non-batched Branching for Interactive ZK.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Special issue: Security and Cryptography for Networks - SCN 2020.
J. Comput. Secur., 2022

Selected papers from CSCML 2020, the 4th International Symposium on Cyber Security Cryptology and Machine Learning.
Inf. Comput., 2022

Zero Knowledge for Everything and Everyone: Fast ZK Processor with Cached RAM for ANSI C Programs.
IACR Cryptol. ePrint Arch., 2022

SCALES - MPC with Small Clients and Larger Ephemeral Servers.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

EZEE: Epoch Parallel Zero Knowledge for ANSI C.
Proceedings of the 7th IEEE European Symposium on Security and Privacy, 2022

EpiGRAM: Practical Garbled RAM.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Garbled Circuits with Sublinear Evaluator.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Auditable, Available and Resilient Private Computation on the Blockchain via MPC.
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

2021
Practical Garbled RAM: GRAM with O(log<sup>2</sup> n) Overhead.
IACR Cryptol. ePrint Arch., 2021

PrORAM: Fast O(log n) Private Coin ZK ORAM.
IACR Cryptol. ePrint Arch., 2021

LogStack: Stacked Garbling with O(b log b) Computation.
IACR Cryptol. ePrint Arch., 2021

Fuzzy Labeled Private Set Intersection with Applications to Private Real-Time Biometric Search.
Proceedings of the 30th USENIX Security Symposium, 2021

Zero Knowledge for Everything and Everyone: Fast ZK Processor with Cached ORAM for ANSI C Programs.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Masked Triples - Amortizing Multiplication Triples Across Conditionals.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

sf LogStack: Stacked Garbling with O(b log b) Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Efficient Generic Arithmetic for KKW - Practical Linear MPC-in-the-Head NIZK on Commodity Hardware Without Trusted Setup.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2021

One Hot Garbling.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Garbling, Stacked and Staggered - Faster k-out-of-n Garbled Function Evaluation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

PrORAM - Fast P(log<i>n</i>) Authenticated Shares ZK ORAM.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

Cryptographic Key Derivation from Biometric Inferences for Remote Authentication.
Proceedings of the ASIA CCS '21: ACM Asia Conference on Computer and Communications Security, 2021

2020
Stacked Garbling for Disjunctive Zero-Knowledge Proofs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Stacked Garbling - Garbled Circuit Proportional to Longest Execution Path.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

A 2.1 KHz Zero-Knowledge Processor with BubbleRAM.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

MOTIF: (Almost) Free Branching in GMW - Via Vector-Scalar Multiplication.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Perennial secure multi-party computation of universal Turing machine.
Theor. Comput. Sci., 2019

Addressing the Fragmentation Problem in Distributed and Decentralized Edge Computing: A Vision.
Proceedings of the IEEE International Conference on Cloud Engineering, 2019

Covert Security with Public Verifiability: Faster, Leaner, and Simpler.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Scalable Private Set Union from Symmetric-Key Techniques.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Resilient End-to-End Message Protection for Cyber-Physical System Communications.
IEEE Trans. Smart Grid, 2018

Free IF: How to Omit Inactive Branches and Implement S-Universal Garbled Circuit (Almost) for Free.
IACR Cryptol. ePrint Arch., 2018

A Pragmatic Introduction to Secure Multi-Party Computation.
Found. Trends Priv. Secur., 2018

SWiM: Secure Wildcard Pattern Matching from OT Extension.
Proceedings of the Financial Cryptography and Data Security, 2018

Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

$$\mathsf {Free\ }{} \mathtt{IF} $$ : How to Omit Inactive Branches and Implement <i>S</i> -Universal Garbled Circuit (Almost) for Free.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Hashing Garbled Circuits for Free.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

DUPLO: Unifying Cut-and-Choose for Garbled Circuits.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Overlaying Conditional Circuit Clauses for Secure Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Overlaying Circuit Clauses for Secure Computation.
IACR Cryptol. ePrint Arch., 2016

Efficient Batched Oblivious PRF with Applications to Private Set Intersection.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Attribute-based Key Exchange with General Policies.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Richer Efficiency/Security Trade-offs in 2PC.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Malicious-Client Security in Blind Seer: A Scalable Private DBMS.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

Love All, Trust Few: on Trusting Intermediaries in HTTP.
Proceedings of the 2015 ACM SIGCOMM Workshop on Hot Topics in Middleboxes and Network Function Virtualization, 2015

Public Verifiability in the Covert Model (Almost) for Free.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

On Cut-and-Choose Oblivious Transfer and Its Variants.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Blind Seer: A Scalable Private DBMS.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Efficient Network-Based Enforcement of Data Access Rights.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Secure Key Exchange and Sessions without Credentials.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Amortizing Garbled Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design.
J. Comput. Secur., 2013

Towards Efficient Private Distributed Computation on Unbounded Input Streams.
IACR Cryptol. ePrint Arch., 2013

TSAF: Tamper-resistant and scalable mutual authentication framework for plug-in EV charging.
Proceedings of the IEEE Fourth International Conference on Smart Grid Communications, 2013

Improved OT Extension for Transferring Short Secrets.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract).
Proceedings of the Applied Cryptography and Network Security, 2013

2012
MAC aggregation protocols resilient to DoS attacks.
Int. J. Secur. Networks, 2012

Efficient Private Distributed Computation on Unbounded Input Streams
CoRR, 2012

On The Limits of Privacy Provided by Order-Preserving Encryption.
Bell Labs Tech. J., 2012

Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Resilient end-to-end message protection for large-scale cyber-physical system communications.
Proceedings of the IEEE Third International Conference on Smart Grid Communications, 2012

Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

MAC Aggregation with Message Multiplicity.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

Secure two-party computation in sublinear (amortized) time.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

Efficient Verification of Input Consistency in Server-Assisted Secure Function Evaluation.
Proceedings of the Cryptology and Network Security, 11th International Conference, 2012

2011
Securing Host-Based Mobility and Multi-Homing Protocols against On-Path Attackers.
J. Commun., 2011

IBAKE: Identity-Based Authenticated Key Exchange Protocol.
IACR Cryptol. ePrint Arch., 2011

Secure Computation with Sublinear Amortized Work.
IACR Cryptol. ePrint Arch., 2011

A Survey and Analysis of Media Keying Techniques in the Session Initiation Protocol (SIP).
IEEE Commun. Surv. Tutorials, 2011

MAC aggregation resilient to DoS attacks.
Proceedings of the IEEE Second International Conference on Smart Grid Communications, 2011

SSTP: A scalable and secure transport protocol for smart grid data collection.
Proceedings of the IEEE Second International Conference on Smart Grid Communications, 2011

Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation.
Proceedings of the Innovations in Computer Science, 2011

2010
Efficient Secure Two-Party Computation with Untrusted Hardware Tokens (Full Version).
Proceedings of the Towards Hardware-Intrinsic Security - Foundations and Practice, 2010

From Dust to Dawn: Practically Efficient Two-Party Secure Function Evaluation Protocols and their Modular Design.
IACR Cryptol. ePrint Arch., 2010

Garbled Circuits for Leakage-Resilience: Hardware Implementation and Evaluation of One-Time Programs.
IACR Cryptol. ePrint Arch., 2010

A secure decentralized data-centric information infrastructure for smart grid.
IEEE Commun. Mag., 2010

Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

A Security Enhancement and Proof for Authentication and Key Agreement (AKA).
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Brief announcement: swarming secrets.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

A secure and lightweight scheme for media keying in the session initiation protocol (SIP): work in progress.
Proceedings of the Principles, 2010

Embedded SFE: Offloading Server and Network Using Hardware Tokens.
Proceedings of the Financial Cryptography and Data Security, 14th International Conference, 2010

Garbled Circuits for Leakage-Resilience: Hardware Implementation and Evaluation of One-Time Programs - (Full Version).
Proceedings of the Cryptographic Hardware and Embedded Systems, 2010

2009
One-round secure comparison of integers.
J. Math. Cryptol., 2009

Advances and impact of secure function evaluation.
Bell Labs Tech. J., 2009

Efficient privacy-preserving classification of ECG signals.
Proceedings of the First IEEE International Workshop on Information Forensics and Security, 2009

MAC Precomputation with Applications to Secure Memory.
Proceedings of the Information Security, 12th International Conference, 2009

Secure Evaluation of Private Linear Branching Programs with Medical Applications.
Proceedings of the Computer Security, 2009

Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima.
Proceedings of the Cryptology and Network Security, 8th International Conference, 2009

Swarming secrets.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Improved Garbled Circuit: Free XOR Gates and Applications.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Password Mistyping in Two-Factor-Authenticated Key Exchange.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

A Practical Universal Circuit Construction and Secure Evaluation of Private Functions.
Proceedings of the Financial Cryptography and Data Security, 12th International Conference, 2008

2006
Secure two-party computation and communication.
PhD thesis, 2006

Key Exchange Using Passwords and Long Keys.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Conditional Encrypted Mapping and Comparing Encrypted Numbers.
Proceedings of the Financial Cryptography and Data Security, 2006

2005
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation.
Proceedings of the Advances in Cryptology, 2005

2004
Strong Conditional Oblivious Transfer and Computing on Intervals.
Proceedings of the Advances in Cryptology, 2004


  Loading...