text:
This site is the archived OWASP Foundation Wiki and is no longer accepting Account Requests.
To view the new OWASP Foundation website, please visit https://owasp.org
: Top - 0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
See also: Triple DES
Access Control List
A list of credentials attached to a resource indicating whether or not the credentials have access to the resource.
Access Control List
Active attack
Any network-based attack other than simple eavesdropping — i.e., a passive attack).
Advanced Encryption Standard
A fast general-purpose block cipher standardized by NIST (the National Institute of Standards and Technology). The AES selection process was a multi-year competition, where Rijndael was the winning cipher.
See also: Advanced Encryption Standard
Referring to technology that detects or thwarts the use of a debugger on a piece of software.
Referring to technology that attempts to thwart the reverse engineering and patching of a piece of software in binary format.
Architectural security assessment
See also: Threat Model
Abstract Syntax Notation is a language for representing data objects. It is popular to use this in specifying cryptographic protocols, usually using DER (Distinguished Encoding Rules), which allows the data layout to be unambiguously specified.
See also: Distinguished Encoding Rules.
Asymmetric cryptography
Cryptography involving public keys, as opposed to cryptography making use of shared secrets.
See also: Symmetric cryptography.
In the context of security, a review of a system in order to validate the security of the system. Generally, this either refers to code auditing or reviewing audit logs.
See also: Audit log, Code auditing.
Audit log
Records that are kept for the purpose of later verifying that the security properties of a system have remained intact.
When using a cipher to encrypt and a MAC to provide message integrity, this paradigm specifies that one authenticates the plaintext and encrypts the plaintext, possibly in parallel. This is not secure in the general case. See also: #Authenticate-then-encrypt, #encrypt-then-authenticate.
When using a cipher to encrypt and a MAC to provide message integrity, this paradigm specifies that one authenticates the plaintext and then encrypts the plaintext concatenated with the MAC tag. This is not secure in the general case, but usually works well in practice. See also: #Authenticate-and-encrypt, #Encrypt-then-authenticate.
The process of verifying identity, ownership, and/or authorization.
Malicious code inserted into a program for the purposes of providing the author covert access to machines running the program.
Base 64
encoding A method for encoding binary data into printable ASCII strings. Every byte of output maps to six bits of input (minus possible padding bytes).
Big endian
Refers to machines representing words most significant byte first. While x86 machines do not use big endian byte ordering (instead using little endian), the PowerPC and SPARC architectures do. This is also network byte order. See also: #Little endian.
Birthday attack
Take a function f() that seems to map an input to a random output of some fixed size (a pseudo-random function or PRF). A birthday attack is simply selecting random inputs for f() and checking to see if any previous values gave the same output. Statistically, if the output size is S bits, then one can find a collision in 2S/2 operations, on average.
Bit-flipping attack
In a stream cipher, flipping a bit in the ciphertext flips the corresponding bit in the plaintext. If using a message authentication code (MAC), such attacks are not practical. Blacklist When performing input validation, the set of items that — if matched — result in the input being considered invalid. If no invalid items are found, the result is valid. See also: #Whitelist.
A technique used to thwart timing attacks.
Block cipher
An encryption algorithm that maps inputs of size n to outputs of size n (n is called the block size). Data that is not a valid block size must somehow be padded (generally by using an encryption mode). The same input always produces the same output. See also: #Stream cipher.
A block cipher with 64-bit blocks and variable length keys, created by Bruce Schneier. This cipher is infamous for having slow key-setup times.
Brute-force attack
An attack on an encryption algorithm where the encryption key for a ciphertext is determined by trying to decrypt with every key until valid plaintext is obtained.
Buffer overflow
A buffer overflow is when you can put more data into a memory location than is allocated to hold that data. Languages like C and C++ that do no built-in bounds checking are susceptible to such problems. These problems are often security-critical.
See Certification Authority.
A piece of data, the absence of which indicates a violation of a security policy. Several tools use a canary for preventing certain stack-smashing buffer overflow attacks. See also: #Buffer overflow, #Stack smashing.
Capture-replay attacks
When an attacker can capture data off the wire and replay it later without the bogus data being detected as bogus.
Carter Wegmen + Counter mode
A parallelizable and patent-free high-level encryption mode that provides both encryption and built-in message integrity.
A block cipher with 64-bit blocks and key sizes up to 128 bits. It is patent- free, and generally considered sound, but modern algorithms with larger block sizes are generally preferred (e.g., AES). See also: #AES.
CBC Mode
See also: Cipher Block Chaining mode.
A simple construction for turning a block cipher into a message authentication code. It only is secure when all messages MAC'd with a single key are the same size. However, there are several variants that thwart this problem, the most important being OMAC. See also: #OMAC.
CCM mode
See also: #Counter mode + CBC-MAC.
A data object that binds information about a person or some other entity to a public key. The binding is generally done using a digital signature from a trusted third party (a certification authority).
Certificate Revocation List
A list published by a certification authority indicating which issued certificates should be considered invalid.
Certificate Signing Request
Data about an entity given to a certification authority. The authority will package the data into a certificate and sign the certificate if the data in the signing request is validated.
Certification Authority
An entity that manages digital certificates — i.e., issues and revokes. Verisign and InstantSSL are two well known CAs.
CFB mode
See also: #Cipher Feedback mode.
Chain responder
An OCSP responder that relays the results of querying another OCSP responder. See also: #OCSP.
Choke point
In computer security, a place in a system where input is routed for the purposes of performing data validation. The implication is that there are few such places in a system and that all data must pass through one or more of the choke points. The idea is that funneling input through a small number of choke points makes it easier to ensure that input is properly validated. One potential concern is that poorly chosen choke points may not have enough information to perform input validation that is as accurate as possible.
A UNIX system call that sets the root directory for a process to any arbitrary directory. The idea is compartmentalization: Even if a process is compromised, it should not be able to see interesting parts of the file system beyond its own little world. There are some instances where chroot "jails" can be circumvented; it can be difficult to build proper operating environments to make chroot work well.
Cipher-Block Chaining mode
A block cipher mode that provides secrecy but not message integrity. Messages encrypted with this mode should have random initialization vectors.
Cipher Feedback mode
A mode that turns a block cipher into a stream cipher. This mode is safe only when used in particular configurations. Generally, CTR mode and OFB mode are used instead since both have better security bounds.
The result of encrypting a message. See also: #Plaintext.
Ciphertext stealing mode
A block cipher mode of operation that is similar to CBC mode except that the final block is processed in such a way that the output is always the same length as the input. That is, this mode is similar to CBC mode but does not require padding. See also: #Cipher Block Chaining mode, #Padding.
Code auditing
Reviewing computer software for security problems. See also: #Audit.
Code signing
Signing executable code to establish that it comes from a trustworthy vendor. The signature must be validated using a trusted third party in order to establish identity.
Separating a system into parts with distinct boundaries, using simple, well- defined interfaces. The basic idea is that of containment — i.e., if one part is compromised, perhaps the extent of the damage can be limited. See also: #Jail, #Chroot.
Context object
In a cryptographic library, a data object that holds the intermediate state associated with the cryptographic processing of a piece of data. For example, if incrementally hashing a string, a context object stores the internal state of the hash function necessary to process further data.
Counter mode
A parallelizable encryption mode that effectively turns a block cipher into a stream cipher. It is a popular component in authenticated encryption schemes due to its optimal security bounds and good performance characteristics.
Counter mode + CBC-MAC
An encryption mode that provides both message secrecy and integrity. It was the first such mode that was not covered by patent.
A password-based authentication mechanism using a cryptographic hash function (usually MD5). It does not provide adequate protection against several common threats to password-based authentication systems. HTTP Digest Authentication is a somewhat better alternative; it is replacing CRAM in most places.
Cyclic Redundancy Check. A means of determining whether accidental transmission errors have occurred. Such algorithms are not cryptographically secure because attackers can often forge CRC values or even modify data maliciously in such a way that the CRC value does not change. Instead, one should use a strong, keyed message authentication code such as HMAC or OMAC. See also: #HMAC, #Message Authentication Code, #OMAC.
Critical extensions
In an X.509 certificate, those extensions that must be recognized by any software processing the certificate. If a piece of software does not recognize an extension marked as critical, the software must regard the certificate as invalid.
See also: #Certificate Revocation List.
Cross-site scripting
A class of problems resulting from insufficient input validation where one user can add content to a web site that can be malicious when viewed by other users to the web site. For example, one might post to a message board that accepts arbitrary HTML and include a malicious code item.
The science of breaking cryptographic algorithms.
Cryptographic hash function
A function that takes an input string of arbitrary length and produces a fixed- size output — where it is unfeasible to find two inputs that map to the same output, and it is unfeasible to learn anything about the input from the output.
Cryptographic randomness
Data produced by a cryptographic pseudo-random number generator. The probability of figuring out the internal state of the generator is related to the strength of the underlying cryptography — i.e., assuming the generator is seeded with enough entropy.
The science of providing secrecy, integrity, and non-repudiation for data.
See also: #Certificate Signing Request.
Cross-site scripting. Generally, however, this is abbreviated to XSS in order to avoid confusion with cascading style sheets. See also: #Cross-site scripting.
CTR mode
See also: #Counter mode.
CWC mode
See also: #Carter Wegmen + Counter mode.
Discretionary Access Control List. In a Windows ACL, a list that determines access rights to an object. See also: Access Control List.
An algorithm for turning a block cipher into a cryptographic one-way hash function.
Default deny
A paradigm for access control and input validation where an action must explicitly be allowed. The idea behind this paradigm is that one should limit the possibilities for unexpected behavior by being strict, instead of lenient, with rules.
A principle for building systems stating that multiple defensive mechanisms at different layers of a system are usually more secure than a single layer of defense. For example, when performing input validation, one might validate user data as it comes in and then also validate it before each use — just in case something was not caught, or the underlying components are linked against a different front end, etc.
Data encrypting key.
Delta CRLs
A variation of Certificate Revocation Lists that allows for incremental updating, as an effort to avoid frequently re-downloading a large amount of unchanged data. See also: #Certificate Revocation List.
Denial of service attack
Any attack that affects the availability of a service. Reliability bugs that cause a service to crash or go into some sort of vegetative state are usually potential denial-of-service problems.
The Data Encryption Standard. An encryption algorithm standardized by the US Government. The key length is too short, so this algorithm should be considered insecure. The effective key strength is 56 bits; the actual key size is 64 bits — 8 bits are wasted. However, there are variations such as Triple DES and DESX that increase security while also increasing the key size. See also: #Advanced Encryption Standard, #Triple DES.
An extended version of DES that increases the resistance to brute-force attack in a highly efficient way by increasing the key length. The extra key material is mixed into the encryption process, using XORs. This technique does not improve resistance to differential attacks, but such attacks are still generally considered unfeasible against DES. See also: #DES.
Dictionary attack
An attack against a cryptographic system, using precomputating values to build a dictionary. For example, in a password system, one might keep a dictionary mapping ciphertext pairs in plaintext form to keys for a single plaintext that frequently occurs. A large enough key space can render this attack useless. In a password system, there are similar dictionary attacks, which are somewhat alleviated by salt. The end result is that the attacker — once he knows the salt — can do a "Crack"-style dictionary attack. Crack-style attacks can be avoided to some degree by making the password verifier computationally expensive to compute. Or select strong random passwords, or do not use a password-based system.
Differential cryptanalysis
A type of cryptographic attack where an attacker who can select related inputs learns information about the key from comparing the outputs. Modern ciphers of merit are designed in such a way as to thwart such attacks. Also note that such attacks generally require enough chosen plaintexts as to be considered unfeasible, even when there is a cipher that theoretically falls prey to such a problem.
Diffie-Hellman key exchange
A method for exchanging a secret key over an untrusted medium in such a way as to preserve the secrecy of the key. The two parties both contribute random data that factors into the final shared secret. The fundamental problem with this method is authenticating the party with whom you exchanged keys. The simple Diffie-Hellman protocol does not do that. One must also use some public-key authentication system such as DSA. See also: #DSA, #Station-to-station protocol.
Digest size
The output size for a hash function.
Digital signature
Data that proves that a document (or other piece of data) was not modified since being processed by a particular entity. Generally, what this really means is that — if someone 'signs' a piece of data — anyone who has the right public key can demonstrated which private key was used to sign the data.
Digital Signature Algorithm
See also: #DSA.
Distinguished Encoding Rules
A set of rules used that describes how to encode ASN.1 data objects unambiguously. See also: #ASN.1.
Distinguished Name
In an X.509 certificate, a field that uniquely specifies the user or group to which the certificate is bound. Usually, the Distinguished Name will contain a user's name or User ID, an organizational name, and a country designation. For a server certificate, it will often contain the DNS name of the machine.
See also: #Distinguished Name.
Denial of Service. See also: #Denial of service attack.
The Digital Signature Algorithm, a public key algorithm dedicated to digital signatures which was standardized by NIST. It is based on the same mathematical principles as Diffie-Hellman.
Eavesdropping attack
Any attack on a data connection where one simply records or views data instead of tampering with the connection.
ECB Mode
See also: #Electronic Code Book mode.
See also: #Eliptic Curve Cryptography.
See also: #Entropy Gathering Daemon.
Electronic Code Book mode
An encryption mode for block ciphers that is more or less a direct use of the underlying block cipher. The only difference is that a message is padded out to a multiple of the block length. This mode should not be used under any circumstances.
Eliptic Curve Cryptography
A type of public key cryptography that — due to smaller key sizes — tends to be more efficient that standard cryptography. The basic algorithms are essentially the same, except that the operations are performed over different mathematical groups (called eliptic curves).
EME-OAEP padding
A padding scheme for public key cryptography that uses a "random" value generated, using a cryptographic hash function in order to prevent particular types of attacks against RSA. See also: #PKCS #1 padding.
When using a cipher to encrypt and a MAC to provide message integrity, this paradigm specifies that one encrypts the plaintext, then MACs the ciphertext. This paradigm has theoretically appealing properties and is recommended to use in practice. See also: #Authenticate-and-encrypt, #Authenticate-then-encrypt.
The byte ordering scheme that a machine uses (usually either little endian or big endian). See also:# Big endian, #Little endian.
Refers to the inherent unknowability of data to external observers. If a bit is just as likely to be a 1 as a 0 and a user does not know which it is, then the bit contains one bit of entropy.
Entropy Gathering Daemon
A substitute for /dev/random; a tool used for entropy harvesting.
Entropy harvester
A piece of software responsible for gathering entropy from a machine and distilling it into small pieces of high entropy data. Often an entropy harvester will produce a seed for a cryptographic pseudo-random number generator. See also: #Entropy, #Pseudo-random number generator.
Ephemeral keying
Using one-time public key pairs for session key exchange in order to prevent recovering previous session keys if a private key is compromised. Long-term public key pairs are still used to establish identity.
Euclidian algorithm
An algorithm that computes the greatest common divisor of any two numbers.
Extended Euclidian algorithm
An algorithm used to compute the inverse of a number modulo "some other number."
The output of a cryptographic hash function. See also: #Message digest.
Federal Information Processing Standard; a set of standards from NIST.
A standard authored by the U.S. National Institute of Standards and Technology, that details general security requirements for cryptographic software deployed in a government systems (primarily cryptographic providers). See also: #NIST, #FIPS.
Format string attack
The C standard library uses specifiers to format output. If an attacker can control the input to such a format string, he can often write to arbitrary memory locations.
Forward secrecy
Ensuring that the compromise of a secret does not divulge information that could lead to data protected prior to the compromise. In many systems with forward secrecy, it is only provided on a per-session basis, meaning that a key compromise will not affect previous sessions, but would allow an attacker to decrypt previous messages sent as a part of the current session. See also: #Perfect forward secrecy.
Hash function
A function that maps a string of arbitrary length to a fixed size value in a deterministic manner. Such a function may or may not have cryptographic applications. See also: #Cryptographic hash function, #Universal hash function, #One-way hash function.
Hash function (cryptographic)
See also: #Cryptographic hash function.
Hash function (one-way)
See also: #One-way hash function.
Hash function (universal)
See also: #Universal hash function.
Hash output
See also: #Hash value.
Hash value
The output of a hash function. See also: #Fingerprint, #Message digest.
A fast universal hash function from Dan Bernstein.
A well-known algorithm for converting a cryptographic one-way hash function into a message authentication code.
A block cipher with 128-bit keys and 64-bit blocks popularly used with PGP. It is currently protected by patents.
Identity establishment
An IEEE standard for eliptic curve cryptography. Implementing the standard requires licensing patents from Certicom.
Indirect CRLs
A CRL issued by a third party, that can contain certificates from multiple CA's. See also: #Certificate, #Certificate Revocation List, #Certification Authority.
Initialization vector
A value used to initialize a cryptographic algorithm. Often, the implication is that the value must be random. See also: #Nonce, #Salt.
Input validation
The act of determining that data input to a program is sound.
Integer overflow
When an integer value is too big to be held by its associated data type, the results can often be disastrous. This is often a problem when converting unsigned numbers to signed values.
Integrity checking
The act of checking whether a message has been modified either maliciously or by accident. Cryptographically strong message integrity algorithms should always be used when integrity is important.
Interleaved encryption
Processing the encryption of a message as multiple messages, generally treating every nth block as part of a single message.
See also: #Initialization vector.
A restricted execution environment meant to compartmentalize a process, so that — even if it has security problems — it cannot hurt resources which it would not normally have access to use. On FreeBSD, a system call similar to chroot that provides compartmentalization. Unlike chroot, it can also restrict network resources in addition to file system resources. See also: #Chroot.
An authentication protocol that relies solely on symmetric cryptography, as opposed to public key cryptography. It still relies on a trusted third party (an authentication server). While Kerberos is often looked upon as a way to avoid problems with Public Key Infrastructure, it can be difficult to scale Kerberos beyond medium-sized organizations. See also: #Public Key Infrastructure, #Trusted third party.
Key agreement
The process of two parties agreeing on a shared secret, where both parties contribute material to the key.
Key establishment
The process of agreeing on a shared secret, where both parties contribute material to the key.
Key exchange
The process of two parties agreeing on a shared secret, usually implying that both parties contribute to the key.
Key management
Mechanisms and process for secure creation, storage, and handling of key material.
Key schedule
In a block cipher, keys used for individual "rounds" of encryption, derived from the base key in a cipher-dependent manner.
Key transport
When one party picks a session key and communicates it to a second party.
Keystream Output
from a stream cipher. See also: #Pseudo-random number generator, #Stream cipher.
Lightweight Directory Access Protocol. A directory protocol commonly used for storing and distributing CRLs.
Length extension attack
A class of attack on message authentication codes, where a tag can be forged without the key by extending a pre-existing message in a particular way. CBC-MAC in its simplest form has this problem, but variants protect against it (particularly OMAC). See also: #Message Authentication Code, #OMAC.
See also: #Linear feedback shift register.
Linear cryptanalysis
A type of cryptanalytic attack where linear approximations of behavior are used. Modern ciphers of merit are designed in such a way as to thwart such attacks. Also note that such attacks generally require enough chosen plaintexts as to be considered unfeasible — even when there is a cipher that theoretically falls prey to such a problem (such as DES).
Linear Feedback Shift Register
A non-cryptographic class of pseudo-random number generators, where output is determined by shifting out "output" bits and shifting in "input" bits, where the input bits are a function of the internal state of the register, perhaps combined with new entropy. LFSRs are based on polynomial math, and are not secure in and of themselves; however, they can be put to good use as a component in more secure cryptosystems.
Little endian
Refers to machines representing words of data least significant byte first, such as the Intel x86. See also: #Big endian.
See also: #Message authentication code.
Man-in-the- middle attack
An eavesdropping attack where a client's communication with a server is proxied by an attacker. Generally, the implication is that the client performs a cryptographic key exchange with an entity and fails to authenticate that entity, thus allowing an attacker to look like a valid server.
A construction for turning a block cipher into a cryptographic one-way hash function.
The Modular Crypt Format, a de-facto data format standard for storing password hashes commonly used on UNIX boxes as a replacement for the traditional UNIX crypt() format.
Merkel-Damgard strengthening, a general method for turning a collision- resistant compression function into a collision-resistant hash function by adding padding and an encoded length to the end of the input message. The key point behind MD-strengthening is that no possible input to the underlying hash function can be the tail end of a different input.
A cryptographic hash function optimized for 16-bit platforms. It has poor performance characteristics on other platforms and has a weak internal structure.
A cryptographic hash function that is known to be broken and should not be used under any circumstances.
A popular and fast cryptographic hash function that outputs 128-bit message digests. Its internal structure is known to be weak and should be avoided if at all possible.
A way of using MD5 to store password authentication information, using the modular crypt format. See also: #MCF, #MD5.
A construction for turning a block cipher into a cryptographic hash function, where the output length is twice the block size of the cipher.
Meet-in-the- middle attack
A theoretical attack against encrypting a message twice using a single block cipher and two different keys. For example, double encryption with DES theoretically is no more secure than DES, which is why Triple DES became popular (it gives twice the effective key strength).
Message Authentication Code
A function that takes a message and a secret key (and possibly a nonce) and produces an output that cannot, in practice, be forged without possessing the secret key.
Message digest
The output of a hash function.
Message integrity
A message has integrity if it maintains the value it is supposed to maintain, as opposed to being modified on accident or as part of an attack.
A primality test that is efficient because it is probabilistic, meaning that there is some chance it reports a composite (non-prime) number as a prime. There is a trade-off between efficiency and probability, but one can gain extremely high assurance without making unreasonable sacrifices in efficiency.
In the context of public key cryptography, a value by which all other values are reduced. That is, if a number is bigger than the modulus, the value of the number is considered to be the same as if the number were the remainder after dividing the number by the modulus.
Near-collision resistance
Given a plaintext value and the corresponding hash value, it should be computationally unfeasible to find a second plaintext value that gives the same hash value.
The National Institute of Standards and Technology is a division of the U.S. Department of Commerce. NIST issues standards and guidelines, with the hope that they will be adopted by the computing community.
The capability of establishing that a message was signed by a particular entity. That is, a message is said to be non-repudiatable when a user sends it, and one can prove that the user sent it. In practice, cryptography can demonstrate that only particular key material was used to produce a message. There are always legal defenses such as stolen credentials or duress.
A value used with a cryptographic algorithm that must be unique in order to maintain the security of the system. Generally, the uniqueness requirement holds only for a single key — meaning that a {key, nonce} pair should never be reused. See also: #Initialization vector, #salt.
OCB mode
See also: #Offset Code Book mode.
See also: Online Certificate Status Protocol.
OCSP responder
The server side software that answers OCSP requests. See also: #Online Certificate Status Protocol.
OFB mode
See also: #Output Feedback mode.
Offset Code Book mode
A patented encryption mode for block ciphers that provides both secrecy and message integrity and is capable of doing so at high speeds.
One-key CBC-MAC. A secure, efficient way for turning a block cipher into a message authentication code. It is an improvement of the CBC-MAC, which is not secure in the arbitrary case. Other CBC-MAC variants use multiple keys in order to fix the problem with CBC-MAC. OMAC uses a single key and still has appealing provable security properties.
One-time pad
A particular cryptographic system that is provably secure in some sense, but highly impractical, because it requires a bit of entropy for every bit of message.
One-time password
A password that is only valid once. Generally, such passwords are derived from some master secret — which is shared by an entity and an authentication server — and are calculated via a challenge-response protocol.
One-way hash function
A hash function, where it is computationally unfeasible to determine anything about the input from the output.
Online Certificate Status Protocol
A protocol for determining whether a digital certificate is valid in real time without using CRLs. This protocol (usually abbreviated OCSP) is specified in RFC 2560.
Output Feedback mode
A block cipher mode that turns a block cipher into a stream cipher. The mode works by continually encrypting the previous block of keystream. The first block of keystream is generated by encrypting an initialization vector.
Data added to a message that is not part of the message. For example, some block cipher modes require messages to be padded to a length that is evenly divisible by the block length of the cipher — i.e., the number of bytes that the cipher processes at once.
Pluggable Authentication Modules is a technology for abstracting out authentication at the host level. It is similar to SASL, but is a bit higher up in the network stack and tends to be a much easier technology to use, particularly for system administrators, who can configure authentication policies quite easily using PAM. See also: #SASL.
Partial collision resistance
When it is unfeasible to find two arbitrary inputs to a hash function that produce similar outputs — i.e., outputs that differ in only a few bits.
Passive attack
See also: #eavesdropping attack.
A synonym for "password," meant to encourage people to use longer (it is hoped, more secure) values.
A value that is used for authentication.
Password-Based Key Derivation Function #2. An algorithm defined in PKCS #5 for deriving a random value from a password.
PEM encoding
A simple encoding scheme for cryptographic objects that outputs printable values (by Base 64 encoding a DER-encoded representation of the cryptographic object). The scheme was first introduced in Privacy Enhanced Mail, a defunct way of providing E-mail security.
Perfect forward secrecy
Ensuring that the compromise of a secret does not divulge information that could lead to the recovery of data protected prior to the compromise. See also: #Forward secrecy.
Public Key Cryptography Standard #1. A standard from RSA Labs specifying how to use the RSA algorithm for encrypting and signing data.
padding This form of padding can encrypt messages up to 11 bytes smaller than the modulus size in bytes. You should not use this method for any purpose other than encrypting session keys or hash values.
Describes a standard syntax for certification requests.
Specifies a programming interface called Cryptoki for portable cryptographic devices of all kinds.
Public Key Cryptography Standard #3. A standard from RSA Labs specifying how to implement the Diffie-Hellman key exchange protocol.
Public Key Cryptography Standard #5. A standard from RSA Labs specifying how to derive cryptographic keys from a password.
Public Key Cryptography Standard #7. A standard from RSA Labs specifying a generic syntax for data that may be encrypted or signed.
See also: #Public Key Infrastructure.
An unencrypted message. See also: #Ciphertext.
The MAC portion of the OCB block cipher mode. It is a patented way of turning a block cipher into a secure, parallelizable MAC.
Precomputation attack
Any attack that involves precomputing significant amounts of data in advance of opportunities to launch an attack. A dictionary attack is a common precomputation attack.
Private key
In a public key cryptosystem, key material that is bound tightly to an individual entity that must remain secret in order for there to be secure communication.
Privilege separation
A technique for trying to minimize the impact that a programming flaw can have, where operations requiring privilege are separated out into a small, independent component (hopefully audited with care). Generally, the component is implemented as an independent process, and it spawns off a non-privileged process to do most of the real work. The two processes keep open a communication link, speaking a simple protocol.
See also: #Pseudo-random number generator.
Pseudo-random number generator
An algorithm that takes data and stretches it into a series of random-looking outputs. Cryptographic pseudo-random number generators may be secure if the initial data contains enough entropy. Many popular pseudo-random number generators are not secure. See also: #Stream cipher.
Public key
In a public key cryptosystem, the key material that can be published publicly without compromising the security of the system. Generally, this material must be published; its authenticity must be determined definitively.
Public Key Infrastructure
A system that provides a means for establishing trust as to what identity is associated with a public key. Some sort of Public Key Infrastructure (PKI) is necessary to give reasonable assurance that one is communicating securely with the proper party, even if that infrastructure is ad hoc."
See also: #Registration Authority.
Race condition
A class of error in environments that are multi-threaded or otherwise multi- tasking, where an operation is falsely assumed to be atomic. That is, if two operations overlap instead of being done sequentially, there is some risk of the resulting computation not being correct. There are many cases where such a condition can be security critical. See also: #TOCTOU problem.
A measure of how unguessable data is. See also: #Entropy.
A block cipher with variable key sizes and 64-bit blocks.
A widely used stream cipher that is relatively fast but with some significant problems. One practical problem is that it has a weak key setup algorithm, though this problem can be mitigated with care. Another more theoretical problem is that RC4's output is easy to distinguish from a truly random stream of numbers. This problem indicates that RC4 is probably not a good long-term choice for data security.
A block cipher that has several tunable parameters.
Registration Authority
An organization that is responsible for validating the identity of entities trying to obtain credentials in a Public Key Infrastructure. See also: #Certification Authority, #Public Key Infrastructure.
Changing a key in a cryptographic system.
Related key attack
A class of cryptographic attack where one takes advantage of known relationships between keys to expose information about the keys or the messages those keys are protecting.
In the context of Public Key Infrastructure, the act of voiding a digital certificate. See also: #Public Key Infrastructure, #X.509 certificate.
A cryptographic hash function that is well regarded. It has a 160-bit output, and is a bit slower than SHA1.
A construction for making a Message Authentication Code out of a block cipher. It is not generally secure in the way that OMAC is, and is generally considered not worth using due to the existence of better alternatives. See also: #OMAC.
Rollback attack
An attack where one forces communicating parties to agree on an insecure protocol version.
Root certificate
A certificate that is intrinsically trusted by entities in a Public Key Infrastructure — generally should be transported over a secure medium. Root certificates belong to a Certification Authority and are used to sign other certificates that are deemed to be valid. When a system tries to establish the validity of a certificate, one of the first things that should happen is that it should look for a chain of trust to a known, trusted root certificate. That is, if the certificate to be validated is not signed by a root, one checks the certificate(s) used to sign it to determine if those were signed by a root cert. Lather, rinse, repeat. See also: #Public Key Infrastructure.
In a block cipher, a group of operations applied as a unit that has an inverse that undoes the operation. Most block ciphers define a round operation and then apply that round operation numerous times — though often applying a different key for each round, where the round key is somehow derived from the base key.
A popular public key algorithm for encryption and digital signatures invented by Ron Rivest, Adi Shamir and Leonard Adleman. It is believed that, if factoring large numbers is computationally unfeasible, then RSA can be used securely in practice.
A padding standard defined in PKCS #1, used for padding data prior to RSA signing operations.
A popular one-time password system. See also: #One-time password.
A protocol for secure electronic mail standardized by the IETF. It relies on standard X.509-based Public Key Infrastructure.
System Access Control List. In Windows, the part of an ACL that determines audit logging policy. See also: #Access Control List, #DACL.
Data that can be public but is used to prevent against precomputation attacks. See also: #Initialization vector, #Nonce.
The Simple Authentication and Security Layer, which is a method for adding authentication services to network protocols somewhat generically. It is also capable of providing key exchange in many circumstances.
Secret key
See also: #Symmetric key.
Secure Socket Layer
A popular protocol for establishing secure channels over a reliable transport, utilizing a standard X.509 Public Key Infrastructure for authenticating machines. This protocol has evolved into the TLS protocol, but the term SSL is often used to generically refer to both. See also:#Transport Layer Security.
A value used to initialize a pseudo-random number generator. See also: #Entropy, #initialization vector, #Pseudo-random number generator.
Self-signed certificate
A certificate signed by the private key associated with that certificate. In an X.509 Public Key Infrastructure, all certificates need to be signed. Since root certificates have no third-party signature to establish their authenticity, they are used to sign themselves. In such a case, trust in the certificate must be established by some other means.
A modern block cipher with 128-bit blocks and variable-sized keys. A finalist in the AES competition, Serpent has a higher security margin by design than other candidates, and is a bit slower on typical 32-bit hardware as a result. See also: #AES.
Session key
A randomly generated key used to secure a single connection and then discarded.
A cryptographic hash function from NIST with 256-bit message digests.
SHA-512 with a truncated digest (as specified by NIST).
A cryptographic hash function from NIST with 512-bit message digests.
A fairly fast, well regarded hash function with 160-bit digests that has been standardized by the National Institute of Standards and Technology (NIST).
A value shared by parties that may wish to communicate, where the secrecy of that value is an important component of secure communications. Typically, a shared secret is either an encryption key, a MAC key, or some value used to derive such keys.
Shatter attack
A class of attack on the Windows event system. The Windows messaging system is fundamentally fragile from a security perspective because it allows for arbitrary processes to insert control events into the message queue without sufficient mechanisms for authentication. Sometimes messages can be used to trick other applications to execute malicious code.
Single sign-on
Single sign-on allows you to access all computing resources that you should be able to reach by using a single set of authentication credentials that are presented a single time per login session. Single sign-on is a notion for improved usability of security systems that can often increase the security exposure of a system significantly.
Snooping attacks
Attacks where data is read off a network while in transit without modifying or destroying the data.
A very fast stream cipher that is patent-free and seems to have a very high security margin.
SQL Injection
When an attacker can cause malicious SQL code to run by maliciously modifying data used to compose an SQL command.
See also: #Secure Socket Layer.
Stack smashing
Overwriting a return address on the program execution stack by exploiting a buffer overflow. Generally, the implication is that the return address gets replaced with a pointer to malicious code. See also: #Buffer overflow.
Station-to-station protocol
A simple variant of the Diffie-Hellman key exchange protocol that provides key agreement and authenticates each party to the other. This is done by adding digital signatures (which must be done carefully). See also: #Diffie-Hellman key exchange.
Stream cipher
A pseudo-random number generator that is believed to be cryptographically strong and always produces the same stream of output given the same initial seed (i.e., key). Encrypting with a stream cipher consists of combining the plaintext with the keystream, usually via XOR. See also: #Pseudo-random number generator.
Strong collision resistance
Strong collision resistance is a property that a hash function may have (and a good cryptographic hash function will have), characterized by it being computationally unfeasible to find two arbitrary inputs that yield the same output. See also: #Hash function, #Weak collision resistance.
Surreptitious forwarding
An attack on some public key cryptosystems where a malicious user decrypts a digitally signed message and then encrypts the message using someone else's public key: giving the end receiver the impression that the message was originally destined for them.
Symmetric cryptography
Cryptography that makes use of shared secrets as opposed to public keys.
Symmetric key
See also: #Shared secret.
The result of applying a keyed message authentication code to a message. See also: #Message Authentication Code.
See also: #Anti-tampering.
Threat model
A representation of the system threats that are expected to be reasonable. This includes denoting what kind of resources an attacker is expected to have, in addition to what kinds of things the attacker may be willing to try to do. Sometimes called an architectural security assessment.
Time of check, time of use problem
See also: #TOCTOU problem.
See also: #Transport Layer Security.
A two-keyed variant of the CBC-MAC that overcomes the fundamental limitation of that MAC. See also: #Message Authentication Code, #CBC-MAC, #OMAC.
TOCTOU problem
Time-of-check, time-of-use race condition. A type of race condition between multiple processes on a file system. Generally what happens is that a single program checks some sort of property on a file, and then in subsequent instructions tries to use the resource if the check succeeded. The problem is that — even if the use comes immediately after the check — there is often some significant chance that a second process can invalidate the check in a malicious way. For example, a privileged program might check write privileges on a valid file, and the attacker can then replace that file with a symbolic link to the system password file. See also: #Race condition.
Transport Layer Security
The successor to SSL, a protocol for establishing secure channels over a reliable transport, using a standard X.509 Public Key Infrastructure for authenticating machines. The protocol is standardized by the IETF. See also: #Secure Socket Layer.
Triple DES
A variant of the original Data Encryption Standard that doubles the effective security. Often abbreviated to 3DES. The security level of 3DES is still considered to be very high, but there are faster block ciphers that provide comparable levels of security — such as AES.
See also: #Backdoor.
Trojan Horse
See also: #Backdoor.
Trusted third party
An entity in a system to whom entities must extend some implicit trust. For example, in a typical Public Key Infrastructure, the Certification Authority constitutes a trusted third party.
A modern block cipher with 128-bit blocks and variable-sized keys. A finalist in the AES competition; it is an evolution of the Blowfish cipher. See also: #AES, #Blowfish.
A secure MAC based on a set of universal hash functions that is extremely fast in software but so complex that there has never been a validated implementation. See also: #Universal hash function.
Universal hash function
A keyed hash function that has ideal hash properties. In practice, the only practical functions of this nature are really "almost universal" hash functions, meaning they come very close to being ideal. Universal and near-universal hash functions are not cryptographically secure when used naively for message authentication but can be adapted to be secure for this purpose easily. See also: #Cryptographic hash function, #Hash function, #one-way hash function.
The act of determining that data is sound. In security, generally used in the context of validating input.
Weak collision resistance
A property that a hash function may have (and a good cryptographic hash function will have), characterized by it being unfeasible to find a second input that produces the same output as a known input. See also: #Hash function, #Strong collision resistance.
When performing input validation, the set of items that, if matched, results in the input being accepted as valid. If there is no match to the whitelist, then the input is considered invalid. That is, a whitelist uses a "default deny" policy. See also: #Blacklist, #Default deny.
Window of vulnerability
The period of time in which a vulnerability can possibly be exploited.
X.509 certificate
A digital certificate that complies with the X.509 standard (produced by ANSI).
A three-key variant of the CBC-MAC that overcomes the fundamental limitation of that MAC. See also: #Message Authentication Code, #CBC-MAC, #OMAC.
A patented parallelizable Message Authentication Code.
See also: #Cross-site scripting.
: Top - 0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z


text:
An Interview With Ron Paul
- Share
- Tweet
- Comment Now 0
While I was covering CPAC for PJTV, I set up an on camera interview with Ron Paul. Unfortunately, due to circumstances beyond our control, we weren't able to actually do the interview.
So, when I got back, I pursued an interview with Ron Paul for Right Wing News. I wasn't sure the interview would happen because not only do I have some differences of opinion with Ron Paul, I was very hard on him during the 2008 elections.
Still, despite whatever differences we may have, I sincerely appreciate the fact that he was willing to talk with me and was also willing, without the slightest complaint, to answer all the questions I had for him, some of which were pretty tough.
What follows is a slightly edited transcript of the conversation I had last Friday with Ron Paul.
First of all, let's assume Obamacare isn't repealed and we continue to run massive deficits as far as the eye can see, just as the Obama administration is predicting right now. What are the consequences of that in a decade or two?
If it lasts that long, it just means that there will be a lot of inflation. Interest rates have already started to go up and we have price inflation in medical care as well as all the other problems. With interest rates rising and inflation coming back, this will lower the standard of living of all Americans. Actually, the standard of living has been going down for over 10 years and real wages have gone down over these past 10 years. So a program like this on top of our problems just makes things much worse, just hastens the day that the dollar will lose a lot more value — maybe to the point where they will destroy the dollar completely.
Now, you're a doctor — so you're especially qualified to speak on the health care reform bill that just passed. If one of your constituents came up to you and asked what to expect from this bill over time if it remains in place, what would you tell him?
They're going to get a lot worse care, there will be more between the doctor and the patient –already there's way too much interference between the doctor and patient. We have the insurance company and the medical management companies already, but this will add to the government's bureaucrats, it will indirectly have the drug companies involved, and the insurance companies will stay involved. It just will become more bureaucratic, doctors will become more frustrated, and there will be less doctors available because the ones who have been on the verge of quitting will probably quit. Eventually, the amount of care will have to be rationed because the cost will go up, the government will always see shortfalls, and because of the shortage of doctors, care will be rationed. It will make our patients a lot more unhappy.
OK, let me ask you a couple of tougher questions. You think it's been proven that Barack Obama was born in Hawaii or do you believe his real birthplace is still in doubt?
Oh, I don't have a strong opinion about that. I would say that until they prove otherwise, that he was born in Hawaii.
One more question along those similar lines. During the campaign in 2008, there was a lot of talk about the North American Union. It sort of dropped off the radar after Bush left office. Post-Bush, what do you think about that?
I think it might be a very bad sign because there had been talk about the North American Union and currency for this hemisphere. But I think what has happened is that the United States internationally has become such a powerhouse with their empire that they more or less have taken over the United Nations. Instead of them being on the short end of votes, I think they have literally become the owners.
So therefore, I'm more concerned about a world currency rather than a hemispheric currency…. But the move away from sovereign nations is still ongoing. There's still this effort to take advantage of this crisis and move toward an international agreement or a world government. So I see the fact that they talk less about regional government is probably… is not a good sign.
Now one idea that you've championed that's gained a lot of support in both parties is auditing the Fed. Can you explain the idea to someone who says, "I don't know why we need to do this?" What would you say to him about why we need to audit the Fed?
Well, fortunately, I don't get many questions like that. Most of the time I get questions like, "Why in the world aren't we auditing the Fed?" That, of course, is the better question because we should know. During the financial crisis, the Fed created $2 trillion, they passed the money out to their friends, and they refused to tell us, the Congress, and the American people where this money has gone. So this sort of set the stage for the American people to demand that we have an audit. I've been working on that for years, but there was no interest.
But, the crisis has gotten a lot of people interested in the subject and I think that's the reason that all the Republicans in the House have supported this. Well over 100 of the Democrats support it, too; so I think we're certainly moving in that direction — but it's important to know, just for transparency's sake, and who gets the benefits and which people, which companies are allowed to drop through the cracks.
Now one of the things that has most contributed to the perception that Congress is corrupt, is earmarking. We regularly see cases where campaign contributors receive earmarks or earmarks seem to be traded for votes. Now many Republicans support a ban on earmarks for that reason, but you don't. Can you talk a little bit about why that is?
Yes, I see this in a constitutional manner and think that one of the problems that we have faced in the last 50 years has been the steady erosion of constitutional power, the giving up of the prerogatives to the executive branch, as well as to the judicial branch. I don't want a strong executive branch. I don't want presidents to be able to go to war without declarations. I don't want presidents to write executive orders, signing statements, because that gives them way too much power. We've allowed the executive branch to write regulations, which have the force of law.
This is just another example of the Congress giving up their prerogatives because when you have a chance to vote against an earmark, you don't save any money. You say that this money can't be earmarked for somebody's district to build a highway. Well, the money came out of the district, so why should we let the bureaucrats or the executive branch decide who gets the money? The President comes back and says, "Oh, ok, I can put it in the budget if you do A, B, C, & D for me." So, it gives the executive branch that much more power. So, I see this in a very strict constitutional sense. I defend strongly the responsibility of the Congress to designate every penny they spend. Yet, I think all the spending is too much; so I vote against all the appropriations.
Besides, the definition of earmarks is different. When they talk about earmarks, they are these special things that might go to a person's district. It's less than one percent of the budget. But the way I look at earmarks — I think earmarking $1 billion to build an embassy in London — it makes no sense whatsoever. I don't want that either; so that's my reason for opposing the ban on earmarks. I want the Congress to designate where every penny should be spent.
Now there's a debate among some Libertarians whether it's better to support a third party or to come into the Republican Party and try to make changes from within. Where do you come down on that?
…I'd say work within, but that's my personal decision. There was one time in my life when I was trying to do it outside the Republican Party, but….I get the question all the time and I just tell the people to do what you feel like, do what you want to do. Do what you're most comfortable with and where you think you can do the most good. Some people don't want to work within the Republican Party; so they should do whatever they'd like to do. There's no one answer for everybody.
I do point out to people, though, that the election laws are controlled by the Republicans and Democrats; so that's one thing they agree on. If you exclude any opposition outside the two party system philosophically, then that squeezes people because philosophically, there's not a whole lot of difference when you look at history. Government keeps growing regardless of which party is in power. So I just think that with the way they pass laws, like the getting into debates, getting on ballots, and the way you're treated by the media, it's just very, very difficult to have any democratic competition in this country.
Now there was a debate question you were asked that I remember. It had to do with eliminating both the CIA and FBI. Those weren't the only agencies the question mentioned, but it did mention those two. You seemed, as I remember, to be answering that if you had your way, yes, you would do that. Don't both those agencies, despite their flaws, serve vital roles? Can you elaborate on your views there a little bit?
Yes. I think intelligence gathering is very, very important. Matter of fact, there was somebody on TV just recently, an ex-CIA agent who has just written a book on this subject. He thinks the CIA is totally inept and has never produced worthwhile information. Even when they're given good information, like on the underwear bomber, they don't know what to do with it. So on intelligence gathering, there's a military and I think there are certain things that the FBI ought to do, but I don't think the FBI should ever be spying on groups of people like they did in the anti-war movement in the '60's — like they do when they infiltrate the right to life groups or the pro-gun groups. Spying on the American people is not part of the American process; so that's what I object to.
The CIA is involved in way too much. Not only do we fight undeclared wars, but it's the CIA operating their computers who decide who gets bombed and who doesn't get bombed in Pakistan and in Yemen. To me, it is just totally bewildering that we put up with this. There's no real oversight for the CIA.
There have been so many CIA agents who have left the department and wrote about this. They get involved in foreign elections. They get involved in killing people. I just don't think that the CIA has proved themselves to be worth very much. We could still deal with intelligence gathering without the intrigue of the CIA being involved in so much secret activity involvement in other countries as well as in our own country.
Now as I'm hearing it, it sounds like you'd maybe reform both agencies instead of getting rid of them. Is that basically what you mean?
Well, I'd probably lean more on the gathering of information with the military and the FBI. But I'd curtail their activities once they do this blanket spying on people. Of course, since we've had the Patriot Act, this gives them license to watch anything and everything all American citizens do, whether it's their telephones, their faxes, their e-mail, or whatever.
Now what would you say to the argument that illegal aliens contribute to the tax base and do jobs that Americans won't do? Plus, what about the idea that people should be able to go wherever they want across the border — so we should allow them to come into the United States and be citizens?
Well, I disagree with it. Citizenship should be restricted and it should be kept legal. It is true that illegal aliens will have some benefits and they will be productive to some degree. But if you add the pluses and the minuses, actually there've been some studies on this to show that it's actually a negative — because if they know and anticipate that they will get citizenship, then they bring their families in. Their families use our emergency rooms and our schools. If you add it all up, it is a tax. It is a burden. What we need to deal with is how do we get back to a thriving, healthy free market economy? (If we were) more lenient on our immigration laws, they should not qualify for any freebies and they should certainly not be rewarded by citizenship.
Getting down to the last two questions here…. Most people consider Abe Lincoln to be one of our greatest presidents, if not the greatest president we've ever had. Would you agree with that sentiment and why or why not?
No, I don't think he was one of our greatest presidents. I mean, he was determined to fight a bloody civil war, which many have argued could have been avoided. For 1/100 the cost of the war, plus 600 thousand lives, enough money would have been available to buy up all the slaves and free them. So, I don't see that is a good part of our history. Besides, the Civil War was to prove that we had a very, very strong centralized federal government and that's what it did. It rejected the notion that states were a sovereign nation.
The people who disagree want to turn around and say, "Oh, yes, those guys just wanted to protect slavery." But that's just a cop-out if you look at this whole idea of what happened in our country because Lincoln really believed in the centralized state. He was a Hamiltonian type and objected to everything Jefferson wanted.
Ok, and the last question. If somehow you were allowed to make three changes to the law or amendments to the Constitution, any three you wanted, what would they be.
I'll qualify this with the statement that the Constitution is not all that bad. Our problem is people ignore it. I mean, you take the proper interpretation of the interstate commerce clause and the general welfare clause — and we know what it means, but people want to read something else into it so the words have no meaning. The words only depend on the character of the people whom we elect. In the last 100 years, the character of those individuals has been very, very sloppy in watching out for our rights.
I guess, if you wanted to try a little harder to protect against that, you could write in some more prohibitions. They thought for sure if they just said this is what you're allowed to do, you can't do anything else, the people would be able to read into that. It looks to me like in this day and age, you almost have to write down and say what the government is not allowed to do.
So, writing some prohibitions that say you can't develop the welfare state and you can't go to — we already have it in there, you can't go to war without a declaration, but I think I would write into the Constitution, the guarantee for nullification of laws. I imagine you could write the Second Amendment a little bit better to make that very, very explicit, but unfortunately, better language could be helpful — but the only thing that is going to improve things is better people being in charge.
Ron, I really appreciate your time. Thank you.
Thank you.
- Share
- Tweet
- Comment Now 0

