Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 29 matches
- 2019
- Jun Xu, Santanu Sarkar, Lei Hu:
Revisiting Approximate Polynomial Common Divisor Problem and Noisy Multipolynomial Reconstruction. INDOCRYPT 2019: 398-411 - Fatih Balli, Subhadeep Banik:
Exploring Lightweight Efficiency of ForkAES. INDOCRYPT 2019: 514-534 - Jyotirmoy Basak, Arpita Maitra, Subhamoy Maitra:
Device Independent Quantum Key Distribution Using Three-Party Pseudo-Telepathy. INDOCRYPT 2019: 456-471 - Debajyoti Bera, Subhamoy Maitra, SAPV Tharrmashastha:
Efficient Quantum Algorithms Related to Autocorrelation Spectrum. INDOCRYPT 2019: 415-432 - Ward Beullens, Jean-Charles Faugère, Eliane Koussa, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret:
PKP-Based Signature Scheme. INDOCRYPT 2019: 3-22 - Colin Boyd, Kristian Gjøsteen, Clémentine Gritti, Thomas Haines:
A Blind Coupon Mechanism Enabling Veto Voting over Unreliable Networks. INDOCRYPT 2019: 250-270 - Chandratop Chakraborty, Pranab Chakraborty, Subhamoy Maitra:
RC4: Non-randomness in the Index j and Some Results on Its Cycles. INDOCRYPT 2019: 95-114 - Sanjit Chatterjee, R. Kabaleeshwaran:
Rerandomizable Signatures Under Standard Assumption. INDOCRYPT 2019: 45-67 - Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Privacy Amplification from Non-malleable Codes. INDOCRYPT 2019: 318-337 - Aditya Damodaran, Maria Dubovitskaya, Alfredo Rial:
UC Priced Oblivious Transfer with Purchase Statistics and Dynamic Pricing. INDOCRYPT 2019: 273-296 - Arijit Dutta, Arnab Jana, Saravanan Vijayakumaran:
Nummatus: A Privacy Preserving Proof of Reserves Protocol for Quisquis. INDOCRYPT 2019: 195-215 - Mingjiang Huang, Liming Wang:
Automatic Tool for Searching for Differential Characteristics in ARX Ciphers and Applications. INDOCRYPT 2019: 115-138 - Thaís Bardini Idalino, Lucia Moura, Carlisle Adams:
Modification Tolerant Signature Schemes: Location and Correction. INDOCRYPT 2019: 23-44 - Abhishek Kesarwani, Santanu Sarkar, Ayineedi Venkateswarlu:
Some Cryptanalytic Results on TRIAD. INDOCRYPT 2019: 160-174 - Arpita Maitra, Suvra Sekhar Das:
Generalized Approach for Analysing Quantum Key Distribution Experiments. INDOCRYPT 2019: 472-491 - Pierrick Méaux, Claude Carlet, Anthony Journault, François-Xavier Standaert:
Improved Filter Permutators for Efficient FHE: Better Instances and Implementations. INDOCRYPT 2019: 68-91 - Boyu Ni, Gembu Ito, Xiaoyang Dong, Tetsu Iwata:
Quantum Attacks Against Type-1 Generalized Feistel Ciphers and Applications to CAST-256. INDOCRYPT 2019: 433-455 - Dongxue Pan, Bei Liang, Hongda Li, Peifang Ni:
Public-Coin Differing-Inputs Obfuscator for Hiding-Input Point Function with Multi-bit Output and Its Applications. INDOCRYPT 2019: 297-317 - Sibi Raj B. Pillai, Manoj Prabhakaran, Vinod M. Prabhakaran, Srivatsan Sridhar:
Optimality of a Protocol by Feige-Kilian-Naor for Three-Party Secure Computation. INDOCRYPT 2019: 216-226 - Mahesh Sreekumar Rajasree:
Cryptanalysis of Round-Reduced KECCAK Using Non-linear Structures. INDOCRYPT 2019: 175-192 - Dragos Rotaru, Tim Wood:
MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security. INDOCRYPT 2019: 227-249 - Sumanta Sarkar, Kalikinkar Mandal, Dhiman Saha:
On the Relationship Between Resilient Boolean Functions and Linear Branch Number of S-Boxes. INDOCRYPT 2019: 361-374 - Peter Schwabe, Amber Sprenkels:
The Complete Cost of Cofactor h=1. INDOCRYPT 2019: 375-397 - Akhilesh Anilkumar Siddhanti, Srinivasu Bodapati, Anupam Chattopadhyay, Subhamoy Maitra, Dibyendu Roy, Pantelimon Stanica:
Analysis of the Strict Avalanche Criterion in Variants of Arbiter-Based Physically Unclonable Functions. INDOCRYPT 2019: 556-577 - Jonathan Sönnerup, Martin Hell, Mattias Sönnerup, Ripudaman Khattar:
Efficient Hardware Implementations of Grain-128AEAD. INDOCRYPT 2019: 495-513 - Deng Tang, Bimal Mandal, Subhamoy Maitra:
Vectorial Boolean Functions with Very Low Differential-Linear Uniformity Using Maiorana-McFarland Type Construction. INDOCRYPT 2019: 341-360 - Boxin Zhao, Xiaoyang Dong, Keting Jia, Willi Meier:
Improved Related-Tweakey Rectangle Attacks on Reduced-Round Deoxys-BC-384 and Deoxys-I-256-128. INDOCRYPT 2019: 139-159 - Timo Zijlstra, Karim Bigou, Arnaud Tisserand:
FPGA Implementation and Comparison of Protections Against SCAs for RLWE. INDOCRYPT 2019: 535-555 - Feng Hao, Sushmita Ruj, Sourav Sen Gupta:
Progress in Cryptology - INDOCRYPT 2019 - 20th International Conference on Cryptology in India, Hyderabad, India, December 15-18, 2019, Proceedings. Lecture Notes in Computer Science 11898, Springer 2019, ISBN 978-3-030-35422-0 [contents]
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-20 06:14 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint