Rafail Ostrovsky

Vitor Pereira

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

A refined approximation for Euclidean k-means.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

Secure Merge in Linear Time and O(log log N) Rounds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

3-Party Distributed ORAM from Oblivious Set Membership.

[BibT_eX]

[DOI]

Daniel Noble

Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Streaming and Unbalanced PSI from Function Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares.

[BibT_eX]

[DOI]

Antigoni Polychroniadou

Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

CNF-FSS and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2022, 2022

EpiGRAM: Practical Garbled RAM.

[BibT_eX]

[DOI]

David Heath

Vladimir Kolesnikov

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.

[BibT_eX]

[DOI]

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

Round-Optimal and Communication-Efficient Multiparty Computation.

[BibT_eX]

[DOI]

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

Adaptively Secure Computation for RAM Programs.

[BibT_eX]

[DOI]

Laasya Bangalore

Oxana Poburinnaya

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

A Linear-Time 2-Party Secure Merge Protocol.

[BibT_eX]

[DOI]

Rohit Nema

Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker.

[BibT_eX]

[DOI]

Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

Authenticated Garbling from Simple Correlations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Universally Composable Almost-Everywhere Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

PSI from Ring-OLE.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Practical Garbled RAM: GRAM with O(log2 n) Overhead.

[BibT_eX]

[DOI]

David Heath

Vladimir Kolesnikov

IACR Cryptol. ePrint Arch., 2021

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Alibi: A Flaw in Cuckoo-Hashing Based Hierarchical ORAM Schemes and a Solution.

[BibT_eX]

[DOI]

Daniel Noble

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Threshold Garbled Circuits and Ad Hoc Secure Computation.

[BibT_eX]

[DOI]

Michele Ciampi

Vipul Goyal

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

ATLAS: Efficient and Scalable MPC in the Honest Majority Setting.

[BibT_eX]

[DOI]

Vipul Goyal

Hanjun Li

Antigoni Polychroniadou

Yifan Song

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Secure Merge with O(n log log n) Secure Operations.

[BibT_eX]

[DOI]

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

Line-Point Zero Knowledge and Its Applications.

[BibT_eX]

[DOI]

Samuel Dittmer

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

ACCO: Algebraic Computation with Comparison.

[BibT_eX]

[DOI]

Antigoni Polychroniadou

Yifan Song

Proceedings of the CCSW@CCS '21: Proceedings of the 2021 on Cloud Computing Security Workshop, 2021

Constant-Overhead Zero-Knowledge for RAM Programs.

[BibT_eX]

[DOI]

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

How to Build a Trapdoor Function from an Encryption Scheme.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

Min-Sum Clustering (With Outliers).

[BibT_eX]

[DOI]

Sandip Banerjee

Proceedings of the Approximation, 2021

2020

Oblivious Sampling with Applications to Two-Party k-Means Clustering.

[BibT_eX]

[DOI]

J. Cryptol., 2020

A PoR/PoS-Hybrid Blockchain: Proof of Reputation with Nakamoto Fallback.

[BibT_eX]

[DOI]

Leonard Kleinrock

IACR Cryptol. ePrint Arch., 2020

Secure merge with O(n log log n) secure operation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More.

[BibT_eX]

[DOI]

Mohammad Hajiabadi

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Round Optimal Secure Multiparty Computation from Minimal Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

A Combinatorial Characterization of Self-stabilizing Population Protocols.

[BibT_eX]

[DOI]

Shaan Mathur

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Oblivious Tight Compaction In O(n) Time with Smaller Constant.

[BibT_eX]

[DOI]

Samuel Dittmer

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Efficient 3-Party Distributed ORAM.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Proof-of-Reputation Blockchain with Nakamoto Fallback.

[BibT_eX]

[DOI]

Leonard Kleinrock

Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020

Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

On Succinct Arguments and Witness Encryption from Groups.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Resource-Restricted Cryptography: Honest-Majority MPC from a CRS (and No Broadcast).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Four-Round Secure Multiparty Computation from General Assumptions.

[BibT_eX]

[DOI]

Michele Ciampi

IACR Cryptol. ePrint Arch., 2019