subset: commoncrawl


text:
Monday, June 22, 2009
As the harvest period is quite limited and we only get to enjoy apricots for a very short lapse of time (June - August), it is better to start cooking and baking with them as early as possible. Nothing quite compares to a juicy and fragrant apricot which has been freshly picked from the tree.
It is for that reason that I've decided to compile my apricot-based recipes as well as a few of them I have found while surfing on the internet. So don't forget to buy regional (or as sustainably as possible) as well as seasonal products, run to the kitchen and enjoy what nature offers plentifully!
Isn't life beautiful?
My apricot recipes:
Amaretti, Apricot Jam & Coconut Bars (see recipe)
Apricot Clafoutis (see recipe)
Apricot Muffins (see recipe)
Beer & Apricot Clafoutis (see recipe)
Cinnamon & Apricot Flan Tart (see recipe) Lemon Chestnut Cake & apricot Coulis (see recipe)
Tatsch With Apricot Compote (see recipe)
Apricot recipes from the net:
All Recipes (see link)
Apricot Almond Cofee Cake (see recipe)
Apricot Jam (see recipe)
Apricot Scones (see recipe)
Epicurious recipes (see link)
Rice Pudding Cake & Apricot Compote (see recipe)
Tagine-Style Moroccan Lamb (see recipe)
59 comments:
Thanks for the compilation of recipes for this wonderful summer fruit. Now we know what we can make! First I must check out the Tagine!ReplyDelete
Lovely compilation Rosa! :)ReplyDelete
Thanks, very helpful, i jus made apricot cake yesterday!!ReplyDelete
I have been looking for apricot recipes.. Now you have made it easier for me.Will chekc out the links.ReplyDelete
Thankyou for doing allthe work.
On a vraiment le choix chez toi, pour profiter des saveurs de l'abricot avec les belles recettes que tu nous propose.ReplyDelete
Wonderful photos. And wonderful apricot recipes!ReplyDelete
Nice compilation of ideas! I am now patiently waiting for apricot season because all the ones in the grocery stores are the equivalent of cardboard.ReplyDelete
Great list. The cinnamon and apricot flan tart looks incredible!ReplyDelete
splendides photos! biises mickyReplyDelete
ah this is great. I have some apricots I need to use up! Thanks for sharing!!ReplyDelete
Apricots are one of my favourite fruits and the recipes are so wonderful! 'Thanks so much for the inspiration.ReplyDelete
What a beautiful photographs Rosa, and the recipes are quite tempting as well.ReplyDelete
- Anonymous5:18 PM, June 22, 2009
Thank you for sharing your collection of apricot recipes! Love apricots!ReplyDelete
nice compilation. BTW, first time here, it was lovely browsing thru your blog!ReplyDelete
Apricots add such zip and zing to things. Thanks for the recipes AND the lovely pictures.ReplyDelete
Mmm I'm seeing more and more apricot recipes around the blogosphere, and I'm lovin it! ;DReplyDelete
I love apricots!ReplyDelete
I like the recipe for the jam.
It is so sad to see things that are only good a few months out of the year!
Very nice compilation! They all sound wonderful! I love fresh apricots!ReplyDelete
Merci pour cette recap de bonnes recettesReplyDelete
I love apricots, and I haven't had any yet this summer - thanks for the recipes!ReplyDelete
You Apricot pics make me want to run out and get some. LovelyReplyDelete
je résiste , je résiste, les trucs durs et pas murs que l'on essaie de nous vendre ne me disent rien qui vaille ( surtout que c'est cher !)ReplyDelete
And your photographs absolutely celebrate the season.ReplyDelete
I love fresh apricots! Lovely photos!ReplyDelete
I love that 3rd photo! The apricot recipes look good too!ReplyDelete
- Anonymous2:17 AM, June 23, 2009
Ok, I'm gonna have to run out to get a whole crate of apricots now. Those recipes sound freaking awesome!ReplyDelete
Thanks for all the apricot ideas.. They are one of my favorite fruits.ReplyDelete
I love the photos! Can't wait to browse around those recipes..ReplyDelete
Apricot is one of my favorite summer fruit.ReplyDelete
Not possible to resist this little velvety fruit!
I love apricots and am excited to for them to show up at the market!ReplyDelete
- Anonymous7:05 AM, June 23, 2009
Great, a summarization of all your abricot recipes. Danke und liebe Grüsse !ReplyDelete
Merci pour toutes ces recettes Rosa. Les abricots du jardin ne devraient pas tarderReplyDelete
Nice Recipes, i like those Tipps. :)ReplyDelete
Greets Dirk
C'est une excellente idée ce récap ! Les premiers abricots testés ce week-end étaient excellents ce qui n'est pas le cas tous les ans.ReplyDelete
Bonjour Rosa!ReplyDelete
Ça tombe bien je suis dans une période abricot!
Merci beaucoup pour tous ces liens vers ces recettes.ReplyDelete
Bisous, Doria
Une halte en couleur sur ton blog, pour l'abricot déjà, je viens de réaliser une recette à la lavande... pour les photos de notre belle région et aussi pour les sablés au parmesan, un vrai délice... mille bisesReplyDelete
j'adore l'abricot sous toutes ses formes!! merci! bisousReplyDelete
superbe photoosReplyDelete
merci pr le recap
oh quel bonheur ce petit fruit orangé !!!ReplyDelete
je l'aime légèrement acide, pas trop sucré, cuit ou cru, pour notre plus grande gourmandise !!!
merci pour toutes ces idées !!!
apricot is indeed one of my fave fruit!! and what a lovely recipe compilation you've got here!thanks for sharing themReplyDelete
Alors cette année je suis dingue de l'abricot ! j'en mange sans arret et à toutes les sauces ;-)ReplyDelete
* * Bises
Hi Rosa - so sorry I have been absent - I am alive and well, and keeping very busy. I am hoping I can finally slow down enough to visit with some of my favorite bloggers - that would be you too! Hope all is well in your universe!ReplyDelete
The Flathead cherries will soon be ready here... OH MY there is no fruit better!!! And we get to go to the Flathead and pick them ourselves. I cannot wait!
Be well and have an amazing day!!!!
hugs from Montana!
its apricot in focus..yesterday i even saw some grilled apricot recipes..these variety look just awesomeReplyDelete
hello today I have posted a very light dessert so I hope you come and visit me Cheers PierreReplyDelete
en voilà de quoi se régalerReplyDelete
Quelles sont jolies ces photos d'abricotsReplyDelete
de plus j'adore ça
Thank you so much for all the great ways to use this yummy fruit!ReplyDelete
Wow you've sure made a lot of apricot recipes! Your love for apricots is clearly visible :)ReplyDelete
I'd love the Jam with these gorgeous fruit:)ReplyDelete
I really feel that apricots are fruit of the gods. When in season they are just so delicious. I love apricot coulis in particular.ReplyDelete
Gorgeous photos and recipes Rosa! :)ReplyDelete
rosa vat a stunning photographs. as usual this apricot recipe sound wonderfulReplyDelete
Wonderful photos and great suggestions.Thanks xReplyDelete
Thanks for the links! I'm going to check 'em out! Trying to expand my horizons!ReplyDelete
- Anonymous4:40 AM, June 25, 2009
Mmmm- apricots! We're still a few weeks away from that harvest here.ReplyDelete
Merci d'avoir fait ce récapitulatif autour de l'abricot!!ReplyDelete
Apricots are like rhubarb, one must load up while they're short season is still alive!ReplyDelete
Lovely photos, I feel like biting into them right now!
superbe collection et j'aimerais ajouter la tourte aux abricots de Betty Bossi. du livres "Patisseries" que j'ai teste aujourd'hui !ReplyDelete
yummy !


