default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIstván Vajda
2020 – today
- 2024
[i14]István Vajda:
HW-token-based Common Random String Setup. IACR Cryptol. ePrint Arch. 2024: 494 (2024)- [i13]István Vajda:
On the Security of Data Markets and Private Function Evaluation. IACR Cryptol. ePrint Arch. 2024: 497 (2024) - 2023
- [i12]István Vajda:
On Central Bank Digital Currency: A composable treatment. IACR Cryptol. ePrint Arch. 2023: 575 (2023) - 2022
- [i11]István Vajda:
On the security of data markets: controlled Private Function Evaluation. IACR Cryptol. ePrint Arch. 2022: 1156 (2022)
2010 – 2019
- 2019
- [c23]Tamás Kolb, Adrienn Dineva, István Vajda:
Rotor Fault Detection under Fast-varying Dynamic Load based on Adaptive Morlet Wavelet Transform. SACI 2019: 338-345 - [i10]Adrienn Dineva, Amir Mosavi, Mate Gyimesi, István Vajda:
Multi-label Classification for Fault Diagnosis of Rotating Electrical Machines. CoRR abs/1908.01078 (2019) - 2018
- [j17]Yury N. Dementyev, A. V. Glazachev
, Kirill N. Negodin, István Vajda, V. I. Susdorf:
Stabilization of Electrical Parameters of Machine-Converter Voltage Source. EAI Endorsed Trans. Energy Web 5(16): e1 (2018) - 2017
- [c22]Máté Horváth, István Vajda:
Searchable symmetric encryption: Sequential scan can be practical. SoftCOM 2017: 1-5 - 2016
- [j16]István Vajda:
On the analysis of time-aware protocols in universal composability framework. Int. J. Inf. Sec. 15(4): 403-412 (2016) - 2014
- [j15]István Vajda:
A proof technique for security assessment of on-demand ad hoc routing protocols. Int. J. Secur. Networks 9(1): 12-19 (2014) - 2013
- [i9]István Vajda:
The UC approach: an application view. IACR Cryptol. ePrint Arch. 2013: 72 (2013) - 2012
- [i8]István Vajda:
On instance separation in the UC-framework. IACR Cryptol. ePrint Arch. 2012: 302 (2012) - 2011
- [j14]László Czap, István Vajda:
Secure Network Coding in DTNs. IEEE Commun. Lett. 15(1): 28-30 (2011) - [j13]Levente Buttyán, László Czap, István Vajda:
Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes. IEEE Trans. Dependable Secur. Comput. 8(6): 824-838 (2011) - [i7]István Vajda:
Cryptographically Sound Security Proof for On-Demand Source Routing Protocol EndairA. IACR Cryptol. ePrint Arch. 2011: 103 (2011) - [i6]István Vajda:
Framework for Security Proofs for On-demand Routing Protocols in Multi-Hop Wireless Networks. IACR Cryptol. ePrint Arch. 2011: 220 (2011) - [i5]István Vajda:
New look at impossibility result on Dolev-Yao models with hashes. IACR Cryptol. ePrint Arch. 2011: 335 (2011) - [i4]István Vajda:
Non-malleable public key encryption in BRSIM/UC. IACR Cryptol. ePrint Arch. 2011: 470 (2011) - [i3]István Vajda:
UC framework for anonymous communication. IACR Cryptol. ePrint Arch. 2011: 682 (2011) - 2010
- [j12]Levente Buttyán, László Dóra, Márk Félegyházi, István Vajda:
Barter trade improves message delivery in opportunistic networks. Ad Hoc Networks 8(1): 1-14 (2010) - [j11]Ioannis G. Askoxylakis, Boldizsár Bencsáth, Levente Buttyán, László Dóra, Vasilios A. Siris, D. Szili, István Vajda:
Securing multi-operator-based QoS-aware mesh networks: requirements and design options. Wirel. Commun. Mob. Comput. 10(5): 622-646 (2010) - [c21]Levente Buttyán, László Czap, István Vajda:
Pollution Attack Defense for Coding Based Sensor Storage. SUTC/UMC 2010: 66-73 - [i2]László Czap, István Vajda:
Signatures for Multi-source Network Coding. IACR Cryptol. ePrint Arch. 2010: 328 (2010)
2000 – 2009
- 2009
- [j10]Levente Buttyán, Péter Schaffer, István Vajda:
CORA: Correlation-based resilient aggregation in sensor networks. Ad Hoc Networks 7(6): 1035-1050 (2009) - 2008
- [c20]László Györfi, István Vajda:
Growth Optimal Investment with Transaction Costs. ALT 2008: 108-122 - [c19]Levente Buttyán, László Czap, István Vajda:
Securing coding based distributed storage in wireless sensor networks. MASS 2008: 821-827 - 2007
- [j9]Boldizsár Bencsáth, István Vajda:
Efficient Directory Harvest Attacks and Countermeasures. Int. J. Netw. Secur. 5(3): 264-273 (2007) - [c18]Levente Buttyán, Tamás Holczer, István Vajda:
On the Effectiveness of Changing Pseudonyms to Provide Location Privacy in VANETs. ESAS 2007: 129-141 - [c17]Gergely Ács, Levente Buttyán, István Vajda:
The Security Proof of a Link-state Routing Protocol for Wireless Sensor Networks. MASS 2007: 1-6 - [c16]Péter Schaffer, István Vajda:
Cora: correlation-based resilient aggregation in sensor networks. MSWiM 2007: 373-376 - [c15]Gildas Avoine, Levente Buttyán, Tamás Holczer, István Vajda:
Group-Based Private Authentication. WOWMOM 2007: 1-6 - [c14]Levente Buttyán, László Dóra, Márk Félegyházi, István Vajda:
Barter-based cooperation in delay-tolerant personal wireless networks. WOWMOM 2007: 1-6 - 2006
- [j8]Gergely Ács, Levente Buttyán, István Vajda:
Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks. IEEE Trans. Mob. Comput. 5(11): 1533-1546 (2006) - [c13]Levente Buttyán, Péter Schaffer, István Vajda:
Resilient Aggregation with Attack Detection in Sensor Networks. PerCom Workshops 2006: 332-336 - [c12]Levente Buttyán, Tamás Holczer, István Vajda:
Optimal Key-Trees for Tree-Based Private Authentication. Privacy Enhancing Technologies 2006: 332-350 - [c11]Gergely Ács, Levente Buttyán, István Vajda:
Modelling adversaries and security objectives for routing protocols in wireless sensor networks. SASN 2006: 49-58 - [c10]Levente Buttyán, Péter Schaffer, István Vajda:
RANBAR: RANSAC-based resilient aggregation in sensor networks. SASN 2006: 83-90 - 2005
- [j7]István Zsolt Berta, Levente Buttyán, István Vajda:
A Framework for the Revocation of Unintended Digital Signatures Initiated by Malicious Terminals. IEEE Trans. Dependable Secur. Comput. 2(3): 268-272 (2005) - [c9]Boldizsár Bencsáth, István Vajda:
Efficient directory harvest attacks. CTS 2005: 62-68 - [c8]Gergely Ács, Levente Buttyán, István Vajda:
Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks. ESAS 2005: 113-127 - [c7]Levente Buttyán, László Dóra, István Vajda:
Statistical Wormhole Detection in Sensor Networks. ESAS 2005: 128-141 - 2004
- [c6]István Zsolt Berta, Levente Buttyán, István Vajda:
Privacy Protecting Protocols for Revocable Digital Signatures. CARDIS 2004: 67-81 - [c5]István Zsolt Berta, Levente Buttyán, István Vajda:
Mitigating the Untrusted Terminal Problem Using Conditional Signatures. ITCC (1) 2004: 12-16 - [c4]Levente Buttyán, István Vajda:
Towards provable security for ad hoc routing protocols. SASN 2004: 94-105 - [i1]Gergely Ács, Levente Buttyán, István Vajda:
Provably Secure On-demand Source Routing in Mobile Ad Hoc Networks. IACR Cryptol. ePrint Arch. 2004: 159 (2004) - 2002
- [c3]István Vajda:
Conceptual Design of an All Superconducting Mini Power Plant Model. DELTA 2002: 267-271 - 2001
- [c2]Boldizsár Bencsáth, István Vajda:
Collecting randomness from the net. Communications and Multimedia Security 2001 - 2000
- [j6]László Györfi, Árpád Jordán, István Vajda:
Exact Error Probability for Slow Frequency Hopping. Eur. Trans. Telecommun. 11(2): 183-190 (2000)
1990 – 1999
- 1998
- [j5]László Györfi, István Vajda:
Analysis of protocol sequences for slow frequency hopping. Wirel. Networks 4(5): 411-418 (1998) - 1995
- [j4]István Vajda:
Code sequences for frequency-hopping multiple-access systems. IEEE Trans. Commun. 43(10): 2553-2554 (1995) - 1993
- [j3]László Györfi, István Vajda:
Constructions of protocol sequences for multiple access collision channel without feedback. IEEE Trans. Inf. Theory 39(5): 1762-1765 (1993) - 1991
- [j2]István Vajda:
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. 39(2): 196 (1991) - 1990
- [c1]István Vajda, Tibor O. H. Nemetz:
Substitution of Characters in q-ary m-Sequences. AAECC 1990: 96-105
1980 – 1989
- 1987
- [j1]István Vajda, Gudmundur Einarsson:
Code Acquisition for a Frequency-Hopping System. IEEE Trans. Commun. 35(5): 566-568 (1987)
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.
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.
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.
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.
last updated on 2024-04-25 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