Private Set Intersection with Linear Communication from General Assumptions.

[BibT_eX]

[DOI]

Daniel Noble

Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, 2019

DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex Policy Controls.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, 2019

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Private Anonymous Data Access.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Cryptographic Sensing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Trapdoor Hash Functions and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Reusable Non-Interactive Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Universally Composable Secure Computation with Corrupted Tokens.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens.

[BibT_eX]

[DOI]

Abhishek Jain

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018

Computing Statistics from Private Data.

[BibT_eX]

[DOI]

Data Sci. J., 2018

Round Optimal Black-Box "Commit-and-Prove".

[BibT_eX]

[DOI]

Dakshita Khurana

Akshayaram Srinivasan

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Information-Theoretic Broadcast with Dishonest Majority for Long Messages.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Proactive Secure Multiparty Computation with a Dishonest Majority.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Population Stability: Regulating Size in the Presence of an Adversary.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

On the Message Complexity of Secure Multiparty Computation.

[BibT_eX]

[DOI]

Manika Mittal

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Adaptive Garbled RAM from Laconic Oblivious Transfer.

[BibT_eX]

[DOI]

Akshayaram Srinivasan

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Cryptographically Secure Detection of Injection Attacks.

[BibT_eX]

[DOI]

Yun Lu

Konstantinos Mitropoulos

Avraham Weinstock

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

ETERNAL: Encrypted Transmission With an Error-correcting, Real-time, Noise-resilient Apparatus on Lightweight Devices.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Multimedia Privacy and Security, 2018

Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation.

[BibT_eX]

[DOI]

Karim Eldefrawy

Proceedings of the From Database to Cyber Security, 2018

Non-interactive Secure Computation from One-Way Functions.

[BibT_eX]

[DOI]

Abhishek Jain

Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017

A Randomized Online Quantile Summary in O((1/ε) log(1/ε)) Words.

[BibT_eX]

[DOI]

Theory Comput., 2017

Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Special Issue: Algorithmic Tools in Cryptography.

[BibT_eX]

[DOI]

Algorithmica, 2017

Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Resettably-Sound Resettable Zero Knowledge in Constant Rounds.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Matrix Balancing in Lp Norms: Bounding the Convergence Rate of Osborne's Iteration.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Space-Time Tradeoffs for Distributed Verification.

[BibT_eX]

[DOI]

Mor Perry

Proceedings of the Structural Information and Communication Complexity, 2017

Brief Announcement: Secure Self-Stabilizing Computation.

[BibT_eX]

[DOI]

Karim Eldefrawy

Muni Venkateswarlu Kumaramangalam

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Circuit-Private Multi-key FHE.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs.

[BibT_eX]

[DOI]

Dakshita Khurana

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

Black-Box Parallel Garbled RAM.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

The Price of Low Communication in Secure Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols.

[BibT_eX]

[DOI]

Nirattaya Khamsemanan

SIAM J. Discret. Math., 2016

Efficient Robust Secret Sharing from Expander Graphs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

On Round-Efficient Non-Malleable Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs.

[BibT_eX]

[DOI]

Dakshita Khurana

IACR Cryptol. ePrint Arch., 2016

Matrix Balancing in Lp Norms: A New Analysis of Osborne's Iteration.

[BibT_eX]

[DOI]

CoRR, 2016

Adaptive Security with Quasi-Optimal Rate.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

High-Precision Secure Computation of Satellite Collision Probabilities.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Proactive Secret Sharing with a Dishonest Majority.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Variability in Data Streams.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Brief Announcement: Proactive Secret Sharing with a Dishonest Majority.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Brief Announcement: Space-Time Tradeoffs for Distributed Verification.

[BibT_eX]

[DOI]

Mor Baruch

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Provably Secure Virus Detection: Using The Observer Effect Against Malware.

[BibT_eX]

[DOI]

Richard J. Lipton

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Coding for Interactive Communication Correcting Insertions and Deletions.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Unconditionally Secure Computation with Reduced Interaction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Private Large-Scale Databases with Distributed Searchable Symmetric Encryption.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

Adaptively Secure Garbled Circuits from One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Concurrent Non-Malleable Commitments (and More) in 3 Rounds.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Weighted sampling without replacement from data streams.