text: ©Robb Scharetg - Ed and his GSP. DC photographer , SF photograper . DC photographer , SF photograper - washington dc commercial photographer, washington dc commercial photography, washington dc lifestyle photographer, washington dc lifestyle photography, washington dc portrait photographer, washington dc portrait photographer, maryland portrait photographer, maryland portrait photography, washington dc portrait photography, maryland lifestyle photographer, maryland lifestyle photography, maryland commercial photographer, maryland commercial photography, virginia lifestyle photographer. virginia lifestyle photography, virginia commercial photographer, virginia commercial photography, virginia portrait photographer, virginia portrait photography, washington dc advertising photographer, maryland advertising photographer, virginia advertising photographer, washington dc industrial photographer, maryland industrial photographer, virginia industrial photographer, washington dc industrial photography, maryland industrial photography, virginia industrial photography Level 3; Lockheed; AIC; Air Force; Aviaonics; Boeing; Northrop Grumman; Raytheon; USAF; Special Ops; Spooky; Puff the Magic Dragon; military; ©Robb Scharetg; AIC; air assault; Air base.; Aircraft; airfield; Armed forces; Aviation; BAE; Bell-Textron; defense; DRS; duty; EADS; Flight Ops; fuselage; GE; General Electric; Grumman; Grumman Airfcraft; Guidant; gunship; Robb Scharetg; Scharetgpictures; scharetgpictures.com; SF photographer; Teamwork; Textron; United States of America; URS; US; US Airforce ; Boat; CHS; Cape Decato; Charleston; Commercial Shipping; Container Ship; Container Terminal; FLETC; MARAD; Merchant Marine; Merchant Mariners; NAVY; RRF; Robb Scharetg; Shipping; South Carolina; Transportation; ship; Robb Scharetg; Scharetgpictures; scharetgpictures.com; SF photographer; DC Photographer; Chevy; Chevrolet; truck; pickup; pickup truck; tough; wheels, port, CHS, Port of Charleston ; Boat; CHS; Cape Decato; Charleston; Commercial Shipping; Container Ship; Container Terminal; FLETC; MARAD; Merchant Marine; Merchant Mariners; NAVY; RRF; Robb Scharetg; Shipping; South Carolina; Transportation; ship, Propeller; woman at work, women's work, tough, Ready reserve; Ready Reserve Fleet; BAE; Hard Hat; Huntington Ingalls; Cape Diamond; Construction; industry; Labor; wrench, tool, tools, Port of Charleston; Portrait; Shipyard; work; worker;


