István Vajda

According to our database1, István Vajda authored at least 53 papers between 1987 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Security of Data Markets and Private Function Evaluation.
IACR Cryptol. ePrint Arch., 2024

HW-token-based Common Random String Setup.
IACR Cryptol. ePrint Arch., 2024

2023
On Central Bank Digital Currency: A composable treatment.
IACR Cryptol. ePrint Arch., 2023

2022
On the security of data markets: controlled Private Function Evaluation.
IACR Cryptol. ePrint Arch., 2022

2019
Multi-label Classification for Fault Diagnosis of Rotating Electrical Machines.
CoRR, 2019

Rotor Fault Detection under Fast-varying Dynamic Load based on Adaptive Morlet Wavelet Transform.
Proceedings of the 13th IEEE International Symposium on Applied Computational Intelligence and Informatics, 2019

2018
Stabilization of Electrical Parameters of Machine-Converter Voltage Source.
EAI Endorsed Trans. Energy Web, 2018

2017
Searchable symmetric encryption: Sequential scan can be practical.
Proceedings of the 25th International Conference on Software, 2017

2016
On the analysis of time-aware protocols in universal composability framework.
Int. J. Inf. Sec., 2016

2014
A proof technique for security assessment of on-demand ad hoc routing protocols.
Int. J. Secur. Networks, 2014

2013
The UC approach: an application view.
IACR Cryptol. ePrint Arch., 2013

2012
On instance separation in the UC-framework.
IACR Cryptol. ePrint Arch., 2012

2011
Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes.
IEEE Trans. Dependable Secur. Comput., 2011

Secure Network Coding in DTNs.
IEEE Commun. Lett., 2011

UC framework for anonymous communication.
IACR Cryptol. ePrint Arch., 2011

Non-malleable public key encryption in BRSIM/UC.
IACR Cryptol. ePrint Arch., 2011

New look at impossibility result on Dolev-Yao models with hashes.
IACR Cryptol. ePrint Arch., 2011

Framework for Security Proofs for On-demand Routing Protocols in Multi-Hop Wireless Networks.
IACR Cryptol. ePrint Arch., 2011

Cryptographically Sound Security Proof for On-Demand Source Routing Protocol EndairA.
IACR Cryptol. ePrint Arch., 2011

2010
Securing multi-operator-based QoS-aware mesh networks: requirements and design options.
Wirel. Commun. Mob. Comput., 2010

Signatures for Multi-source Network Coding.
IACR Cryptol. ePrint Arch., 2010

Barter trade improves message delivery in opportunistic networks.
Ad Hoc Networks, 2010

Pollution Attack Defense for Coding Based Sensor Storage.
Proceedings of the IEEE International Conference on Sensor Networks, 2010

2009
CORA: Correlation-based resilient aggregation in sensor networks.
Ad Hoc Networks, 2009

2008
Securing coding based distributed storage in wireless sensor networks.
Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

Growth Optimal Investment with Transaction Costs.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007
Efficient Directory Harvest Attacks and Countermeasures.
Int. J. Netw. Secur., 2007

Barter-based cooperation in delay-tolerant personal wireless networks.
Proceedings of the 2007 International Symposium on a World of Wireless, 2007

Group-Based Private Authentication.
Proceedings of the 2007 International Symposium on a World of Wireless, 2007

Cora: correlation-based resilient aggregation in sensor networks.
Proceedings of the 10th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2007

The Security Proof of a Link-state Routing Protocol for Wireless Sensor Networks.
Proceedings of the IEEE 4th International Conference on Mobile Adhoc and Sensor Systems, 2007

On the Effectiveness of Changing Pseudonyms to Provide Location Privacy in VANETs.
Proceedings of the Security and Privacy in Ad-hoc and Sensor Networks, 2007

2006
Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks.
IEEE Trans. Mob. Comput., 2006

RANBAR: RANSAC-based resilient aggregation in sensor networks.
Proceedings of the 4th ACM Workshop on Security of ad hoc and Sensor Networks, 2006

Modelling adversaries and security objectives for routing protocols in wireless sensor networks.
Proceedings of the 4th ACM Workshop on Security of ad hoc and Sensor Networks, 2006

Optimal Key-Trees for Tree-Based Private Authentication.
Proceedings of the Privacy Enhancing Technologies, 6th International Workshop, 2006

Resilient Aggregation with Attack Detection in Sensor Networks.
Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

2005
A Framework for the Revocation of Unintended Digital Signatures Initiated by Malicious Terminals.
IEEE Trans. Dependable Secur. Comput., 2005

Statistical Wormhole Detection in Sensor Networks.
Proceedings of the Security and Privacy in Ad-hoc and Sensor Networks, 2005

Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks.
Proceedings of the Security and Privacy in Ad-hoc and Sensor Networks, 2005

Efficient directory harvest attacks.
Proceedings of the 2005 International Symposium on Collaborative Technologies and Systems, 2005

2004
Towards provable security for ad hoc routing protocols.
Proceedings of the 2nd ACM Workshop on Security of ad hoc and Sensor Networks, 2004

Mitigating the Untrusted Terminal Problem Using Conditional Signatures.
Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04), 2004

Privacy Protecting Protocols for Revocable Digital Signatures.
Proceedings of the Smart Card Research and Advanced Applications VI, 2004

2002
Conceptual Design of an All Superconducting Mini Power Plant Model.
Proceedings of the 1st IEEE International Workshop on Electronic Design, 2002

2001
Collecting randomness from the net.
Proceedings of the Communications and Multimedia Security Issues of the New Century, 2001

2000
Exact Error Probability for Slow Frequency Hopping.
Eur. Trans. Telecommun., 2000

1998
Analysis of protocol sequences for slow frequency hopping.
Wirel. Networks, 1998

1995
Code sequences for frequency-hopping multiple-access systems.
IEEE Trans. Commun., 1995

1993
Constructions of protocol sequences for multiple access collision channel without feedback.
IEEE Trans. Inf. Theory, 1993

1991
Comments on 'Code-division multiple-access techniques in optical fiber networks. II. Systems performance analysis' by J.A. Salehi and C.A. Brackett.
IEEE Trans. Commun., 1991

1990
Substitution of Characters in <i>q</i>-ary <i>m</i>-Sequences.
Proceedings of the Applied Algebra, 1990

1987
Code Acquisition for a Frequency-Hopping System.
IEEE Trans. Commun., 1987


  Loading...