[BibT_eX]

[DOI]

Gregory Vorsanger

Inf. Process. Lett., 2015

Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware.

[BibT_eX]

[DOI]

Richard J. Lipton

IACR Cryptol. ePrint Arch., 2015

A randomized online quantile summary in O(1/ɛ log 1/ɛ) words.

[BibT_eX]

[DOI]

CoRR, 2015

Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way.

[BibT_eX]

[DOI]

Alessandra Scafuro

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Non-committing Encryption from Φ-hiding.

[BibT_eX]

[DOI]

Alon Rosen

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Garbled RAM From One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

A Stable Marriage Requires Communication.

[BibT_eX]

[DOI]

Yannai A. Gonczarowski

Noam Nisan

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Fast Distributed Almost Stable Matchings.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Locally Decodable Codes for Edit Distance.

[BibT_eX]

[DOI]

Anat Paskin-Cherniavsky

Proceedings of the Information Theoretic Security - 8th International Conference, 2015

Black-Box Garbled RAM.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World.

[BibT_eX]

[DOI]

Melissa Chase

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Round-Optimal Black-Box Two-Party Computation.

[BibT_eX]

[DOI]

Silas Richelson

Alessandra Scafuro

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Impossibility of Black-Box Simulation Against Leakage Attacks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Cryptography with One-Way Communication.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2015

Zero-One Laws for Sliding Windows and Universal Sketches.

[BibT_eX]

[DOI]

Alan Roytman

Proceedings of the Approximation, 2015

Communication-Optimal Proactive Secret Sharing for Dynamic Groups.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2015

2014

How to catch L2-heavy-hitters on sliding windows.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Resettably Sound Zero-Knoweldge Arguments from OWFs - the (semi) Black-Box way.

[BibT_eX]

[DOI]

Alessandra Scafuro

IACR Cryptol. ePrint Arch., 2014

Impossibility Results for Leakage-Resilient Zero Knowledge and Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Garbled RAM Revisited, Part II.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Improved Approximation Algorithms for Earth-Mover Distance in Data Streams.

[BibT_eX]

[DOI]

CoRR, 2014

It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems.

[BibT_eX]

[DOI]

CoRR, 2014

Fast distributed almost stable marriages.

[BibT_eX]

[DOI]

CoRR, 2014

Universal Streaming.

[BibT_eX]

[DOI]

Alan Roytman

CoRR, 2014

Privacy preserving protocol for detecting genetic relatives using rare variants.

[BibT_eX]

[DOI]

Bioinform., 2014

Statistical Concurrent Non-malleable Zero Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

4-Round Resettably-Sound Zero Knowledge.

[BibT_eX]

[DOI]

Kai-Min Chung

Rafael Pass

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Locally Updatable and Locally Decodable Codes.

[BibT_eX]

[DOI]

Bhavana Kanukurthi

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Black-box non-black-box zero knowledge.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Efficient Error-Correcting Codes for Sliding Windows.

[BibT_eX]

[DOI]

Alan Roytman

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

On Selective-Opening Attacks against Encryption Schemes.

[BibT_eX]

[DOI]

Vanishree Rao

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Communication-Efficient MPC for General Adversary Structures.

[BibT_eX]

[DOI]

Joshua Lampkins

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Fast and unconditionally secure anonymous channel.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

How to withstand mobile virus attacks, revisited.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Cross-Domain Secure Computation.

[BibT_eX]

[DOI]

Chongwon Cho

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

On Input Indistinguishable Proof Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Garbled RAM Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Maliciously Circuit-Private FHE.

[BibT_eX]

[DOI]

Anat Paskin-Cherniavsky

Beni Paskin-Cherniavsky

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Secure Multi-Party Computation with Identifiable Abort.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles.

[BibT_eX]

[DOI]

J. Cryptol., 2013

Secure End-to-End Communication with Optimal Throughput in Unreliable Networks

[BibT_eX]

[DOI]

CoRR, 2013

Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Revisiting Lower and Upper Bounds for Selective Decommitments.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Distributed Oblivious RAM for Secure Two-Party Computation.

