Sciweavers

893 search results - page 16 / 179
» Descent Theory for Schemes
Sort
View
TYPES
2000
Springer
13 years 11 months ago
Collection Principles in Dependent Type Theory
We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic ru...
Peter Aczel, Nicola Gambino
EUROCRYPT
2008
Springer
13 years 9 months ago
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
Kaoru Kurosawa, Kazuhiro Suzuki
ICASSP
2011
IEEE
12 years 11 months ago
On the implementation of MIMO-OFDM schemes using perturbation of the QR decomposition: Application to 3GPP LTE-a systems
Consider a flat-fading Multiple-Input Multiple-Output (MIMO) system. The near-optimum detection problematic has been shown to be efficiently solved through QR Decomposition (QRD...
Sébastien Aubert, Jane Tournois, Fabienne N...
SYNASC
2007
IEEE
105views Algorithms» more  SYNASC 2007»
14 years 1 months ago
Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
Adrian Craciun, Madalina Hodorog
EUROCRYPT
2006
Springer
13 years 11 months ago
The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
In this paper we examine the security criteria for a KEM and a DEM that are sufficient for the overall hybrid encryption scheme to be plaintext-aware in the standard model. We appl...
Alexander W. Dent