| Publication | Date of Publication | Type |
|---|
| The effectiveness of Lloyd-type methods for the k-means problem | 2026-05-29 | Paper |
| Cryptography from anonymity | 2026-05-29 | Paper |
| Replication is not needed: single database, computationally-private information retrieval | 2026-05-21 | Paper |
| Polynomial time approximation schemes for geometric k-clustering | 2026-05-08 | Paper |
| Approximation algorithms for the job interval selection problem and related scheduling problems | 2026-05-08 | Paper |
| Multiparty garbling from OT with linear scaling and RAM support | 2026-02-04 | Paper |
| Towards building scalable constant-round MPC from minimal assumptions via round collapsing | 2026-02-04 | Paper |
Universally composable almost-everywhere secure computation
Journal of Cryptology | 2026-01-23 | Paper |
| Black-box constant-round secure 2PC with succinct communication | 2025-12-02 | Paper |
| Round-optimal black-box multiparty computation from polynomial-time assumptions | 2025-12-02 | Paper |
| Zero-knowledge RAM: doubly efficient and black-box | 2025-12-02 | Paper |
| Query-reusable proof systems | 2025-12-02 | Paper |
| Black-box garbled RAM | 2025-08-05 | Paper |
| Adaptive security, erasures, and network assumptions in communication-local MPC | 2025-07-23 | Paper |
| Dishonest majority constant-round MPC with linear communication from DDH | 2025-07-03 | Paper |
| Simultaneous resettability from one-way functions | 2025-05-20 | Paper |
| Constructing non-malleable commitments: a black-box approach | 2025-05-05 | Paper |
| Asymmetric multi-party computation | 2024-11-22 | Paper |
| Anonymous permutation routing | 2024-08-02 | Paper |
Tri-state circuits. A circuit model that captures RAM
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Succinct arguments for RAM programs via projection codes
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
scientific article; zbMATH DE number 7768361 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
Streaming and unbalanced PSI from function secret sharing
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Prio+: privacy preserving aggregate statistics via Boolean shares
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Authenticated garbling from simple correlations
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
| scientific article; zbMATH DE number 7706037 (Why is no real title available?) | 2023-07-03 | Paper |
How to build a trapdoor function from an encryption scheme
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| Oblivious transfer from trapdoor permutations in minimal rounds | 2023-04-13 | Paper |
| A Combinatorial Characterization of Self-stabilizing Population Protocols | 2023-03-21 | Paper |
| Efficient 3-party distributed ORAM | 2022-12-16 | Paper |
| Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups | 2022-12-16 | Paper |
| On succinct arguments and witness encryption from groups | 2022-11-09 | Paper |
| Adaptively secure computation for RAM programs | 2022-08-30 | Paper |
| \textsc{EpiGRAM}: practical garbled RAM | 2022-08-30 | Paper |
| Garbled circuits with sublinear evaluator | 2022-08-30 | Paper |
Secure commitment against a powerful adversary
STACS 92 | 2022-08-18 | Paper |
CNF-FSS and its applications
Public-Key Cryptography – PKC 2022 | 2022-07-08 | Paper |
Succinct non-interactive arguments via linear interactive proofs
Journal of Cryptology | 2022-05-10 | Paper |
| ATLAS: efficient and scalable MPC in the honest majority setting | 2022-04-22 | Paper |
A refined approximation for Euclidean \(k\)-means
Information Processing Letters | 2022-04-07 | Paper |
| Round optimal secure multiparty computation from minimal assumptions | 2022-03-23 | Paper |
| Threshold garbled circuits and ad hoc secure computation | 2021-12-08 | Paper |
| Efficient range-trapdoor functions and applications: rate-1 OT and more | 2021-12-01 | Paper |
scientific article; zbMATH DE number 7376020 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-28 | Paper |
Lower and upper bounds on the randomness complexity of private computations of AND
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
| Adaptive garbled RAM from laconic oblivious transfer | 2020-06-30 | Paper |
| Continuously non-malleable codes in the split-state model from minimal assumptions | 2020-06-30 | Paper |
Oblivious sampling with applications to two-party k-means clustering
Journal of Cryptology | 2020-06-15 | Paper |
| UC-secure multiparty computation from one-way functions using stateless tokens | 2020-05-05 | Paper |
| Lower and upper bounds on the randomness complexity of private computations of AND | 2020-04-30 | Paper |
Efficient error-correcting codes for sliding windows
SIAM Journal on Discrete Mathematics | 2020-03-26 | Paper |
| Reusable non-interactive secure computation | 2020-03-09 | Paper |
| Trapdoor hash functions and their applications | 2020-03-09 | Paper |
| Universally composable secure computation with corrupted tokens | 2020-03-09 | Paper |
| Cryptographic sensing | 2020-03-09 | Paper |
| Private anonymous data access | 2020-02-06 | Paper |
A stable marriage requires communication
Games and Economic Behavior | 2019-12-12 | Paper |
Population stability. Regulating size in the presence of an adversary
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| On the (in)security of hash-based oblivious RAM and a new balancing scheme | 2019-05-10 | Paper |
| Non-interactive secure computation from one-way functions | 2019-01-23 | Paper |
| Round optimal black-box ``commit-and-prove'' | 2018-12-11 | Paper |
| Information-theoretic broadcast with dishonest majority for long messages | 2018-12-11 | Paper |
Improved algorithms for optimal embeddings
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Proactive secure multiparty computation with a dishonest majority | 2018-10-17 | Paper |
Matrix balancing in \(L_p\) norms: bounding the convergence rate of Osborne's iteration
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Coding for Interactive Communication Correcting Insertions and Deletions
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
| On the message complexity of secure multiparty computation | 2018-05-16 | Paper |
Space-time tradeoffs for distributed verification
Lecture Notes in Computer Science | 2018-04-12 | Paper |
Efficient robust secret sharing from expander graphs
Cryptography and Communications | 2018-01-29 | Paper |
| Round-optimal secure two-party computation from trapdoor permutations | 2018-01-19 | Paper |
| Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds | 2018-01-19 | Paper |
| Resettably-sound resettable zero knowledge in constant rounds | 2018-01-19 | Paper |
| Coding for interactive communication correcting insertions and deletions | 2017-12-19 | Paper |
| Provably Secure Virus Detection: Using The Observer Effect Against Malware. | 2017-12-19 | Paper |
| Four-round concurrent non-malleable commitments from one-way functions | 2017-11-15 | Paper |
| Black-box parallel garbled RAM | 2017-11-15 | Paper |
A randomized online quantile summary in O((1/) (1/)) words
Theory of Computing | 2017-11-14 | Paper |
| The price of low communication in secure multi-party computation | 2017-11-03 | Paper |
Brief announcement: Secure self-stabilizing computation
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
A Stable Marriage Requires Communication
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Memory-efficient and self-stabilizing network RESET (extended abstract)
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Faster computation on directed networks of automata
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
Randomness vs. fault-tolerance
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Brief announcement: Proactive secret sharing with a dishonest majority
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Brief announcement: Space-time tradeoffs for distributed verification
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Streaming k-means on well-clusterable data | 2017-09-29 | Paper |
| Zero-one laws for sliding windows and universal sketches | 2017-08-31 | Paper |
A randomized online quantile summary in \(O(\frac 1\varepsilon\log\frac 1\varepsilon)\) words
(available as arXiv preprint) | 2017-08-31 | Paper |
Error-Correcting Codes for Automatic Control
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Unconditional UC-secure computation with (stronger-malicious) PUFs
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Circuit-private multi-key FHE
Lecture Notes in Computer Science | 2017-06-13 | Paper |
The hidden graph model: communication locality and optimal resiliency with adaptive faults
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Secure Message Transmission With Small Public Discussion
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Optimal Coding for Streaming Authentication and Interactive Communication
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Adaptively secure garbled circuits from one-way functions
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Concurrent non-malleable commitments (and more) in 3 rounds
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Proactive Secret Sharing with a Dishonest Majority
Lecture Notes in Computer Science | 2016-10-21 | Paper |
High-precision secure computation of satellite collision probabilities
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Lower bounds for high dimensional nearest neighbor search and related problems
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Computational complexity and knowledge complexity (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Simple and efficient leader election in the full information model
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Unconditionally secure computation with reduced interaction
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Private large-scale databases with distributed searchable symmetric encryption
Topics in Cryptology - CT-RSA 2016 | 2016-04-08 | Paper |
Adaptive security with quasi-optimal rate
Theory of Cryptography | 2016-03-23 | Paper |
Fast distributed almost stable matchings
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Communication-optimal proactive secret sharing for dynamic groups
Applied Cryptography and Network Security | 2016-03-10 | Paper |
Universal service-providers for database private information retrieval (extended abstract)
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
Amortizing randomness in private multiparty computations
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
SIAM Journal on Discrete Mathematics | 2016-02-19 | Paper |
Almost-everywhere secure computation with edge corruptions
Journal of Cryptology | 2016-01-11 | Paper |
Impossibility of black-box simulation against leakage attacks
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Round-optimal black-box two-party computation
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Cryptography with One-Way Communication
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Incoercible multi-party computation and universally composable receipt-free voting
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Efficient and secure authenticated key exchange using weak passwords
Journal of the ACM | 2015-12-07 | Paper |
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM | 2015-10-30 | Paper |
Executable proofs, input-size hiding secure computation and a new ideal world
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Broadcast (and round) efficient verifiable secret sharing
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Locally decodable codes for edit distance
Lecture Notes in Computer Science | 2015-09-24 | Paper |
Weighted sampling without replacement from data streams
Information Processing Letters | 2015-09-15 | Paper |
Optimal and efficient clock synchronization under drifting clocks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
How to withstand mobile virus attacks, revisited
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Fast and unconditionally secure anonymous channel
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Garbled RAM from one-way functions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Privacy amplification with asymptotically optimal entropy loss
Journal of the ACM | 2015-08-14 | Paper |
Non-committing encryption from -hiding
Theory of Cryptography | 2015-07-06 | Paper |
Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way
Theory of Cryptography | 2015-07-06 | Paper |
Black-box non-black-box zero knowledge
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
How to withstand mobile virus attacks (extended abstract)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Local correctability of expander codes
Information and Computation | 2015-06-09 | Paper |
Efficient Error-Correcting Codes for Sliding Windows
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Authenticated adversarial routing
Journal of Cryptology | 2015-01-07 | Paper |
Position-based cryptography
SIAM Journal on Computing | 2014-11-14 | Paper |
On selective-opening attacks against encryption schemes
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Communication-efficient MPC for general adversary structures
Lecture Notes in Computer Science | 2014-10-14 | Paper |
On linear-size pseudorandom generators and hardcore functions
Theoretical Computer Science | 2014-10-06 | Paper |
How to catch \(L_2\)-heavy-hitters on sliding windows
Theoretical Computer Science | 2014-10-06 | Paper |
Cryptography in the multi-string model
Journal of Cryptology | 2014-09-25 | Paper |
Privacy amplification with asymptotically optimal entropy loss
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Zero-one frequency laws
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Measuring independence of datasets
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Maliciously circuit-private FHE
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Secure multi-party computation with identifiable abort
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Extracting correlations
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
On Input Indistinguishable Proof Systems
Automata, Languages, and Programming | 2014-07-01 | Paper |
Position-based quantum cryptography: impossibility and constructions
SIAM Journal on Computing | 2014-06-04 | Paper |
Garbled RAM revisited
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Cross-domain secure computation
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
4-round resettably-sound zero knowledge
Theory of Cryptography | 2014-02-18 | Paper |
Locally updatable and locally decodable codes
Theory of Cryptography | 2014-02-18 | Paper |
Statistical concurrent non-malleable zero knowledge
Theory of Cryptography | 2014-02-18 | Paper |
The effectiveness of Lloyd-type methods for the \(k\)-means problem
Journal of the ACM | 2014-02-17 | Paper |
New techniques for noninteractive zero-knowledge
Journal of the ACM | 2014-02-17 | Paper |
Constant-round concurrent zero knowledge in the bounded player model
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Building lossy trapdoor functions from lossy encryption
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Approximating Large Frequency Moments with Pick-and-Drop Sampling
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Generalizing the layering method of Indyk and Woodruff: recursive sketches for frequency-based vectors on streams
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Optimal coding for streaming authentication and interactive communication
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Nearly simultaneously resettable black-box zero knowledge
Automata, Languages, and Programming | 2013-08-12 | Paper |
Robust pseudorandom generators
Automata, Languages, and Programming | 2013-08-06 | Paper |
How hard is counting triangles in the streaming model?
Automata, Languages, and Programming | 2013-08-06 | Paper |
Local correctability of expander codes
Automata, Languages, and Programming | 2013-08-06 | Paper |
Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
Journal of Cryptology | 2013-06-27 | Paper |
How to catch \(L _{2}\)-heavy-hitters on sliding windows
Lecture Notes in Computer Science | 2013-06-11 | Paper |
On linear-size pseudorandom generators and hardcore functions
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
How to garble RAM programs?
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Cryptography using \texttt{CAPTCHA} puzzles
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Concurrent zero knowledge in the bounded player model
Theory of Cryptography | 2013-03-18 | Paper |
Succinct non-interactive arguments via linear interactive proofs
Theory of Cryptography | 2013-03-18 | Paper |
Distributed Oblivious RAM for Secure Two-Party Computation
Theory of Cryptography | 2013-03-18 | Paper |
Revisiting lower and upper bounds for selective decommitments
Theory of Cryptography | 2013-03-18 | Paper |
Edge Fault Tolerance on Sparse Networks
Automata, Languages, and Programming | 2012-11-01 | Paper |
Multiparty proximity testing with dishonest majority from equality testing
Automata, Languages, and Programming | 2012-11-01 | Paper |
Near-optimal radio use for wireless network synchronization
Theoretical Computer Science | 2012-10-11 | Paper |
5PM: secure pattern matching
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Near-linear unconditionally-secure multiparty computation with a dishonest minority
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Impossibility results for static input secure computation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On homomorphic encryption and chosen-ciphertext security
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Extended-DDH and lossy trapdoor functions
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Correlated product security from any one-way function
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Unconditionally-secure robust secret sharing with compact shares
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Simultaneously resettable arguments of knowledge
Theory of Cryptography | 2012-06-15 | Paper |
Identifying cheaters without an honest majority
Theory of Cryptography | 2012-06-15 | Paper |
Resettable statistical zero knowledge
Theory of Cryptography | 2012-06-15 | Paper |
Optimal sampling from sliding windows
Journal of Computer and System Sciences | 2012-05-11 | Paper |
| AMS without 4-wise independence on product domains | 2012-01-23 | Paper |
Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Deterministic and energy-optimal wireless synchronization
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Public key locally decodable codes with short keys
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Position-based quantum cryptography: impossibility and constructions
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Constant-rate oblivious transfer from noisy channels
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Secure message transmission by public discussion: a brief survey
Lecture Notes in Computer Science | 2011-06-08 | Paper |
Efficient non-interactive secure computation
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Visual cryptography on graphs
Journal of Combinatorial Optimization | 2011-02-18 | Paper |
Effective computations on sliding windows
SIAM Journal on Computing | 2011-01-17 | Paper |
Public-Key Encryption with Efficient Amortized Updates
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Asynchronous throughput-optimal routing in malicious networks
Automata, Languages and Programming | 2010-09-07 | Paper |
Improved fault tolerance and secure computation on sparse networks
Automata, Languages and Programming | 2010-09-07 | Paper |
Password-authenticated session-key generation on the internet in the plain model
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Equivalence of uniform key agreement and composition insecurity
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Low distortion embeddings for edit distance
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Batch codes and their applications
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Universally composable two-party and multi-party secure computation
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Zero-knowledge proofs from secure multiparty computation
SIAM Journal on Computing | 2010-07-07 | Paper |
Secure message transmission with small public discussion
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
On complete primitives for fairness
Theory of Cryptography | 2010-02-24 | Paper |
Efficiency preserving transformations for concurrent non-malleable zero knowledge
Theory of Cryptography | 2010-02-24 | Paper |
Near-Optimal Radio Use for Wireless Network Synchronization
Algorithmic Aspects of Wireless Sensor Networks | 2010-01-05 | Paper |
Position Based Cryptography
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Public Key Encryption That Allows PIR Queries
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Cryptography in the Multi-string Model
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
Theory of Cryptography | 2009-03-03 | Paper |
Authenticated Adversarial Routing
Theory of Cryptography | 2009-03-03 | Paper |
Circular-Secure Encryption from Decision Diffie-Hellman
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Communication Complexity in Algebraic Two-Party Protocols
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Public-Key Locally-Decodable Codes
Lecture Notes in Computer Science | 2009-02-10 | Paper |
| Cryptography with constant computational overhead | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485433 (Why is no real title available?) | 2009-01-05 | Paper |
Low distortion embeddings for edit distance
Journal of the ACM | 2008-12-21 | Paper |
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
Automata, Languages and Programming | 2008-08-19 | Paper |
Visual Cryptography on Graphs
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research | 2008-05-27 | Paper |
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Almost-Everywhere Secure Computation
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Private Searching on Streaming Data
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Private searching on streaming data
Journal of Cryptology | 2007-12-06 | Paper |
Private Locally Decodable Codes
Automata, Languages and Programming | 2007-11-28 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Perfect Non-interactive Zero Knowledge for NP
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Sequential Aggregate Signatures and Multisignatures Without Random Oracles
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
A Survey of Single-Database Private Information Retrieval: Techniques and Applications
Public Key Cryptography – PKC 2007 | 2007-09-04 | Paper |
Non-interactive Zaps and New Techniques for NIZK
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Security in Communication Networks
Lecture Notes in Computer Science | 2006-10-10 | Paper |
| scientific article; zbMATH DE number 5009196 (Why is no real title available?) | 2006-03-01 | Paper |
| scientific article; zbMATH DE number 5009195 (Why is no real title available?) | 2006-03-01 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2209718 (Why is no real title available?) | 2005-09-28 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Minimal complete primitives for secure multi-party computation
Journal of Cryptology | 2005-05-13 | Paper |
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
Machine Learning | 2005-01-19 | Paper |
| scientific article; zbMATH DE number 2079411 (Why is no real title available?) | 2004-07-28 | Paper |
| Stability preserving transformations: Packet routing networks with edge capacities and speeds | 2004-01-14 | Paper |
Amortizing Randomness in Private Multiparty Computations
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
| scientific article; zbMATH DE number 1952887 (Why is no real title available?) | 2003-07-24 | Paper |
| scientific article; zbMATH DE number 1848306 (Why is no real title available?) | 2003-07-10 | Paper |
| scientific article; zbMATH DE number 1842511 (Why is no real title available?) | 2002-12-08 | Paper |
| scientific article; zbMATH DE number 1808213 (Why is no real title available?) | 2002-09-30 | Paper |
Self-Stabilizing Symmetry Breaking in Constant Space
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1775421 (Why is no real title available?) | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1775398 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1775451 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1722670 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1722672 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1670844 (Why is no real title available?) | 2001-12-09 | Paper |
The Las-Vegas Processor Identity Problem (How and When to Be Unique)
Journal of Algorithms | 2001-07-16 | Paper |
Perfect zero-knowledge arguments for NP using any one-way permutation
Journal of Cryptology | 2001-05-20 | Paper |
Universal service-providers for private information retrieval
Journal of Cryptology | 2001-05-13 | Paper |
| scientific article; zbMATH DE number 1559580 (Why is no real title available?) | 2001-03-01 | Paper |
| scientific article; zbMATH DE number 1559545 (Why is no real title available?) | 2001-02-28 | Paper |
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
SIAM Journal on Computing | 2000-10-18 | Paper |
Adaptive packet routing for bursty adversarial traffic
Journal of Computer and System Sciences | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1418313 (Why is no real title available?) | 2000-08-27 | Paper |
Randomness versus fault-tolerance
Journal of Cryptology | 2000-05-08 | Paper |
Reducibility and Completeness in Private Computations
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1394298 (Why is no real title available?) | 2000-01-31 | Paper |
The linear-array conjecture in communication complexity is false
Combinatorica | 1999-12-08 | Paper |
| scientific article; zbMATH DE number 1256773 (Why is no real title available?) | 1999-10-04 | Paper |
Characterizing linear size circuits in terms of privacy
Journal of Computer and System Sciences | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 708806 (Why is no real title available?) | 1999-08-30 | Paper |
| scientific article; zbMATH DE number 708808 (Why is no real title available?) | 1999-08-30 | Paper |
| scientific article; zbMATH DE number 1263232 (Why is no real title available?) | 1999-06-29 | Paper |
Conditional Oblivious Transfer and Timed-Release Encryption
Advances in Cryptology — EUROCRYPT ’99 | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1302843 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1256713 (Why is no real title available?) | 1999-05-18 | Paper |
Log-Space Polynomial End-to-End Communication
SIAM Journal on Computing | 1998-09-21 | Paper |
Computational Complexity and Knowledge Complexity
SIAM Journal on Computing | 1998-09-20 | Paper |
Software protection and simulation on oblivious RAMs
Journal of the ACM | 1998-01-21 | Paper |
Software protection and simulation on oblivious RAMs
Journal of the ACM | 1998-01-21 | Paper |
| scientific article; zbMATH DE number 1088228 (Why is no real title available?) | 1997-11-17 | Paper |
| scientific article; zbMATH DE number 1003302 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 1088249 (Why is no real title available?) | 1997-01-01 | Paper |
| scientific article; zbMATH DE number 871956 (Why is no real title available?) | 1996-10-07 | Paper |
| scientific article; zbMATH DE number 826071 (Why is no real title available?) | 1996-05-21 | Paper |
| scientific article; zbMATH DE number 697825 (Why is no real title available?) | 1995-01-26 | Paper |
| scientific article; zbMATH DE number 549858 (Why is no real title available?) | 1994-04-12 | Paper |
| scientific article; zbMATH DE number 4191080 (Why is no real title available?) | 1991-01-01 | Paper |