[BibT_eX]

[DOI]

Abishek Kumarasubramanian

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Concurrent Zero Knowledge in the Bounded Player Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Succinct Non-interactive Arguments via Linear Interactive Proofs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Cryptography Using Captcha Puzzles.

[BibT_eX]

[DOI]

Omkant Pandey

Akshay Wadia

Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Broadcast (and Round) Efficient Verifiable Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 7th International Conference, 2013

Robust Pseudorandom Generators.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Local Correctability of Expander Codes.

[BibT_eX]

[DOI]

Mary Wootters

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

How Hard Is Counting Triangles in the Streaming Model?

[BibT_eX]

[DOI]

Dan Vilenchik

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Simultaneous Resettability from One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2013

How to Garble RAM Programs

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2013

Optimal Coding for Streaming Authentication and Interactive Communication.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

How to Catch L 2-Heavy-Hitters on Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

On Linear-Size Pseudorandom Generators and Hardcore Functions.

[BibT_eX]

[DOI]

Joshua Baron

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Building Lossy Trapdoor Functions from Lossy Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

Constant-Round Concurrent Zero Knowledge in the Bounded Player Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

Approximating Large Frequency Moments with Pick-and-Drop Sampling.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

New Techniques for Noninteractive Zero-Knowledge.

[BibT_eX]

[DOI]

J. ACM, 2012

Concurrent Zero Knowledge in the Bounded Player Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Broadcast-Efficient Secure Multiparty Computation.

[BibT_eX]

[DOI]

Clint Givens

IACR Cryptol. ePrint Arch., 2012

Almost-Everywhere Secure Computation with Edge Corruptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Simultaneous Resettability from Collision Resistance.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Identifying Cheaters without an Honest Majority.

[BibT_eX]

[DOI]

Hakan Seyalioglu

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Resettable Statistical Zero Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Simultaneously Resettable Arguments of Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

On the (in)security of hash-based oblivious RAM and a new balancing scheme.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

5PM: Secure Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

Extended-DDH and Lossy Trapdoor Functions.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

On Homomorphic Encryption and Chosen-Ciphertext Security.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Correlated Product Security from Any One-Way Function.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Multiparty Proximity Testing with Dishonest Majority from Equality Testing.

[BibT_eX]

[DOI]

Kina Winoto

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Edge Fault Tolerance on Sparse Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Nearly Simultaneously Resettable Black-Box Zero Knowledge.

[BibT_eX]

[DOI]

Joshua Baron

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Constructing Non-malleable Commitments: A Black-Box Approach.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Unconditionally-Secure Robust Secret Sharing with Compact Shares.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Impossibility Results for Static Input Secure Computation.

[BibT_eX]

[DOI]

Abishek Kumarasubramanian

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority.

[BibT_eX]

[DOI]

Eli Ben-Sasson

Serge Fehr

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

Multi-Server Oblivious RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Deterministic and Energy-Optimal Wireless Synchronization.

[BibT_eX]

[DOI]

Leonid Barenboim

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Streaming k-means on Well-Clusterable Data.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Efficient Non-interactive Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Constant-Rate Oblivious Transfer from Noisy Channels.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Position-Based Quantum Cryptography: Impossibility and Constructions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Secure Message Transmission by Public Discussion: A Brief Survey.

[BibT_eX]

[DOI]

Clint Givens

Proceedings of the Coding and Cryptology - Third International Workshop, 2011

Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Public Key Locally Decodable Codes with Short Keys.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Effective Computations on Sliding Windows.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Throughput-Optimal Routing in Unreliable Networks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Building Injective Trapdoor Functions From Oblivious Transfer.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

How to Catch L_2-Heavy-Hitters on Sliding Windows

[BibT_eX]

[DOI]

CoRR, 2010

Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform

[BibT_eX]

[DOI]

CoRR, 2010

Recursive Sketching For Frequency Moments

[BibT_eX]

[DOI]

CoRR, 2010

Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge.

[BibT_eX]

[DOI]

Omkant Pandey

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

On Complete Primitives for Fairness.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Privacy amplification with asymptotically optimal entropy loss.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Zero-one frequency laws.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Measuring independence of datasets.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

