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.
Theory of Cryptography [[electronic resource] ] : Sixth Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009, Proceedings / / edited by Omer Reingold
| Theory of Cryptography [[electronic resource] ] : Sixth Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009, Proceedings / / edited by Omer Reingold |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 615 p.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Algorithms Computer science—Mathematics Computer security Management information systems Computer science Computers and civilization Cryptology Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Systems and Data Security Management of Computing and Information Systems Computers and Society |
| Soggetto genere / forma |
Kongress.
San Francisco (Calif., 2009) |
| ISBN | 3-642-00457-1 |
| Classificazione |
DAT 465f
SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | An Optimally Fair Coin Toss -- Complete Fairness in Multi-party Computation without an Honest Majority -- Fairness with an Honest Minority and a Rational Majority -- Purely Rational Secret Sharing (Extended Abstract) -- Some Recent Progress in Lattice-Based Cryptography -- Non-malleable Obfuscation -- Simulation-Based Concurrent Non-malleable Commitments and Decommitments -- Proofs of Retrievability via Hardness Amplification -- Security Amplification for Interactive Cryptographic Primitives -- Composability and On-Line Deniability of Authentication -- Authenticated Adversarial Routing -- Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer -- On the (Im)Possibility of Key Dependent Encryption -- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols -- Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security -- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation -- Realistic Failures in Secure Multi-party Computation -- Secure Arithmetic Computation with No Honest Majority -- Universally Composable Multiparty Computation with Partially Isolated Parties -- Oblivious Transfer from Weak Noisy Channels -- Composing Quantum Protocols in a Classical Environment -- LEGO for Two-Party Secure Computation -- Simple, Black-Box Constructions of Adaptively Secure Protocols -- Black-Box Constructions of Two-Party Protocols from One-Way Functions -- Chosen-Ciphertext Security via Correlated Products -- Hierarchical Identity Based Encryption with Polynomially Many Levels -- Predicate Privacy in Encryption Systems -- Simultaneous Hardcore Bits and Cryptography against Memory Attacks -- The Differential Privacy Frontier (Extended Abstract) -- How Efficient Can Memory Checking Be? -- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms -- Secret Sharing and Non-Shannon Information Inequalities -- Weak Verifiable Random Functions -- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection -- Towards a Theory of Extractable Functions. |
| Record Nr. | UNISA-996465886203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Topics in Cryptology - CT-RSA 2009 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2009, San Francisco,CA, USA, April 20-24, 2009, Proceedings / / edited by Marc Fischlin
| Topics in Cryptology - CT-RSA 2009 [[electronic resource] ] : The Cryptographers' Track at the RSA Conference 2009, San Francisco,CA, USA, April 20-24, 2009, Proceedings / / edited by Marc Fischlin |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 482 p.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Coding theory Information theory Computer science—Mathematics Computer security Computer communication systems Algorithms Cryptology Coding and Information Theory Discrete Mathematics in Computer Science Systems and Data Security Computer Communication Networks Algorithm Analysis and Problem Complexity |
| Soggetto genere / forma |
Kongress.
San Francisco (Calif., 2009) |
| ISBN | 3-642-00862-3 |
| Classificazione |
DAT 465f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Identity-Based Encryption -- Adaptive-ID Secure Revocable Identity-Based Encryption -- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations -- Universally Anonymous IBE Based on the Quadratic Residuosity Assumption -- Protocol Analysis -- Attacks on the DECT Authentication Mechanisms -- Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1 -- Two-Party Protocols -- Key Insulation and Intrusion Resilience over a Public Channel -- Statistically Hiding Sets -- Adaptively Secure Two-Party Computation with Erasures -- More Than Signatures -- Short Redactable Signatures Using Random Trees -- Divisible On-Line/Off-Line Signatures -- Collisions for Hash Functions -- Speeding up Collision Search for Byte-Oriented Hash Functions -- Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security -- Cryptanalysis -- A Statistical Saturation Attack against the Block Cipher PRESENT -- Practical Attacks on Masked Hardware -- Cryptanalysis of CTC2 -- Alternative Encryption -- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model -- Square, a New Multivariate Encryption Scheme -- Privacy and Anonymity -- Communication-Efficient Private Protocols for Longest Common Subsequence -- Key-Private Proxy Re-encryption -- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems -- Effciency Improvements -- Practical Short Signature Batch Verification -- Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity -- Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients -- Multi-Party Protocols -- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values -- Local Sequentiality Does Not Help for Concurrent Composition -- Security of Encryption Schemes -- Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening -- Strengthening Security of RSA-OAEP -- Faults and Countermeasures -- Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable -- Fault Analysis Attack against an AES Prototype Chip Using RSL -- Countermeasures and Faults -- Evaluation of the Detached Power Supply as Side-Channel Analysis Countermeasure for Passive UHF RFID Tags -- Securing RSA against Fault Analysis by Double Addition Chain Exponentiation. |
| Record Nr. | UNISA-996465545703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