text:
electricBricks uses cookies to provide you a better service. By continuing browsing the site you agree to Using CookiesI agree.
Telephone attention
Secure payment
Para alumnos de 6 a 18 años
Product type: Part
Category: Tile, Round, Decorated
LEGO® Design ID: 14769pb451
LEGO® Element ID:6346038
LEGO® color: White
Stock: 4
Possible colors:


text:
Filter by Topic
- (-) Remove Ethics filter Ethics
- (-) Remove Organizations filter Organizations
- (-) Remove Outreach filter Outreach
Filter by Format
- (-) Remove Articles filter Articles
Displaying 1 - 1 of 1 items.
The Doula Project (2007– )
The Doula Project, cofounded in 2007 as The Abortion Doula Project by Mary Mahoney, Lauren Mitchell, and Miriam Zoila Perez, is a nonprofit organization of full-spectrum doulas based in New York City, New York, and is one of the first organizations to provide free full-spectrum doula care to pregnant people. Full-spectrum doulas provide non-medical physical, emotional, and informational support to pregnant people through a wide range of pregnancy experiences, including birth, miscarriage, stillbirth, fetal anomalies, and abortion.
Format: Articles
Subject: Organizations, Outreach, Ethics, Reproduction


text:
By E.G. Nadhan, HP
In an earlier post for The Open Group Blog on the Top 5 tell-tale signs of SOA evolving to the Cloud, I had outlined the various characteristics of SOA that serve as a foundation for the cloud computing paradigm. Steady growth of service oriented practices and the continued adoption of cloud computing across enterprises has resulted in the need for integrating out to the cloud. When doing so, we must take a look back in time at the evolution of integration solutions starting with point-to-point solutions maturing to integration brokers and enterprise services buses over the years. We should take a lesson from history to ensure that this time around, when integrating to the cloud, we prevent undue proliferation of point-to-point solutions across the extended enterprise.
We must exercise the same due-diligence and governance as is done for services within the enterprise. There is an increased risk of point-to-point solutions proliferating because of consumerization of IT and the ease of availability of such services to individual business units.
Thus, here are 5 steps that need to be taken to ensure a more systemic approach when integrating to cloud-based service providers.
- Extend your SOA strategy to the Cloud. Review your current SOA strategy and extend this to accommodate cloud based as-a-service providers.
- Extend Governance around Cloud Services. Review your existing IT governance and SOA governance processes to accommodate the introduction and adoption of cloud based as-a-service providers.
- Identify Cloud based Integration models. It is not a one-size fits all. Therefore multiple integration models could apply to the cloud-based service provider depending upon the enterprise integration architecture. These integration models include a) point-to-point solutions, b) cloud to on-premise ESB and c) cloud based connectors that adopt a service centric approach to integrate cloud providers to enterprise applications and/or other cloud providers.
- Apply right models for right scenarios. Review the scenarios involved and apply the right models to the right scenarios.
- Sustain and evolve your services taxonomy. Provide enterprise-wide visibility to the taxonomy of services – both on-premise and those identified for integration with the cloud-based service providers. Continuously evolve these services to integrate to a rationalized set of providers who cater to the integration needs of the enterprise in the cloud.
The biggest challenge enterprises have in driving this systemic adoption of cloud-based services comes from within its business units. Multiple business units may unknowingly avail the same services from the same providers in different ways. Therefore, enterprises must ensure that such point-to-point integrations do not proliferate like they did during the era preceding integration brokers.
Enterprises should not let history repeat itself when integrating to the cloud by adopting service-oriented principles.
How about your enterprise? How are you going about doing this? What is your approach to integrating to cloud service providers?
A version of this post was originally published on HP's Enterprise Services Blog.
HP Distinguished Technologist and Cloud Advisor, E.G.Nadhan has over 25 years of experience in the IT industry across the complete spectrum of selling, delivering and managing enterprise level solutions for HP customers. He is the founding co-chair for The Open Group SOCCI project and is also the founding co-chair for the Open Group Cloud Computing Governance project. Twitter handle @NadhanAtHP.


