Short attribute-based signatures for arbitrary Turing machines from standard assumptions
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-7586
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Short attribute-based signatures for arbitrary Turing machines from standard assumptions ; day:17 ; month:1 ; year:2023 ; pages:1-28
Designs, codes and cryptography ; (17.1.2023), 1-28
- Creator
-
Datta, Pratish
Dutta, Ratna
Mukhopadhyay, Sourav
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10623-022-01163-8
- URN
-
urn:nbn:de:101:1-2023032509470740869166
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:56 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Datta, Pratish
- Dutta, Ratna
- Mukhopadhyay, Sourav
- SpringerLink (Online service)
Other Objects (12)
Turing machines with sublogarithmic space
On Turing machines, groupoids, and Atiyah problem
Reachability for infinite time Turing machines with long tapes
Relationships between pushdown automata and tape-bounded turing machines
On membership problems solvable by turing machines within polynomial time
Deep Boltzmann Machines: Rigorous Results at Arbitrary Depth
Turing machines with few accepting computations and low sets for PP
On the automatic synthesis of turing machines from samples of their computations
Deterministic Turing machines in the range between real-time and linear-time
Hans Düring (Turing): Dienstgeld; Siegel: Hans Turing.
Hans During (Turing): Dienstgeld; Siegel: Hans Turing.
Programming with Turing and object oriented Turing, Buch.
Turing machines with sublogarithmic space
On Turing machines, groupoids, and Atiyah problem
Reachability for infinite time Turing machines with long tapes
Relationships between pushdown automata and tape-bounded turing machines
On membership problems solvable by turing machines within polynomial time
Deep Boltzmann Machines: Rigorous Results at Arbitrary Depth
Turing machines with few accepting computations and low sets for PP
On the automatic synthesis of turing machines from samples of their computations
Deterministic Turing machines in the range between real-time and linear-time
Hans Düring (Turing): Dienstgeld; Siegel: Hans Turing.
Hans During (Turing): Dienstgeld; Siegel: Hans Turing.
Programming with Turing and object oriented Turing, Buch.
Turing machines with sublogarithmic space
On Turing machines, groupoids, and Atiyah problem
Reachability for infinite time Turing machines with long tapes
Relationships between pushdown automata and tape-bounded turing machines
On membership problems solvable by turing machines within polynomial time
Deep Boltzmann Machines: Rigorous Results at Arbitrary Depth
Turing machines with few accepting computations and low sets for PP
On the automatic synthesis of turing machines from samples of their computations
Deterministic Turing machines in the range between real-time and linear-time
Hans Düring (Turing): Dienstgeld; Siegel: Hans Turing.
Hans During (Turing): Dienstgeld; Siegel: Hans Turing.