AMS Without 4-Wise Independence on Product Domains.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Public-Key Encryption with Efficient Amortized Updates.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Improved Fault Tolerance and Secure Computation on Sparse Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Asynchronous Throughput-Optimal Routing in Malicious Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Secure Message Transmission with Small Public Discussion.

[BibT_eX]

[DOI]

Clint Givens

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Password-Authenticated Session-Key Generation on the Internet in the Plain Model.

[BibT_eX]

[DOI]

Vipul Goyal

Abhishek Jain

Proceedings of the Advances in Cryptology, 2010

Equivalence of Uniform Key Agreement and Composition Insecurity.

[BibT_eX]

[DOI]

Chongwon Cho

Chen-Kuei Lee

Proceedings of the Advances in Cryptology, 2010

2009

Zero-Knowledge Proofs from Secure Multiparty Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Efficient and secure authenticated key exchange using weak passwords.

[BibT_eX]

[DOI]

J. ACM, 2009

Lossy Trapdoor Functions from Smooth Homomorphic Hash Proof Systems.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2009

Throughput in Asynchronous Networks

[BibT_eX]

[DOI]

CoRR, 2009

Simulation-Based Concurrent Non-malleable Commitments and Decommitments.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Authenticated Adversarial Routing.

[BibT_eX]

[DOI]

Yair Amir

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Optimal sampling from sliding windows.

[BibT_eX]

[DOI]

Carlo Zaniolo

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Extracting Correlations.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Position Based Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

Near-Optimal Radio Use for Wireless Network Synchronization.

[BibT_eX]

[DOI]

Milan Bradonjic

Eddie Kohler

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008

Improved algorithms for optimal embeddings.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Constant-Round Concurrent Non-Malleable Commitments and Decommitments.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Optimal-Rate Coding Theorem For Adversarial Networks in the Public-Key Setting

[BibT_eX]

[DOI]

Yair Amir

CoRR, 2008

Measuring $k$-Wise Independence of Streaming Data

[BibT_eX]

[DOI]

CoRR, 2008

Cryptography with constant computational overhead.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Almost-Everywhere Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

Communication Complexity in Algebraic Two-Party Protocols.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

Public-Key Locally-Decodable Codes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

Circular-Secure Encryption from Decision Diffie-Hellman.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

Visual Cryptography on Graphs.

[BibT_eX]

[DOI]

Daniel Manchala

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

A Survey of Single Database PIR: Techniques and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Algebraic Lower Bounds for Computing on Encrypted Data.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

Succinct Sampling on Streams

[BibT_eX]

[DOI]

Carlo Zaniolo

CoRR, 2007

Zero-knowledge from secure multiparty computation.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

A Survey of Single-Database Private Information Retrieval: Techniques and Applications.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2007

Private Locally Decodable Codes.

[BibT_eX]

[DOI]

Omkant Pandey

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Round Complexity of Authenticated Broadcast with a Dishonest Majority.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Covert Multi-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Smooth Histograms for Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Cryptography in the Multi-string Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Public Key Encryption That Allows PIR Queries.

[BibT_eX]

[DOI]

Dan Boneh

Proceedings of the Advances in Cryptology, 2007

Efficient Arguments without Short PCPs.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

Attribute-based encryption with non-monotonic access structures.

[BibT_eX]

[DOI]

Brent Waters

Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

Secure two-party k-means clustering.

[BibT_eX]

[DOI]

Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Constant-Round Concurrent NMWI and its relation to NMZK.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Concurrent Non-Malleable Witness Indistinguishability and its Applications.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Improved Algorithms for Optimal Embeddings.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

The Effectiveness of Lloyd-Type Methods for the k-Means Problem.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

Cryptography from Anonymity.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

Sequential Aggregate Signatures and Multisignatures Without Random Oracles.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Perfect Non-interactive Zero Knowledge for NP.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Non-interactive Zaps and New Techniques for NIZK.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

Searchable symmetric encryption: improved definitions and efficient constructions.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Computer and Communications Security, 2006

2005

Sufficient Conditions for Collision-Resistant Hashing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Low distortion embeddings for edit distance.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Error-Correcting Codes for Automatic Control.