text:
Product Model Information
The Model 7F_ _KG roller conveyor is constructed of 3-1/2" Galv Steel side channels, 1.9"x16ga Galv Stl tubing, 7/16" Hex Plain Stl roller shaft, and Butt Plate couplers.
Refer to the Roller Conveyor Selection Guide for help.
7F10KGPU03B22BP Construction
- Type: Straight
- Length (ft): 10
- Between Frame (in): 22
- Roller Centers (in): 3
- Roller Bearing: Commercial Light Oil
- Sleeve: Orange Polyurethane
- Roller Capacity (lbs): 270
- Frame Capacity (lbs/ft): 120 on 10' support centers, 600 on 5' centers
- Weight (lbs): 341.9
7F_ _KG Configurations
- Roller Centers (in): 3, 4.5, 6
- Straights (ft): 5, 10
- Curves (deg): 45, 90
- Sleeve: 1/8 Orange Polyurethane
When Can This Item Ship?
Lead times are subject to change depending on the size of your order. If we cannot meet the lead time that is listed on the website, we will contact you to discuss your order and your options.
All items in your order will ship together. The lead time for your order is determined by the items in your order with the longest lead time.
For more information about our lead times, please visit out FAQ page.


text:
We are a well-known Power Control Center Panels in Vasai. As a trusted in the market to Power Control Center Panels Manufacturers in Vasai a remarkable range of LT Panels and HT Panels. Our managing executives play a vital role in delivering Power Control Center Panels on time. We extend our journey for the development of our company.
We follow business norms from the beginning of our careers. Our patrons accept our manufactured Power Control Center Panels well due to their Excellency, and it is tested to ensure their flawlessness. We have a vast clientele, and we work under the supervision of our managing director Mr. Avni Desai. Our recipe is simple and stands on the best quality power factor panel, excellent design, personalized service, superior team strength, and strict adherence to quality norms.
Our company is a reputed Power Control Center Panels Suppliers in Vasai. Our trusted vendors supply raw materials, and thus, we can assure the purity and quality. We have a robust working area, and we can produce a considerable number of Power Control Center Panels at one time. Moreover, we have a highly energetic team of engineers and co-workers, and they always work hard to fulfill our clients' necessities. As a result, We has massive market demand inside and outside the country. We follow modern technologies and we have furnished look and finish that attract clients the most. Furthermore, we dream of finding our name at the top of this field soon and continuing our journey accordingly.
We are the original name of the supplier and exporter of Power Control Center Panels in Vasai. We are hard-working and provide exclusive service to our patrons. In addition, we accept online and offline orders. Clients can go through our website from any part of the world. They will come to know our company profile and place a large order with us. Clients can call us or email us to clear their doubts. Our skilled professionals are always available to answer their queries. Furthermore, clients may place a bulk order and will get delivery within a few days. We are happy to provide our unparallel service to you.


