---
_id: '58224'
author:
- first_name: Philip
  full_name: Kenneweg, Philip
  last_name: Kenneweg
- first_name: Tristan
  full_name: Kenneweg, Tristan
  last_name: Kenneweg
- first_name: Fabian
  full_name: Fumagalli, Fabian
  last_name: Fumagalli
- first_name: Barbara
  full_name: Hammer, Barbara
  last_name: Hammer
citation:
  ama: 'Kenneweg P, Kenneweg T, Fumagalli F, Hammer B. No learning rates needed: Introducing
    SALSA - Stable Armijo Line Search Adaptation. In: <i>2024 International Joint
    Conference on Neural Networks (IJCNN)</i>. ; 2024:1-8. doi:<a href="https://doi.org/10.1109/IJCNN60899.2024.10650124">10.1109/IJCNN60899.2024.10650124</a>'
  apa: 'Kenneweg, P., Kenneweg, T., Fumagalli, F., &#38; Hammer, B. (2024). No learning
    rates needed: Introducing SALSA - Stable Armijo Line Search Adaptation. <i>2024
    International Joint Conference on Neural Networks (IJCNN)</i>, 1–8. <a href="https://doi.org/10.1109/IJCNN60899.2024.10650124">https://doi.org/10.1109/IJCNN60899.2024.10650124</a>'
  bibtex: '@inproceedings{Kenneweg_Kenneweg_Fumagalli_Hammer_2024, title={No learning
    rates needed: Introducing SALSA - Stable Armijo Line Search Adaptation}, DOI={<a
    href="https://doi.org/10.1109/IJCNN60899.2024.10650124">10.1109/IJCNN60899.2024.10650124</a>},
    booktitle={2024 International Joint Conference on Neural Networks (IJCNN)}, author={Kenneweg,
    Philip and Kenneweg, Tristan and Fumagalli, Fabian and Hammer, Barbara}, year={2024},
    pages={1–8} }'
  chicago: 'Kenneweg, Philip, Tristan Kenneweg, Fabian Fumagalli, and Barbara Hammer.
    “No Learning Rates Needed: Introducing SALSA - Stable Armijo Line Search Adaptation.”
    In <i>2024 International Joint Conference on Neural Networks (IJCNN)</i>, 1–8,
    2024. <a href="https://doi.org/10.1109/IJCNN60899.2024.10650124">https://doi.org/10.1109/IJCNN60899.2024.10650124</a>.'
  ieee: 'P. Kenneweg, T. Kenneweg, F. Fumagalli, and B. Hammer, “No learning rates
    needed: Introducing SALSA - Stable Armijo Line Search Adaptation,” in <i>2024
    International Joint Conference on Neural Networks (IJCNN)</i>, 2024, pp. 1–8,
    doi: <a href="https://doi.org/10.1109/IJCNN60899.2024.10650124">10.1109/IJCNN60899.2024.10650124</a>.'
  mla: 'Kenneweg, Philip, et al. “No Learning Rates Needed: Introducing SALSA - Stable
    Armijo Line Search Adaptation.” <i>2024 International Joint Conference on Neural
    Networks (IJCNN)</i>, 2024, pp. 1–8, doi:<a href="https://doi.org/10.1109/IJCNN60899.2024.10650124">10.1109/IJCNN60899.2024.10650124</a>.'
  short: 'P. Kenneweg, T. Kenneweg, F. Fumagalli, B. Hammer, in: 2024 International
    Joint Conference on Neural Networks (IJCNN), 2024, pp. 1–8.'
date_created: 2025-01-16T16:21:28Z
date_updated: 2025-09-11T15:37:42Z
department:
- _id: '660'
doi: 10.1109/IJCNN60899.2024.10650124
keyword:
- Training
- Schedules
- Codes
- Search methods
- Source coding
- Computer architecture
- Transformers
language:
- iso: eng
page: 1-8
project:
- _id: '109'
  name: 'TRR 318: TRR 318 - Erklärbarkeit konstruieren'
- _id: '117'
  name: 'TRR 318 - C: TRR 318 - Project Area C'
- _id: '126'
  name: 'TRR 318 - C3: TRR 318 - Subproject C3'