[BibT_eX]

[DOI]

Leonard J. Schulman

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

Secure Remote Authentication Using Biometric Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

05411 Abstracts Collection -- Anonymous Communication and its Applications.

[BibT_eX]

[DOI]

Andreas Pfitzmann

Proceedings of the Anonymous Communication and its Applications, 09.10. - 14.10.2005, 2005

Private Searching on Streaming Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Batch codes and their applications.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Identity-Based Zero Knowledge.

[BibT_eX]

[DOI]

Michael O. Rabin

Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Efficient Consistency Proofs for Generalized Queries on a Committed Database.

[BibT_eX]

[DOI]

Charles Rackoff

Adam D. Smith

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Public Key Encryption with Keyword Search.

[BibT_eX]

[DOI]

Dan Boneh

Proceedings of the Advances in Cryptology, 2004

Round-Optimal Secure Two-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

2003

Dynamic routing on networks with fixed-size buffers.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Round Efficiency of Multi-party Computation with a Dishonest Majority.

[BibT_eX]

[DOI]

Adam D. Smith

Proceedings of the Advances in Cryptology, 2003

2002

Self-Stabilizing Symmetry Breaking in Constant Space.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Polynomial-time approximation schemes for geometric min-sum median clustering.

[BibT_eX]

[DOI]

J. ACM, 2002

Universally composable two-party and multi-party secure computation.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Forward Secrecy in Password-Only Key Exchange Protocols.

[BibT_eX]

[DOI]

Proceedings of the Security in Communication Networks, Third International Conference, 2002

2001

Universal Service-Providers for Private Information Retrieval.

[BibT_eX]

[DOI]

J. Cryptol., 2001

Stability preserving transformations: packet routing networks with edge capacities and speeds.

[BibT_eX]

[DOI]

Allan Borodin

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems.

[BibT_eX]

[DOI]

Julia Chuzhoy

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

Cryptographic Counters and Applications to Electronic Voting.

[BibT_eX]

[DOI]

Steven A. Myers

Proceedings of the Advances in Cryptology, 2001

Efficient and Non-interactive Non-malleable Commitment.

[BibT_eX]

[DOI]

Adam D. Smith

Proceedings of the Advances in Cryptology, 2001

Robust Non-interactive Zero Knowledge.

[BibT_eX]

[DOI]

Alfredo De Santis

Proceedings of the Advances in Cryptology, 2001

Minimal Complete Primitives for Secure Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

2000

Xor-trees for efficient anonymous multicast and reception.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2000

Reducibility and Completeness in Private Computations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP.

[BibT_eX]

[DOI]

William Aiello

Sandeep N. Bhatt

Sivaramakrishnan Rajagopalan

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Polynomial Time Approximation Schemes for Geometric k-Clustering.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

Single Database Private Information Retrieval Implies Oblivious Transfer.

[BibT_eX]

[DOI]

Tal Malkin

Proceedings of the Advances in Cryptology, 2000

1999

Characterizing Linear Size Circuits in Terms of Pricacy.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract).

[BibT_eX]

[DOI]

Ran Canetti

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces.

[BibT_eX]

[DOI]

Allan Borodin

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems.

[BibT_eX]

[DOI]

Allan Borodin

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Optimal and Efficient Clock Synchronization Under Drifting Clocks.

[BibT_eX]

[DOI]

Boaz Patt-Shamir

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Conditional Oblivious Transfer and Timed-Release Encryption.

[BibT_eX]

[DOI]

Sivaramakrishnan Rajagopalan

Proceedings of the Advances in Cryptology, 1999

On Concurrent Zero-Knowledge with Pre-processing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1999

1998

Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation.

[BibT_eX]

[DOI]

Moni Naor

J. Cryptol., 1998

Universal Service Providers for Database Private Information Retrieval.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1998