text:
Individual Learning Centre Alumni
Whitehorse, Yukon (YT)
Individual Learning Centre Alumni - Whitehorse, YT
Welcome Alumni!
Welcome! Register as an alumni from Individual Learning Centre and reunite with 1,000 classmates and old friends. Share your memories by posting photos or stories, or find out about your next class reunion!
Find Classmates in Your Graduating Class
Military Alumni
Honoring Our Heroes
This area is dedicated to our alumni that have served or are serving in our armed forces!
Lost Class Rings
Have you lost your Individual Learning Centre class ring? Have you found someone's class ring? Visit our lost class ring page to search for your class ring or post information about a found ring.
Individual Learning Centre Class Reunions
FREE CLASS REUNION WEBSITES! Post your Individual Learning Centre class reunion information here and receive a free reunion planning website with the reunion tools you need for the perfect class reunion. Alumni can RSVP and purchase tickets online for their class reunion in one central place. You can post your class reunion photos, event information, book a hotel and share your event on Facebook. Our Individual Learning Centre class reunion websites are offered free of charge to all our alumni so any alumni can plan their class reunion. Simply complete the reunion registration form and you will be on your way to the best Individual Learning Centre class reunion ever! Let's make 2023 the best class reunion season ever!
Alumni Stories
Read and submit stories about our classmates from Individual Learning Centre, post achievements and news about our alumni, and post photos of our classmates.
School News
Do you have any news to share? Keep our classmates informed on news and current events! Please post all reunion information in the reunion area.


text:
Lifestyle Changes to Manage Uterine (Endometrial) Cancer
Condition InDepth
Lifestyle changes can help:
- Strengthen your body so that you can withstand some of the rigors of treatment.
- Optimize the function of your immune system to aid in the fight against cancer.
- Improve your emotional outlook, so you can enjoy life to the fullest, even during treatment for uterine cancer.
- Avoid other medical problems that could complicate your health.
General Guidelines
Quit Smoking
Smoking introduces toxic chemicals into the body. Smoking can also increase the risk of complications from medical procedures and slow tissue healing.
When you quit smoking, the body immediately begins to repair itself. Quitting will help boost your immune system to help fight the cancer and improve recovery from treatment.
Manage Menopause and Sexual Side Effects
Removal of the ovaries will cause menopause. This can cause a variety of symptoms including hot flashes, vaginal dryness, depression, pain during intercourse, and a decreased sex drive.
These symptoms can be managed with:
- Lifestyle changes
- Hormone replacement therapy (HRT)—talk to your doctor about the risks and benefits of HRT
- Vaginal lubricants and moisturizers
- Alternative treatments
- Counseling
Reduce Your Risk of Infection
Cancer and its treatments suppress the body's immune system. This can increase the risk of infection, or increase the severity of common infections, like a cold or the flu. To decrease the risk of infection while going through cancer treatment:
- Wash hands thoroughly and often. Hand washing is the most effective method of decreasing the chance of catching colds and flu. Carry hand sanitizer for times when washing is not convenient.
- Try to avoid crowds, especially during cold and flu season.
- Avoid touching eyes, mouth, and nose after coming in contact with surfaces or objects.
- Clean and disinfect surfaces and objects often.
- Ask your doctor about immunizing against the flu and pneumonia.
Make Dietary Changes
A healthful diet can help your body and mood. Your diet can provide fuel to help your body function at its best, and nutrition to help tissue heal and recover. Mood and overall energy will also be better with proper nutritional support.
Cancer itself and some cancer treatments can reduce your appetite. It becomes important to make the most of the calories that are eaten. A registered dietitian can help manage challenges that may be found with cancer or cancer treatments, and develop an effective meal plan.
Exercise Regularly
If you have not been exercising regularly, check with your doctor to choose a safe exercise program. Exercise has many benefits that may help you withstand the physical and emotional stresses of cancer and cancer treatment including:
- Promoting overall fitness
- Boosting your energy level
- Improving your immune system
- Boosting your spirits and improving your emotional outlook
You may consider consulting a personal trainer to help you set exercise goals and to safely follow through on initiating an exercise program. While adding exercise, be sure to balance rest and activities to prevent becoming too tired.
Manage Fatigue
Fatigue is the most frequently experienced symptom of cancer and cancer treatments. To help avoid getting overtired, prioritize tasks and focus on the most important ones. It is important to allow others to help you with daily chores, shopping, and preparing meals. If needed, plan time throughout the day to rest.
If fatigue is affecting quality of life, talk to your doctor.
Seek Support
The diagnosis of cancer is a life-defining event that can be difficult to handle. Facing the uncertainty of a serious disease, feeling anxious about how you will feel during treatment, lifestyle changes, and worrying about the impact of both the diagnosis and treatment can be overwhelming. It is important to rely on family, friends, and other people in your life. People who allow themselves to seek help while they are recovering from cancer can often maintain better emotional balance. Other sources of support include:
- Religious community
- Support groups for people with your type of cancer
- Professional support from social workers, psychologists, and/or psychiatrists who are trained to help support cancer patients and their families
Family and caregivers may also need support. Encourage them to seek support groups or counseling geared toward them.
Comfort Measures
Uterine cancer found in advanced stages can be harder to treat. Some people choose treatments to ease cancer complications or choose to stop treatment completely. Depending on your circumstances, it may be realistic to begin end-of-life planning. Considerations may include:
- Choosing home or hospice care
- Financial decisions
- Advance directives—includes legal issues, like wills, hospital orders for your care, and power of attorney for medical care and finances
- Insurance coverage
If you need guidance, talk to a member of your healthcare team. You can be referred to a trained professional to guide you through the process.
- End of life care. American Cancer Society website. Available at: https://www.cancer.org/treatment/end-of-life-care.html. Accessed December 5, 2019.
- Endometrial cancer. EBSCO DynaMed website. Available at: http://www.dynamed.com/topics/dmp~AN~T113952/Endometrial-cancer. Accessed December 5, 2019.
- Living well during treatment. American Cancer Society website. Available at: https://www.cancer.org/treatment/survivorship-during-and-after-treatment/staying-active.html. Accessed December 5, 2019.
- Stay healthy. American Cancer Society website. Available at: https://www.cancer.org/healthy.html. Accessed December 5, 2019.
- Nicole S. Meregian, PA
(C) Copyright 2022 EBSCO Information Services
This content is reviewed regularly and is updated when new and relevant evidence is made available. This information is neither intended nor implied to be a substitute for professional medical advice. Always seek the advice of your physician or other qualified health provider prior to starting any new treatment or with questions regarding a medical condition.
To send comments or feedback to our Editorial Team regarding the content please email us at email@example.com.


