Shai Halevi

From MaRDI portal
Person:421034

Available identifiers

zbMath Open halevi.shaiDBLP65/4781WikidataQ18719457 ScholiaQ18719457MaRDI QIDQ421034

List of research outcomes





PublicationDate of PublicationType
Achievable \textsf{CCA2} relaxation for homomorphic encryption2024-12-27Paper
Weighted secret sharing from wiretap channels2024-11-22Paper
SPRINT: high-throughput robust distributed Schnorr signatures2024-11-13Paper
Security with functional re-encryption from CPA2024-08-02Paper
Additive randomized encodings and their applications2024-02-02Paper
Random-index oblivious RAM2023-08-14Paper
Achievable \textsf{CCA2} relaxation for homomorphic encryption2023-08-14Paper
Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation2023-04-13Paper
Random-index PIR and applications2023-04-13Paper
Homomorphic Encryption Standard2022-11-02Paper
Practical non-interactive publicly verifiable secret sharing with thousands of parties2022-08-30Paper
YOSO: You only speak once. Secure MPC with stateless ephemeral roles2022-04-22Paper
Homomorphic Encryption2022-01-12Paper
Can a public blockchain keep a secret?2021-12-01Paper
Round-optimal secure multi-party computation2021-07-30Paper
Bootstrapping for helib2021-04-07Paper
Homomorphic encryption for finite automata2020-05-05Paper
On fully secure MPC with solitary output2020-04-30Paper
Compressible FHE with applications to PIR2020-04-30Paper
An improved RNS variant of the BFV homomorphic encryption scheme2020-01-28Paper
Best possible information-theoretic MPC2018-12-06Paper
Round-optimal secure multi-party computation2018-09-26Paper
Faster homomorphic linear transformations in HElib2018-09-12Paper
MMH: Software message authentication in the Gbit/second rates2018-05-09Paper
Non-interactive multiparty computation without correlated randomness2018-02-23Paper
Four round secure computation without setup2018-01-19Paper
On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input2018-01-05Paper
Potential function analysis of greedy hot-potato routing2017-09-29Paper
Maintaining authenticated communication in the presence of break-ins2017-09-29Paper
Cryptanalyses of Candidate Branching Program Obfuscators2017-06-23Paper
Spooky Encryption and Its Applications2016-11-09Paper
Candidate indistinguishability obfuscation and functional encryption for all circuits2016-07-04Paper
Secure multiparty computation with general interaction patterns2016-04-15Paper
Functional Encryption Without Obfuscation2016-04-08Paper
Private Database Access with HE-over-ORAM Architecture2016-03-10Paper
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations2015-12-10Paper
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing2015-11-11Paper
Bootstrapping for HElib2015-09-30Paper
Graph-Induced Multilinear Maps from Lattices2015-07-06Paper
Clock synchronization with faults and recoveries (extended abstract)2015-03-03Paper
Private approximation of NP-hard functions2015-02-27Paper
Optimizing ORAM and Using It Efficiently for Secure Computation2014-08-19Paper
Algorithms in HElib2014-08-07Paper
On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input2014-08-07Paper
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits2014-07-30Paper
Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits2014-05-27Paper
Garbled RAM revisited2014-05-27Paper
Two-round secure MPC from indistinguishability obfuscation2014-02-18Paper
Private database queries using somewhat homomorphic encryption2014-01-24Paper
Discrete Gaussian leftover hash lemma over infinite domains2013-12-10Paper
Attribute-based encryption for circuits from multilinear maps2013-09-17Paper
Candidate Multilinear Maps from Ideal Lattices2013-05-31Paper
Packed ciphertexts in LWE-based homomorphic encryption2013-04-19Paper
Ring switching in BGV-style homomorphic encryption2012-09-25Paper
Homomorphic evaluation of the AES circuit2012-09-25Paper
Better bootstrapping in fully homomorphic encryption2012-07-20Paper
Fully homomorphic encryption with polylog overhead2012-06-29Paper
Leakage-Tolerant Interactive Protocols2012-06-15Paper
Smooth projective hashing and two-message oblivious transfer2012-05-23Paper
Program obfuscation with leaky hardware2011-12-02Paper
Collision-free hashing from lattice problems2011-08-19Paper
Secure computation on the web: computing without simultaneous interaction2011-08-12Paper
Implementing Gentry's fully-homomorphic encryption scheme2011-05-27Paper
After-the-fact leakage in public-key encryption2011-05-19Paper
One-pass HMQV and asymmetric key-wrapping2011-03-15Paper
The random oracle methodology, revisited.2011-02-01Paper
\(i\)-hop homomorphic encryption and rerandomizable Yao circuits2010-08-24Paper
Fully homomorphic encryption over the integers2010-06-01Paper
A simple BGN-type cryptosystem from LWE2010-06-01Paper
More on key wrapping2009-12-09Paper
Theory of Cryptography2009-05-14Paper
Topics in Cryptology – CT-RSA 20042009-05-07Paper
Invertible Universal Hashing and the TET Encryption Mode2009-03-10Paper
Hierarchical Identity Based Encryption with Polynomially Many Levels2009-03-03Paper
Circular-Secure Encryption from Decision Diffie-Hellman2009-02-10Paper
Universally Composable Password-Based Key Exchange2008-05-06Paper
Cryptanalysis of ISO/IEC 9796-12008-04-16Paper
Threshold RSA for Dynamic and Ad-Hoc Groups2008-04-15Paper
On Seed-Incompressible Functions2008-03-05Paper
Degradation and Amplification of Computational Hardness2008-03-05Paper
Advances in Cryptology - CRYPTO 20032007-11-28Paper
Chosen‐Ciphertext Security from Identity‐Based Encryption2007-10-22Paper
Advances in Cryptology - EUROCRYPT 20042007-09-25Paper
Strengthening Digital Signatures Via Randomized Hashing2007-09-04Paper
Mitigating Dictionary Attacks on Password-Protected Local Storage2007-09-04Paper
A forward-secure public-key encryption scheme2007-08-20Paper
Topics in Cryptology – CT-RSA 20062007-02-12Paper
Exposure-resilient functions and all-or-nothing transforms2006-03-01Paper
Computing inverses over a shared secret modulus2006-03-01Paper
Progress in Cryptology - INDOCRYPT 20042005-12-22Paper
Theory of Cryptography2005-12-07Paper
Theory of Cryptography2005-12-07Paper
https://portal.mardi4nfdi.de/entity/Q30463552004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44741642004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44348802003-11-26Paper
https://portal.mardi4nfdi.de/entity/Q44091402003-06-30Paper
https://portal.mardi4nfdi.de/entity/Q47854652003-02-04Paper
https://portal.mardi4nfdi.de/entity/Q45425392002-09-24Paper
https://portal.mardi4nfdi.de/entity/Q45367972002-07-28Paper
https://portal.mardi4nfdi.de/entity/Q49418572000-07-26Paper
Efficient commitment schemes with bounded sender and unbounded receiver2000-05-22Paper
Maintaining authenticated communication in the presence of break-ins2000-05-08Paper
https://portal.mardi4nfdi.de/entity/Q42493371999-06-17Paper
Secure Hash-and-Sign Signatures Without the Random Oracle1999-01-01Paper
Potential function analysis of greedy hot-potato routing1998-08-03Paper
https://portal.mardi4nfdi.de/entity/Q43645461998-06-25Paper
https://portal.mardi4nfdi.de/entity/Q43645451998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43434251997-11-23Paper

Research outcomes over time

This page was built for person: Shai Halevi