Gil Segev 0001 - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2023

2022

A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space TradeoffLior Rotem, Gil Segev 0001. iacr, 2022:583, 2022. [doi]

A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space TradeoffLior Rotem, Gil Segev 0001. citc 2022: [doi]

2021

Tight Tradeoffs in Searchable Symmetric EncryptionGilad Asharov, Gil Segev 0001, Ido Shahaf. joc, 34(2):9, 2021. [doi]

Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced AllocationsGilad Asharov, Moni Naor, Gil Segev 0001, Ido Shahaf. SICOMP, 50(5):1501-1536, 2021. [doi]

Can PPAD Hardness be Based on Standard Cryptographic Assumptions?Alon Rosen, Gil Segev 0001, Ido Shahaf. joc, 34(1):8, 2021. [doi]

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-ProtocolsLior Rotem, Gil Segev 0001. iacr, 2021:971, 2021. [doi]

Non-Malleable Vector Commitments via Local EquivocabilityLior Rotem, Gil Segev 0001. iacr, 2021:1207, 2021. [doi]

Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?Lior Rotem, Gil Segev 0001. joc, 34(4):39, 2021. [doi]

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-ProtocolsLior Rotem, Gil Segev 0001. crypto 2021: 222-250 [doi]

Non-malleable Vector Commitments via Local EquivocabilityLior Rotem, Gil Segev 0001. tcc 2021: 415-446 [doi]

Generic-Group Identity-Based Encryption: A Tight Impossibility ResultGili Schul-Ganz, Gil Segev 0001. citc 2021: [doi]

Generic-Group Identity-Based Encryption: A Tight Impossibility ResultGili Schul-Ganz, Gil Segev 0001. iacr, 2021:745, 2021. [doi]

Crypto-Oriented Neural Architecture DesignAvital Shafran, Gil Segev 0001, Shmuel Peleg, Yedid Hoshen. icassp 2021: 2680-2684 [doi]

2020

Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs PerspectiveGil Segev 0001, Ido Shahaf. icits 2020: [doi]

Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs PerspectiveGil Segev 0001, Ido Shahaf. iacr, 2020:330, 2020. [doi]

From Minicrypt to Obfustopia via Private-Key Functional EncryptionIlan Komargodski, Gil Segev 0001. joc, 33(2):406-458, 2020. [doi]

Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key DeliveryMoni Naor, Lior Rotem, Gil Segev 0001. icits 2020: [doi]

The Security of Lazy Users in Out-of-Band AuthenticationMoni Naor, Lior Rotem, Gil Segev 0001. tissec, 23(2), 2020. [doi]

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber AssumptionsLior Rotem, Gil Segev 0001. iacr, 2020:1144, 2020. [doi]

Generic-Group Delay Functions Require Hidden-Order GroupsLior Rotem, Gil Segev 0001, Ido Shahaf. iacr, 2020:225, 2020. [doi]

Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay FunctionsLior Rotem, Gil Segev 0001. iacr, 2020:812, 2020. [doi]

Generic-Group Delay Functions Require Hidden-Order GroupsLior Rotem, Gil Segev 0001, Ido Shahaf. eurocrypt 2020: 155-180 [doi]

Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay FunctionsLior Rotem, Gil Segev 0001. crypto 2020: 481-509 [doi]

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber AssumptionsLior Rotem, Gil Segev 0001. tcc 2020: 366-389 [doi]

Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires InteractionGili Schul-Ganz, Gil Segev 0001. tcc 2020: 77-107 [doi]

Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires InteractionGili Schul-Ganz, Gil Segev 0001. iacr, 2020:1106, 2020. [doi]

An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric EncryptionIdo Shahaf, Or Ordentlich, Gil Segev 0001. isit 2020: 858-863 [doi]

An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric EncryptionIdo Shahaf, Or Ordentlich, Gil Segev 0001. iacr, 2020:462, 2020. [doi]

2019

Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key DeliveryMoni Naor, Lior Rotem, Gil Segev 0001. iacr, 2019:1458, 2019. [doi]

See Also

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

Filter by Venue
OR AND NOT 1

Filter by Author
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Gil Segev 0001'

Viewing Publication 1 - 33 from 33

2023

2022

2021

2020

2019

See Also

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by Tag

Filter by VenueOR AND NOT 1

Filter by AuthorOR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Gil Segev 0001'

Viewing Publication 1 - 33 from 33

2023

2022

2021

2020

2019

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Venue
OR AND NOT 1

Filter by Author
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1