Avradip Mandal

According to our database1, Avradip Mandal authored at least 30 papers between 2007 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Bandwidth-Hard Functions from Random Permutations.
CoRR, 2022

Leveraging special-purpose hardware for local search heuristics.
Comput. Optim. Appl., 2022

2021
On Elapsed Time Consensus Protocols.
IACR Cryptol. ePrint Arch., 2021

Ising-Based Louvain Method: Clustering Large Graphs with Specialized Hardware.
Proceedings of the Advances in Intelligent Data Analysis XIX, 2021

Unified Clustering and Outlier Detection on Specialized Hardware.
Proceedings of the IEEE International Conference on Acoustics, 2021

2020
Binary Matrix Factorization on Special Purpose Hardware.
CoRR, 2020

Ising-Based Consensus Clustering on Specialized Hardware.
Proceedings of the Advances in Intelligent Data Analysis XVIII, 2020

Compressed Quadratization of Higher Order Binary Optimization Problems.
Proceedings of the Data Compression Conference, 2020

2019
On Modeling Local Search with Special-Purpose Combinatorial Optimization Hardware.
CoRR, 2019

2018
Data Oblivious Genome Variants Search on Intel SGX.
IACR Cryptol. ePrint Arch., 2018

2017
On The Exact Security of Message Authentication Using Pseudorandom Functions.
IACR Trans. Symmetric Cryptol., 2017

Privacy for Targeted Advertising.
IACR Cryptol. ePrint Arch., 2017

2016
Function-Hiding Inner Product Encryption is Practical.
IACR Cryptol. ePrint Arch., 2016

2015
Comprehensive and Improved Secure Biometric System Using Homomorphic Encryption.
Proceedings of the Data Privacy Management, and Security Assurance, 2015

Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Privacy Preserving Technique for Set-Based Biometric Authentication using Reed-Solomon Decoding.
Proceedings of the BIOSIG 2015, 2015

2014
Relational Hash.
IACR Cryptol. ePrint Arch., 2014

2012
Provable Security and Indifferentiability.
PhD thesis, 2012

2011
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction.
IACR Cryptol. ePrint Arch., 2011

Fully Homomorphic Encryption over the Integers with Shorter Public Keys.
IACR Cryptol. ePrint Arch., 2011

On the Indifferentiability of Fugue and Luffa.
Proceedings of the Applied Cryptography and Network Security, 2011

2010
Cryptanalysis of the RSA Subgroup Assumption from TCC 2005.
IACR Cryptol. ePrint Arch., 2010

On the Impossibility of Instantiating PSS in the Standard Model.
IACR Cryptol. ePrint Arch., 2010

Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations.
Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

Security Analysis of the Mode of JH Hash Function.
Proceedings of the Fast Software Encryption, 17th International Workshop, 2010

2009
A Domain Extender for the Ideal Cipher.
IACR Cryptol. ePrint Arch., 2009

Indifferentiability Characterization of Hash Functions and Optimal Bounds of Popular Domain Extensions.
Proceedings of the Progress in Cryptology, 2009

PSS Is Secure against Random Fault Attacks.
Proceedings of the Advances in Cryptology, 2009

2008
Improved security analysis of PMAC.
J. Math. Cryptol., 2008

2007
An improved collision probability for CBC-MAC and PMAC.
IACR Cryptol. ePrint Arch., 2007


  Loading...