Search

Your search keyword '"Halevi, Shai"' showing total 344 results

Search Constraints

Start Over You searched for: Author "Halevi, Shai" Remove constraint Author: "Halevi, Shai"
344 results on '"Halevi, Shai"'

Search Results

301. Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer

302. How Risky Is the Random-Oracle Model?

303. Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures

304. Improving the Security of Quantum Protocols via Commit-and-Open

305. Position Based Cryptography

306. Public-Key Cryptosystems Resilient to Key Leakage

307. Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model

308. Reconstructing RSA Private Keys from Random Key Bits

309. Games and the Impossibility of Realizable Ideal Functionality

310. Threshold and Proactive Pseudo-Random Permutations

311. Communication Efficient Secure Linear Algebra

312. Secure Computation with Partial Message Loss

313. On Matroids and Non-ideal Secret Sharing

314. Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness

315. On the Complexity of Parallel Hardness Amplification for One-Way Functions

316. Finding Pessiland

317. Resource Fairness and Composability of Cryptographic Protocols

318. Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols : (Extended Abstract)

319. Generalized Environmental Security from Number Theoretic Assumptions

320. Round-Optimal and Efficient Verifiable Secret Sharing

321. Efficient Multi-party Computation with Dispute Control

322. Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation

323. Perfectly Secure Password Protocols in the Bounded Retrieval Model

324. Polylogarithmic Private Approximations and Efficient Matching

325. Calibrating Noise to Sensitivity in Private Data Analysis

326. Intrusion-Resilience Via the Bounded-Storage Model

327. Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

328. On Error Correction in the Exponent

329. Key Exchange Using Passwords and Long Keys

330. On the Relation Between the Ideal Cipher and the Random Oracle Models

331. Efficient Blind and Partially Blind Signatures Without Random Oracles

332. Mercurial Commitments: Minimal Assumptions and Efficient Constructions

333. Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles

334. Separating Sources for Encryption and Secret Sharing

335. PRF Domain Extension Using DAGs

336. Interactive Zero-Knowledge with Restricted Random Oracles

337. Chosen-Ciphertext Security from Tag-Based Encryption

338. Non-interactive Zero-Knowledge from Homomorphic Encryption

339. Concurrent Zero Knowledge Without Complexity Assumptions

340. Abstraction in Cryptography

341. POSTER

342. 'Make Sure DSA Signing Exponentiations Really are Constant-Time'

344. Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation

Catalog

Books, media, physical & digital resources