A5012769677- Cryptography and Data Security
- Cryptographic Implementations and Security
- Complexity and Algorithms in Graphs
- Coding theory and cryptography
- Privacy-Preserving Technologies in Data
- Chaos-based Image/Signal Encryption
- Cryptography and Residue Arithmetic
- Security in Wireless Sensor Networks
- Advanced Authentication Protocols Security
- Blockchain Technology Applications and Security
- Mobile Ad Hoc Networks
- Quantum Computing Algorithms and Architecture
- Semiconductor materials and devices
- IPv6, Mobility, Handover, Networks, Security
- Peer-to-Peer Network Technologies
- Optimization and Packing Problems
- Video Coding and Compression Technologies
- Wireless Communication Networks Research
- Wireless Networks and Protocols
- Security and Verification in Computing
- Network Packet Processing and Optimization
- Distributed and Parallel Computing Systems
- Distributed systems and fault tolerance
- Mathematical Approximation and Integration
- Advanced Optimization Algorithms Research
Indian Institute of Technology Bombay
2024
Tel Aviv University
2021-2023
National University of Rosario
2021
Academic College of Tel Aviv-Yafo
2021
Institute of Science and Technology Austria
2016-2020
Northeastern University
2020
Indian Institute of Science Bangalore
2013-2015
The Fiat-Shamir heuristic transforms a public-coin interactive proof into non-interactive argument, by replacing the verifier with cryptographic hash function that is applied to protocol's transcript. Constructing functions for which this transformation sound central and long-standing open question in cryptography.
While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar remains largely open. The two existing proposals date ART (Cohn-Gordon et al., CCS18) TreeKEM (IETF, Messaging Layer Security Protocol, draft). is the currently considered candidate by IETF MLS working group, but dynamic group operations (i.e. adding removing users) can cause efficiency issues. In this paper we formalize analyze...
Batch proofs are proof systems that convince a verifier x1,…,xt ∈ L, for some NP language with communication is much shorter than sending the t witnesses. In case of statistical soundness (where cheating prover unbounded but honest efficient given witnesses), interactive batch known UP, class unique-witness languages. computational both and dishonest provers efficient), non-interactive solutions now all NP, assuming standard lattice or group assumptions. We exhibit first negative results...
We show attacks on five data-independent memory-hard functions (iMHF) that were submitted to the password hashing competition (PHC). Informally, an MHF is a function which cannot be evaluated dedicated hardware, like ASICs, at significantly lower hardware and/or energy cost than evaluating single instance standard single-core architecture. Data-independent means memory access pattern of independent input; this makes iMHFs harder construct data-dependent ones, but latter can attacked by...
The problem of private set-intersection (PSI) has been traditionally treated as an instance the more general multi-party computation (MPC). Consequently, in order to argue security, or compose these protocols one rely on theory that was developed for purpose MPC. pursuit efficient protocols, however, resulted designs exploit properties pertaining PSI. In almost all practical applications where a PSI protocol is deployed, it expected be executed multiple times, possibly related inputs. this...