publication: 2024 International Joint Conference on Neural Networks (IJCNN)
status: public
title: 'No learning rates needed: Introducing SALSA - Stable Armijo Line Search Adaptation'
type: conference
user_id: '93420'
year: '2024'
...
---
_id: '21396'
abstract:
- lang: eng
  text: "Verifiable random functions (VRFs) are essentially digital signatures with
    additional properties, namely verifiable uniqueness and pseudorandomness, which
    make VRFs a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated
    Denial of Existence and the CONIKS key management system, or in the random committee
    selection of the Algorand blockchain.\r\n\r\nMost standard-model VRFs rely on
    admissible hash functions (AHFs) to achieve security against adaptive attacks
    in the standard model. Known AHF constructions are based on error-correcting codes,
    which yield asymptotically efficient constructions. However, previous works do
    not clarify how the code should be instantiated concretely in the real world.
    The rate and the minimal distance of the selected code have significant impact
    on the efficiency of the resulting cryptosystem, therefore it is unclear if and
    how the aforementioned constructions can be used in practice.\r\n\r\nFirst, we
    explain inherent limitations of code-based AHFs. Concretely, we assume that even
    if we were given codes that achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch
    bounds, existing AHF-based constructions of verifiable random functions (VRFs)
    can only be instantiated quite inefficiently. Then we introduce and construct
    computational AHFs (cAHFs). While classical AHFs are information-theoretic, and
    therefore work even in presence of computationally unbounded adversaries, cAHFs
    provide only security against computationally bounded adversaries. However, we
    show that cAHFs can be instantiated significantly more efficiently. Finally, we
    use our cAHF to construct the currently most efficient verifiable random function
    with full adaptive security in the standard model."
author:
- first_name: Tibor
  full_name: Jager, Tibor
  last_name: Jager
- first_name: David
  full_name: Niehues, David
  id: '36113'
  last_name: Niehues
citation:
  ama: 'Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions
    and Efficient Verifiable Random Functions. In: <i>Lecture Notes in Computer Science</i>.
    Cham; 2020. doi:<a href="https://doi.org/10.1007/978-3-030-38471-5_13">10.1007/978-3-030-38471-5_13</a>'
  apa: Jager, T., &#38; Niehues, D. (2020). On the Real-World Instantiability of Admissible
    Hash Functions and Efficient Verifiable Random Functions. In <i>Lecture Notes
    in Computer Science</i>. Cham. <a href="https://doi.org/10.1007/978-3-030-38471-5_13">https://doi.org/10.1007/978-3-030-38471-5_13</a>
  bibtex: '@inbook{Jager_Niehues_2020, place={Cham}, title={On the Real-World Instantiability
    of Admissible Hash Functions and Efficient Verifiable Random Functions}, DOI={<a
    href="https://doi.org/10.1007/978-3-030-38471-5_13">10.1007/978-3-030-38471-5_13</a>},
    booktitle={Lecture Notes in Computer Science}, author={Jager, Tibor and Niehues,
    David}, year={2020} }'
  chicago: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of
    Admissible Hash Functions and Efficient Verifiable Random Functions.” In <i>Lecture
    Notes in Computer Science</i>. Cham, 2020. <a href="https://doi.org/10.1007/978-3-030-38471-5_13">https://doi.org/10.1007/978-3-030-38471-5_13</a>.
  ieee: T. Jager and D. Niehues, “On the Real-World Instantiability of Admissible
    Hash Functions and Efficient Verifiable Random Functions,” in <i>Lecture Notes
    in Computer Science</i>, Cham, 2020.
  mla: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible
    Hash Functions and Efficient Verifiable Random Functions.” <i>Lecture Notes in
    Computer Science</i>, 2020, doi:<a href="https://doi.org/10.1007/978-3-030-38471-5_13">10.1007/978-3-030-38471-5_13</a>.
  short: 'T. Jager, D. Niehues, in: Lecture Notes in Computer Science, Cham, 2020.'
conference:
  end_date: 2019-08-16
  location: Waterloo, Canada
  name: Selected Areas in Cryptography
  start_date: 2019-08-12
date_created: 2021-03-08T16:50:31Z
date_updated: 2022-01-06T06:54:58Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-38471-5_13
file:
- access_level: closed
  content_type: application/pdf
  creator: davnie
  date_created: 2021-03-08T17:02:37Z
  date_updated: 2021-03-08T17:02:37Z
  file_id: '21399'
  file_name: Jager und Niehues - 2020 - On the Real-World Instantiability of Admissible
    Ha.pdf
  file_size: 706743
  relation: main_file
file_date_updated: 2021-03-08T17:02:37Z
has_accepted_license: '1'
keyword:
- Admissible hash functions
- Verifiable random functions
- Error-correcting codes
- Provable security
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/content/pdf/10.1007%252F978-3-030-38471-5_13.pdf
place: Cham
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783030384708'
  - '9783030384715'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
quality_controlled: '1'
related_material:
  link:
  - relation: later_version
    url: https://eprint.iacr.org/2019/1335.pdf
status: public
title: On the Real-World Instantiability of Admissible Hash Functions and Efficient
  Verifiable Random Functions