text:
If you can't find what you're looking for, please contact our sales team
Phone:+386 31 428 189
Email: email@example.com: +36 1 2361-104
Email: email@example.com
Choral Works Has Arrived
We are excited to announce the availability of the fourth volume of the Béla Bartók Complete Critical Edition: Choral Works.
This volume contains every completed work Bartók composed for unaccompanied chorus or chorus with piano accompaniment, except for the exercises from his student years.
In the main part of the volume, the last authentic versions of the works published in the composer's lifetime are present as well as those that remained unpublished but were intended for the public. In addition to the original words of the compositions, the edition includes all the translations approved by Bartók.
For more information on this publication, please click here.
Piano Works 1914–1920 has been published!
Volume 3 of the BBCCE contains Bartók's works for piano solo composed between 1914 and 1920. These works span a broadly varied spectrum; in addition to simple arrangements of folk music (15 Hungarian Peasant Songs, Sonatina) and original pieces for the concert podium (Suite, op. 14), we find Bartók's audaciously innovative Etudes (op. 18) inspired by Liszt, as well as Improvisations (op. 20), perhaps his most abstract and original folk music adaptations.
Please click here for more information on this most recent volume.
Concerto for orchestra is available
First volume of the Béla Bartók Complete Critical Edition is available
In 2016 we started publishing the Complete Critical Edition of the works of one of the 20th century's greatest composers: Béla Bartók.
The influence of his pioneering oeuvre, including works such as 'Duke Bluebeard's Castle', 'Mikrosmos', the 'Concerto for Orchestra', and 'For Children', has actually increased during the 70 years since the composer's death in 1945.
The need for a scholarly edition that meets the highest requirements is beyond dispute. This major scholarly project, whose preparations have been a long time in the making, is to be jointly issued by G. Henle Publishers in Munich and Editio Musica Budapest. Both publishing houses have an excellent reputation for scholarly editions, together with the highest possible standards when it comes to international distribution.
You can download the subscription invitation here. Subscribers to the complete set of volumes in this Complete Edition will receive a 10 % discount on the standard purchase price. The volumes can also be purchased individually.
The first volume (For Children) is available for sale. The BBCCE is distributed worldwide by G. Henle, except of Hungary.
Bartók Complete Edition will be launched in 2016
The 70th anniversary of the death of Béla Bartók was marked in Budapest on 26 September 2015, with a full day of events at the Institute of Musicology, Research Centre for the Humanities, Hungarian Academy of Sciences. On the occasion the launch of the score series Béla Bartók Complete Critical Edition was announced which will be published jointly by Editio Musica Budapest and G. Henle Verlag of Munich.
A contract of cooperation between them had been signed the previous day.
After opening words by Pál Richter, director of the Institute of Musicology, addresses were given by László Lovász, president of the Hungarian Academy of Sciences, and Emilia Szedlacsek, head of department of the Ministry of Human Capacities. At the morning session, lectures were heard from Gábor Kecskeméti on literary complete editions and László Somfai on musical ones. Then followed a press launch by László Vikárius, head of the Bartók Archives and editor-in-chief of the complete edition, Malcolm Gillies and Tallián Tibor as members of its editorial board, and Antal Boronkay and Wolf-Dieter Seiffert, chief executives of the two publishing companies.
In the afternoon, a festive commemorative was held with wreaths laid on the grave of Béla Bartók. The afternoon session, held in English, featured Richard Taruskin (University of California at Berkeley), who spoke on critical editions of 20th-century composers, Vera Lampert (Brandeis University) on the position held by For Children among Bartók's folk song arrangements, László Vikárius on editing For Children, and Klára Móricz (Amherst College) on the editing and history of Concerto for Orchestra. The day's events concluded with performances of the First Sonata for Violin and Piano, Contrasts, and selections from 44 Duos for Two Violins.
An exceptional concert took place on Sunday morning in the Great Hall of the Liszt Academy of Music, at which young Hungarians and Slovaks played pieces from the For Children cycle. Also heard were some of the Hungarian and Slovak folk songs which Bartók had arranged in these piano pieces. A children's choir sang three of Bartók's Children's Choruses, and a string orchestra consisting of pupils from Budapest music schools played Leó Weiner's transcription of the For Children pieces. Finally, a children's choir and the orchestra performed five of Bartók's choral works with orchestral accompaniment [B-28].
Our publishing company is proud that for 65 years it has been looking after and distributing much of Bartók's work at home and abroad. Most of Bartók's music will be out of copyright in most European countries in 2016. This means that other publishers are likely to publish works by Bartók, and there is danger that some of the publications will be based on unreliable, obsolete scores. So it is all the more opportune to be making available at last a complete edition to a scholarly standard. Such publication of a musical life's work also gives performers access to much awaited, hitherto unpublished juvenilia, along with unknown versions and unpublished movements. A complete edition of a composer makes available the whole life's work edited on uniform principles. It provides a musical text that takes note of all sources and creditable editions, along with a historical introduction and detailed critical commentaries.
Preparations for the Bartók Complete Edition, which is planned to consist of 48 volumes, began under László Somfai and are continuing under László Vikárius at the Bartók Archives, which operates as part of the Institute of Musicology. The Archives – set up in 1961 to safeguard the Bartók legacy in Hungary – form the only specialized collection and research centre devoted exclusively to Bartók's life and works. Editio Musica Budapest will publish the series jointly with G. Henle Verlag of Munich, which has an outstanding reputation in the field of critical editions. This partnership provides ideal conditions for ensuring that the Complete Edition is published to the highest standard and distributed internationally. Due to the high production costs and weight of scholarly, editorial and engraving expertise required, we expect to produce two volumes a year. Our plans are to publish the early and revised versions of For Children in the spring of 2016 and the Concerto for Orchestra in the autumn.
The Complete Edition, with its scholarly handbook function, will be joined by cheaper so-called Urtext editions in a more easily handled sheet-music form of the works already published in the series. Thus it is our hope that the Bartók Complete Edition will become the central publication of the composer's life's work all over the world.
The publication of the Bartók Complete Edition and the holding of the two days of events have received funding from the National Cultural Fund of Hungary.


text:
- This event has passed.
May 4 - May 10
Hostesses and Event Staff for Interpack
We offer a wide range of event staff for Interpack: Hostesses, Promoters, Brand Ambassadors, Presenters, Lead Generators, Promo Models, and more. All our staff members are bilingual in English and the local language. We focus on staff proactivity and efficiency to make the most of your event. Our local teams based in Dusseldorf have great experience in events hosted at Düsseldorf Exhibition Centre and other venues in Germany.
If you are looking for event staff for Interpack or other Packaging exhibitions or fairs, Golden Goose Events is your Hostess Agency! Get in touch and we will send you a quote within 24 working hours.
[button color="extra-color-1″ hover_text_color_override="#fff" size="jumbo" url="http://www.staging6.golden-goose-events.com/contact/#quote" text="Get a quote!" color_override=""]
Tell Us What You Need
Boost your event or marketing campaign with our local staff. Let's get started!
[button color="extra-color-1″ hover_text_color_override="#fff" size="jumbo" url="http://www.golden-goose-events.com/contact/#quote" text="Contact us" color_override=""]


text:
Total: $0.00
1439 products
Quick 2-5 day shipping across the country!
Now offering worldwide delivery!
Guaranteed authentic EVERY TIME, we got your back!
Stay up to date on the latest product releases, special offers & news by signing up for our newsletter.
Make sure to follow us on Instagram to stay up to date on our NEW ARRIVALS!