Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
The Programming Language Ada. Reference Manual [[electronic resource] ] : American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983. Approved 17 February 1983 / / by David Hutchison, Takeo Kanade, Josef Kittler, Jon Kleinberg, Alfred Kobsa, Friedemann Mattern, John C. Mitchell, Moni Naor, Oscar M. Nierstrasz, C. Pandu Rangan, Bernhard Steffen, Sudan Madhu, Demetri Terzopoulos, J. Doug Tygar, Gerhard Weikum
| The Programming Language Ada. Reference Manual [[electronic resource] ] : American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983. Approved 17 February 1983 / / by David Hutchison, Takeo Kanade, Josef Kittler, Jon Kleinberg, Alfred Kobsa, Friedemann Mattern, John C. Mitchell, Moni Naor, Oscar M. Nierstrasz, C. Pandu Rangan, Bernhard Steffen, Sudan Madhu, Demetri Terzopoulos, J. Doug Tygar, Gerhard Weikum |
| Autore | Hutchison David |
| Edizione | [1st ed. 1983.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 |
| Descrizione fisica | 1 online resource (IX, 333 p.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-46841-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lexical elements -- Declarations and types -- Names and expressions -- Statements -- Subprograms -- Packages -- Visibility rules -- Tasks -- Program structure and compilation issues -- Exceptions -- Generic units -- Representation clauses and implementation-dependent features -- Input-output. |
| Record Nr. | UNISA-996466335303316 |
Hutchison David
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory of Cryptography [[electronic resource] ] : First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings / / edited by Moni Naor
| Theory of Cryptography [[electronic resource] ] : First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings / / edited by Moni Naor |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 532 p.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Operating systems (Computers) Algorithms Computers and civilization Management information systems Computer science Cryptology Operating Systems Algorithm Analysis and Problem Complexity Computers and Society Management of Computing and Information Systems |
| ISBN |
1-280-30688-2
9786610306886 3-540-24638-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Notions of Reducibility between Cryptographic Primitives -- Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology -- On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes -- Universally Composable Commitments Using Random Oracles -- Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes -- List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument -- On the Possibility of One-Message Weak Zero-Knowledge -- Soundness of Formal Encryption in the Presence of Active Adversaries -- Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems -- Alternatives to Non-malleability: Definitions, Constructions, and Applications -- A Note on Constant-Round Zero-Knowledge Proofs for NP -- Lower Bounds for Concurrent Self Composition -- Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation -- A Quantitative Approach to Reductions in Secure Computation -- Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering -- Physically Observable Cryptography -- Efficient and Universally Composable Committed Oblivious Transfer and Applications -- A Universally Composable Mix-Net -- A General Composition Theorem for Secure Reactive Systems -- Unfair Noisy Channels and Oblivious Transfer -- Computational Collapse of Quantum State with Application to Oblivious Transfer -- Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations -- Composition of Random Systems: When Two Weak Make One Strong -- Simpler Session-Key Generation from Short Random Passwords -- Constant-Round Oblivious Transfer in the Bounded Storage Model -- Hierarchical Threshold Secret Sharing -- On Compressing Encrypted Data without the Encryption Key -- On the Notion of Pseudo-Free Groups. |
| Record Nr. | UNISA-996465438203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory of Cryptography : First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings / / edited by Moni Naor
| Theory of Cryptography : First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings / / edited by Moni Naor |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 532 p.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Operating systems (Computers) Algorithms Computers and civilization Management information systems Computer science Cryptology Operating Systems Algorithm Analysis and Problem Complexity Computers and Society Management of Computing and Information Systems |
| ISBN |
1-280-30688-2
9786610306886 3-540-24638-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Notions of Reducibility between Cryptographic Primitives -- Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology -- On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes -- Universally Composable Commitments Using Random Oracles -- Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes -- List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument -- On the Possibility of One-Message Weak Zero-Knowledge -- Soundness of Formal Encryption in the Presence of Active Adversaries -- Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems -- Alternatives to Non-malleability: Definitions, Constructions, and Applications -- A Note on Constant-Round Zero-Knowledge Proofs for NP -- Lower Bounds for Concurrent Self Composition -- Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation -- A Quantitative Approach to Reductions in Secure Computation -- Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering -- Physically Observable Cryptography -- Efficient and Universally Composable Committed Oblivious Transfer and Applications -- A Universally Composable Mix-Net -- A General Composition Theorem for Secure Reactive Systems -- Unfair Noisy Channels and Oblivious Transfer -- Computational Collapse of Quantum State with Application to Oblivious Transfer -- Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations -- Composition of Random Systems: When Two Weak Make One Strong -- Simpler Session-Key Generation from Short Random Passwords -- Constant-Round Oblivious Transfer in the Bounded Storage Model -- Hierarchical Threshold Secret Sharing -- On Compressing Encrypted Data without the Encryption Key -- On the Notion of Pseudo-Free Groups. |
| Record Nr. | UNINA-9910767521803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||