type: book_chapter
user_id: '36113'
year: '2020'
...
---
_id: '11828'
abstract:
- lang: eng
  text: 'In this paper we present a comparison of the recently proposed Soft-Feature
    Distributed Speech Recognition (SFDSR) with the two evaluated candidate codecs
    for Speech Enabled Services over wireless networks: Adaptive Multirate Codec (AMR)
    and the ETSI Extended Advanced Front-End for Distributed Speech Recognition (XAFE).
    It is shown that SFDSR achieves the best recognition performance on a simulated
    GSM transmission, followed by XAFE and AMR.We also present some new results concerning
    SFDSR which demonstrate the versatility of the approach. Further, a simple method
    is introduced which considerably reduces the computational effort.'
author:
- first_name: Valentin
  full_name: Ion, Valentin
  last_name: Ion
- first_name: Reinhold
  full_name: Haeb-Umbach, Reinhold
  id: '242'
  last_name: Haeb-Umbach
citation:
  ama: 'Ion V, Haeb-Umbach R. A Comparison of Soft-Feature Distributed Speech Recognition
    with Candidate Codecs for Speech Enabled Mobile Services. In: <i>IEEE International
    Conference on Acoustics, Speech and Signal Processing (ICASSP 2005)</i>. Vol 1.
    ; 2005:333-336. doi:<a href="https://doi.org/10.1109/ICASSP.2005.1415118">10.1109/ICASSP.2005.1415118</a>'
  apa: Ion, V., &#38; Haeb-Umbach, R. (2005). A Comparison of Soft-Feature Distributed
    Speech Recognition with Candidate Codecs for Speech Enabled Mobile Services. In
    <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP
    2005)</i> (Vol. 1, pp. 333–336). <a href="https://doi.org/10.1109/ICASSP.2005.1415118">https://doi.org/10.1109/ICASSP.2005.1415118</a>
  bibtex: '@inproceedings{Ion_Haeb-Umbach_2005, title={A Comparison of Soft-Feature
    Distributed Speech Recognition with Candidate Codecs for Speech Enabled Mobile
    Services}, volume={1}, DOI={<a href="https://doi.org/10.1109/ICASSP.2005.1415118">10.1109/ICASSP.2005.1415118</a>},
    booktitle={IEEE International Conference on Acoustics, Speech and Signal Processing
    (ICASSP 2005)}, author={Ion, Valentin and Haeb-Umbach, Reinhold}, year={2005},
    pages={333–336} }'
  chicago: Ion, Valentin, and Reinhold Haeb-Umbach. “A Comparison of Soft-Feature
    Distributed Speech Recognition with Candidate Codecs for Speech Enabled Mobile
    Services.” In <i>IEEE International Conference on Acoustics, Speech and Signal
    Processing (ICASSP 2005)</i>, 1:333–36, 2005. <a href="https://doi.org/10.1109/ICASSP.2005.1415118">https://doi.org/10.1109/ICASSP.2005.1415118</a>.
  ieee: V. Ion and R. Haeb-Umbach, “A Comparison of Soft-Feature Distributed Speech
    Recognition with Candidate Codecs for Speech Enabled Mobile Services,” in <i>IEEE
    International Conference on Acoustics, Speech and Signal Processing (ICASSP 2005)</i>,
    2005, vol. 1, pp. 333–336.
  mla: Ion, Valentin, and Reinhold Haeb-Umbach. “A Comparison of Soft-Feature Distributed
    Speech Recognition with Candidate Codecs for Speech Enabled Mobile Services.”
    <i>IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP
    2005)</i>, vol. 1, 2005, pp. 333–36, doi:<a href="https://doi.org/10.1109/ICASSP.2005.1415118">10.1109/ICASSP.2005.1415118</a>.
  short: 'V. Ion, R. Haeb-Umbach, in: IEEE International Conference on Acoustics,
    Speech and Signal Processing (ICASSP 2005), 2005, pp. 333–336.'
date_created: 2019-07-12T05:29:02Z
date_updated: 2022-01-06T06:51:10Z
department:
- _id: '54'
doi: 10.1109/ICASSP.2005.1415118
intvolume: '         1'
keyword:
- adaptive codes
- adaptive multirate codec
- AMR
- distributed speech recognition
- ETSI
- extended advanced front-end
- recognition performance
- SFDSR
- simulated GSM transmission
- soft-feature distributed speech recognition
- speech codecs
- speech coding
- speech recognition
- variable rate codes
- XAFE
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://groups.uni-paderborn.de/nt/pubs/2005/IoHa05-2.pdf
oa: '1'
page: 333-336
publication: IEEE International Conference on Acoustics, Speech and Signal Processing
  (ICASSP 2005)
status: public
title: A Comparison of Soft-Feature Distributed Speech Recognition with Candidate
  Codecs for Speech Enabled Mobile Services
type: conference
user_id: '44006'
volume: 1
year: '2005'
...