Randomness versus Fault-Tolerance.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1998

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Non-Interactive and Non-Malleable Commitment.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Adaptive Packet Routing for Bursty Adversarial Traffic.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Amortizing Randomness in Private Multiparty Computations.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Universal Service-Providers for Database Private Information Retrieval (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Micropayments via Efficient Coin-Flipping.

[BibT_eX]

[DOI]

Richard J. Lipton

Proceedings of the Financial Cryptography, 1998

Fast Digital Identity Revocation (Extended Abstract).

[BibT_eX]

[DOI]

William Aiello

Sachin Lodha

Proceedings of the Advances in Cryptology, 1998

1997

Private Information Storage (Extended Abstract).

[BibT_eX]

[DOI]

Victor Shoup

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Randomness vs. Fault-Tolerance.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Security of Blind Digital Signatures (Extended Abstract).

[BibT_eX]

[DOI]

Ari Juels

Michael Luby

Proceedings of the Advances in Cryptology, 1997

Efficient Anonymous Multicast and Reception (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1997

Deniable Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1997

1996

Software Protection and Simulation on Oblivious RAMs.

[BibT_eX]

[DOI]

Oded Goldreich

J. ACM, 1996

Private Information Storage.

[BibT_eX]

[DOI]

Victor Shoup

IACR Cryptol. ePrint Arch., 1996

Characterizing Linear Size Circuits in Terms of Privacy.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

The Linear-Array Conjecture in Communication Complexity is False.

[BibT_eX]

[DOI]

Nathan Linial

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Self-Stabilizing Algorithms for Synchronous Unidirectional Rings.

[BibT_eX]

[DOI]

Alain J. Mayer

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

Log-space polynomial end-to-end communication.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Faster Computation On Directed Networks of Automata (Extended Abstract).

[BibT_eX]

[DOI]

Daniel Shawcross Wilkerson

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Log-Space Polynomial End-to-End Communication (Abstract).

[BibT_eX]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

1994

Computational Complexity and Knowledge Complexity

[BibT_eX]

[DOI]

Oded Goldreich

Erez Petrank

Electron. Colloquium Comput. Complex., 1994

Simple and efficient leader election in the full information model.

[BibT_eX]

[DOI]

Sridhar Rajagopalan

Umesh V. Vazirani

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Computational complexity and knowledge complexity (extended abstract).

[BibT_eX]

[DOI]

Oded Goldreich

Erez Petrank

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Matching Nuts and Bolts.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract).

[BibT_eX]

[DOI]

Baruch Awerbuch

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Reducibility and Completeness in Multi-Party Private Computations

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

One-Way Fuctions are Essential for Non-Trivial Zero-Knowledge.

[BibT_eX]

[DOI]

Avi Wigderson

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

The Las-Vegas Processor Identity Problem (How and When to Be Unique).

[BibT_eX]

[DOI]

Shay Kutten

Boaz Patt-Shamir

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

Interactive Hashing Simplifies Zero-Knowledge Protocol Design.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1993

1992

Software protection and simulation on oblivious RAMs.

[BibT_eX]

[DOI]

PhD thesis, 1992

Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Secure Commitment Against A Powerful Adversary.

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract).

[BibT_eX]

[DOI]

Moni Naor

Proceedings of the Advances in Cryptology, 1992

Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract).

[BibT_eX]

[DOI]

Shafi Goldwasser

Proceedings of the Advances in Cryptology, 1992

1991

How to Withstand Mobile Virus Attacks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems.

[BibT_eX]

[DOI]

Joan Feigenbaum

Proceedings of the Advances in Cryptology, 1991

1990

Efficient Computation on Oblivious RAMs

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

The (True) Complexity of Statistical Zero Knowledge

[BibT_eX]

[DOI]

Mihir Bellare

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Perfect Zero-Knowledge in Constant Rounds

[BibT_eX]

[DOI]

Mihir Bellare

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Fair Games against an All-Powerful Adversary.

[BibT_eX]

[DOI]

Proceedings of the Advances In Computational Complexity Theory, 1990

1989

Minimum Resource Zero-Knowledge Proofs (Extended Abstract)

[BibT_eX]

[DOI]

Joe Kilian

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

On Necessary Conditions for Secure Distributed Computation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing And Cryptography, 1989

An Efficient Software Protection Scheme.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

1986

HOLMES-I, a prolog-based reason maintenance system for collecting information from multiple experts.

[BibT_eX]

[DOI]