text:
Read this before Launching Your Next Udemy Course: Kids Yoga Teacher Trainer Jaime Brodie Made Over $10,000 using this method.
Jaime Brodie has been teaching kids yoga for 5 years now. She started shooting episodes 2 years ago, using a green screen. In the episodes, she takes kids on fictional adventures with characters like Pablo the Penguin and incorporates yoga movements into the story.
So, how did this Kids Yoga Teacher earn over $10,000 from her course during her first month on Udemy? Let's find out!
Jaime, you have over 15,000 YouTube subscribers, and your most popular video, created just one year ago, has over 500,000 views. How did you get so many YouTube subscribers?
We just made videos. After that, we did some paid ads on Sesame Street and we've run 4-day live kids yoga teacher trainings. Now, teachers in 3,000 schools across the US play our videos for their indoor Physical Education classes.
How did you earn over $10,000 in your first month after launching your Udemy course? We did a Facebook post in January. Cosmic Kids Yoga had 2,000 Facebook Page Likes at the time.
We are thrilled to announce that our first online kids yoga teacher training course will be launching in March!
We're so excited that our teacher training will now be available for people to do in their own time, at their own pace – wherever they are in the world.
We are offering a half-price EARLYBIRD DISCOUNT. Register for yours by following the link below…
The link took people to a page where they were prompted to enter their email address so we could send them the early bird coupon code when the course launched. We had 200 people enter their email addresses. [Editor's note: This is the perfect way to have people declare an intent to purchase your course. When José Maria Gonzalez used this pre-launch announcement method, over 50% of the people, 150 people(!), who entered the email address purchased the course right away.]
When we made the announcement, we mentioned that we were offering a half-price early bird discount for everyone who registered. We had 200 people submit their email, indicating they were interested in the course. Once we launched the course in March, 35 people purchased immediately at the discounted rate we provided ($100 rather than $249). We announced the early bird discount to our email list, giving them 30 days to take advantage of it. By the end of March, we had 95 students enrolled.
That is amazing! So, now that your initial promotion is over, how will you continue driving new students into your course?
We optimized our YouTube channel to send anyone watching our videos directly to our Udemy course with an instructor coupon code. We're also producing our next DVD set to sell through our website (we currently sell 2-3 DVDs per day), and in the new DVD set we'll include an insert that directs people to enroll into our Udemy course at a discount.
We're also redesigning our website so that our Udemy course offering is more prominent, along with our email capture. We'll set up a few autoresponder emails to inform anyone who opts into our email list about our course and direct them there with an instructor coupon code.
So, how can you recreate this success for your next Udemy course launch?
- Identify where you have your network or following (e.g. current Udemy students, private email list, Facebook, LinkedIn, etc.).
- 30-45 days before launching your course, post or send an announcement (e.g. Facebook post, email blast, LinkedIn group post, etc.) letting your network and followers know about your upcoming course launch.
- Send them to a page with an email opt-in where you can capture their information and email them the early bird coupon code to purchase your course when it launches.
- Note: If you don't have an existing website or a large online following, then get creative! For instance, email your network of 25 people who you think would be interested in the course or spread the word and just ask them to "Reply" to your email with a "Yes, I'm interested in your course!"
Good luck!
Empower your team. Lead the industry.
Get a subscription to a library of online courses and digital learning tools for your organization with Udemy for Business.


text:
The Maryland Terrapins defended their home court on Thursday night with a convincing 81-65 thumping of Boston College at the Comcast Center.
Terrell Stoglin led the way with 24 points as Maryland bounced back from a 73-55 loss at Duke.
With the win, the Terps improved to 15-10 overall and 5-6 in the ACC. At 5-6, they are tied with Clemson for seventh-place in the league.
Seven teams from the ACC will not be making the Big Dance.
So that means Maryland is going to have to close out strong if they want to shock us all and make the NCAA Tournament.
With five games left in the regular season, coach Mark Turgeon's crew has only two home games left, February 21st against Miami and then the season finale on March 4th against 22-ranked Virginia. It's a no-brainer to say that those are must-win affairs.
But Maryland's quest for, at least, an NIT bid begins Saturday in Charlottesville against the Cavaliers.
If the Terps could manage to pull off that upset, they would then have winnable games against Miami and on the road against hapless Georgia Tech.
A trip to Chapel Hill to face North Carolina would be next. Even though winning that contest is not impossible, it is improbable.
Maryland would wrap up the season with the rematch with Virginia.
If they finish 4-1, their regular season record be 19-11 and 9-7 in the ACC. That still might not be good enough to secure an at-large bid to the NCAA's. A win or two in the ACC Tournament may be still needed.
Now, do I think Maryland will go 4-1 down the stretch? Nope. They are too inconsistent and too inexperienced.
A trip to the NCAA tournament still appears to be a long-shot. An NIT bid, however, looks to be a realistic goal.
And a postseason trip of any kind would be a great accomplishment for Turgeon and his team.
The next couple of weeks should be interesting for the Maryland Terrapins and their fans.

subset: commoncrawl


text:
0 Members and 1 Guest are viewing this topic.
Who made £7m off the barkley deal
Nice little thread on him here. https://twitter.com/nffc/status/951159219402702848I particularly like this one https://twitter.com/gukci/status/951159712669753344
Here's some info on Paul Martin. I'm not sure if this has been posted, but if not, this is pretty interesting though a bit concerning, as I think most rate Kieran Dowell.https://twitter.com/EFC_Statto/status/951214729556561921
Didn't Alex Ferguson hate him? Refused to deal with him on a few occasions if I recall.
Its a shame hes so bloody slow. Id be more confident of him succeeding if he had pace.
I know what you mean but pace isn't everything.Ozil and Sigurdsson are both players he should be looking at.
Dowell will rise and become a very good player for Everton FC if he's given the chance on first team next year.
Page created in 0.052 seconds with 26 queries.


text:
A 20-year-old Hackensack man was charged in one of a series of overnight shootings in Paterson.
Police were investigating another shooting when they heard gunfire and found a 23-year-old male Paterson man who'd been struck in the area of Summer Street and Godwin Avenue.
The victim was taken to St. Joseph's Regional Medical Center in Paterson with injuries that authorities said weren't considered life-threatening.
The victim was one of six people wounded by gunfire in three shootings before dawn Saturday. Authorities didn't immediately say whether they consider any of the incidents related.
WILD WEST: Six Struck In Series Of Pre-Dawn Paterson Shootings
Nazir Carter, meanwhile, was charged with attempted murder and weapons offenses, Passaic County Prosecutor Camelia M. Valdes and Paterson Police Chief Troy Oswald said in a joint announcement.
Carter remained held Sunday in the Passaic County Jail pending a first appearance in Central Judicial Processing Court in Paterson.
Click here to sign up for Daily Voice's free daily emails and news alerts.


text:
I would like to receive hexadecimal data sent from a Pyrometer.
I've written a very simple VI, and I used the scan from sting vi, and set it to scan a Hexadecimal integer. I 've tried too many options, commands types and so on, but I am receiving all the time the error :
Possible reason(s):
LabVIEW: An input parameter is invalid. For example if the input is a path, the path might contain a character not allowed by the OS such as ? or @.
Command requires GPIB Controller to be Controller-In-Charge.
I cannot till now find what could be the problem, since even when using the probe to check the data at every line nothing seems to be working even to set up the serial parameters or send the command...
Any hints will be very appreciated.
Thank you in advance
Just a few questions
1) Are you sure the device is connected to com1?
2) Did you try other com ports?
3) You request 1024 bytes. Are you sure they are delivered, otherwise ask to start 16 bytes.
4) Is some handshake possible or even better an endcharacter defined like CR or LF?
What is the exact string you are getting back from your instrument? What is the error code and where is it coming from?
What exactly do you mean by "Hexadecimal" data. Is it an ASCII string with hexadecimal characters? Or is it raw/binary data (you can't read it in a simple text editor)?
Hi Albert. Geven,
thank you for your reply
Just a few questions
1) it is not all the time com1 since I 've tried different ones.
3) I've requested before that 32, was the same problem.
4) yes I used a carriage return in the command: I set it to 00mw2\r ==> then changed it to 00mw2<CR> thinking it will be working this way.
Hello crossrulz,
thank you for your reply.
Till now didn't receive anything from the instrument.
However today I received a reply from the support of the Pyrometer manufacture saying:
following the byte values (decimal) which would have to be in the output buffer one after the other for the command to be accepted:(48 48 then corresponds to address 00)
48 48 109 119 50 13 (this corresponds to the command text 00mw2<CR>.
After submitting the request, wait at least 1 ms for the answer (we usually use a longer timeout; I would suggest 50ms for the application as a test).
The answer (consisting of 4 hexadecimal characters and <CR>) is then something like 0BB7<CR> which corresponds to 299.9°. As byte value: 48 66 66 55 13
@Tanieta wrote:
The answer (consisting of 4 hexadecimal characters and <CR>) is then something like 0BB7<CR> which corresponds to 299.9°. As byte value: 48 66 66 55 13
Ok, that is what I call "ASCII Hex", which is a hexadecimal value represented with ASCII characters. So at least we know what the data is. Your VI should be handling this correctly.
@Tanieta wrote:
Till now didn't receive anything from the instrument.
With error you stated earlier, I am left to believe you have an incorrectly configured VISA session, most likely not using an available port.
11-06-2019 02:25 AM - edited 11-06-2019 02:25 AM
I am not sure about the unavailability of the port.
To check this problem I 've already downloaded the software provided by the manufacturer, and it was possible to receive the signal and measure the temperature.
Also in this software interface, I had to select the com port and then make a connection with the pyrometer. After that, I closed the software and set the same serial parameter in Labview and it is not working... 😕


text:
Get your brand positioning strategy right and you'll get your brand off to a great start. The right positioning always feels genuine and real with a decisive character (fun and friendly, elite and rare, powerful and durable, clean and safe). Strategic brand positioning weaves together character, style and personality into what makes a company, product, service or organization truly memorable.
Brand strategy consulting firms have a keen sense for creating unique identities. Modern SBC will help your brand stake its claim in your market.
The Raw Material of Strategic Branding
Think about who you are, what you believe and where you want to be. What matters to you? What perceptions do you want associated with your business, its products and services? These questions help brands build authentic positions in the market. Answer those questions and then use some of the same words when describing your brand position. Some will feel comfortable and true. Some will feel phony. If anything feels generic or manufactured, throw it out.
Describe the "positions" of competitors (ones you admire and one's you might dislike). Think hard about what makes you different, special or unique. We said, think hard. It isn't easy. All of this information makes up the raw material for establishing a brand position you can build on.
Brand Position. You Can't Fake It for Long.
Positioning a cookie brand is a lot different from positioning an entire business. First the cookie brand doesn't require the CEO and 20 employees to interact with the cookie-buyer. The product itself plus the packaging and advertising form the positioning. For the company or organization, positioning is a bit more complex. You have perceptions that go well beyond a box or wrapper and some advertisements. You have real people representing your organization. You might have offices that customers or clients visit. Simply put, there are more moving parts that impact a successful brand positioning strategy.
Testing Your Positioning
If you've never spent a night in a sleeping bag, you probably won't be very good at positioning a sleeping bag company. If deodorant is optional, you aren't going to be the next cosmetics and beauty powerhouse. Could a competitor use your positioning? Could it make the same claims as you? Look out for exaggeration. Great brand positions are easy to define. If you can't state yours right now, you don't have one.
Own Your Brand Position
Some companies just know how to be true to themselves. And they are rare. Wal-mart really nailed its positioning with its tagline "Save money. Live better." Four words and you have it. Nike's "Just do it." is equally brilliant. Smart brand positions are ones you can really own and expand within. New products and services should feel at home under the same brand positioning.
Position Your Brand for Success
If we asked you to tell us a compelling story about your business, products, or services, could you? For many entrepreneurs and even massive organizations, this can be a real struggle. The resulting stories are often commonplace and forgettable lists of achievements and milestones. In short, plain vanilla. And that's crazy, because every product, person, and place wants to be recognized for what makes it special and valuable. So, express yourself. Embrace your pride (you can get forgiveness later). Celebrate who you are, what you do and why you do it. Be as colorful or outspoken as you like. If it's real, you'll know it — and so will your customers, members, and employees.
Start with these Five Questions
- How do you desire your brand to be positioned?
- How do customers and prospects think of your brand now?
- Is our desired positioning unique? How many competitors do we have?
- Can we afford to "out-brand" a market leader?
- Is there room to expand within the desired brand position?
Brand Strategy Tips
- Avoid the "Me too" strategy
- Simple and Clear Wins. What exactly are you selling?
- Marketing is a battle of perceptions
- Don't try to beat a market leader for the same position
- Trends are like the tide. Flow with them. Don't fight them.
- Care about your brand – a lot
STRATEGIC BRANDING – A Beautiful Brand needs a Smart Brand Strategy
We've sat in on dozens of "Brand Strategy Presentations" from Fortune 500 mega brands to local boutique brands. And 7 out of 10 are a lot of inflated mumbo jumbo bolted onto an index card that has these six words: Difference, Simplicity, Consistency, Character, Beauty and Durability. These words summarize what makes a winning brand positioning strategy. And they are the tenets by which the best brand designers work.
At Modern SBC, our Brand Strategists are highly-skilled Graphic Designers and Copywriters first. Here's how we see Brand Strategists: If you need an operation, do you want someone who can talk about surgery, or do you want an actual a surgeon? Our brand positioning services give you the "surgeons" of brand strategists.
Work with us and get ready to see your brand from some fresh perspectives. We'll identify brand problems, suggest remedies and build a brand plan that is simple, easy to manage and positioned for the long term.
Brands can do a lot: build awareness, unite a workforce, improve sales, earn public respect and admiration, promote loyalty and endorsement and more. Those are pretty significant objectives — objectives your brand can enjoy if connected to the right strategy.
What is the state of your brand right now? We've given you a lot to think about. When you're ready, contact Modern SBC about our brand positioning services. We'll help you put the answers to the questions we've posed to work.


text:
Category: Littlest Angels
Author & Illustrator: San Hoy
Paperback ISBN: 9781616337056 1616337052
eBook ISBN: 9781616337063 1616337060
When six year old Joshua's mother leaves again for military duty she gives him a parting gift. Because his anxiety has been causing a bed wetting problem, the gift is a pair of pajamas covered with his favorite animal, frogs. Thus leading him to an adventure with a super frog.
Purchase PDF eBook DOWNLOAD $5.00
Purchase Paperback Book $9.95+$5.95 S&H


text:
Guides lead small groups of snorkelers into the waters of Crystal River to examine manatees in their natural habitat
What You'll Get
Oceans are the earth's final frontier, holding thousands of uncategorized species of fish and one plastic bag filled with loose doll hairs. Uncover the mysteries of the deep with this voucher.
Choose Between Two Options
- $26 for a guided manatee-snorkeling tour for one (a $55 value)
- $50 for a guided manatee-snorkeling tour for two (a $110 value)
During three-hour guided manatee tours, passengers receive all necessary gear and board one of four available boats. Once captains navigate boats to the day's destination, knowledgeable guides lead the way into the waters of Crystal River, where guests outfitted in their underwater gear keep their eyes peeled for manatees living out their daily routines.
The Fine Print
About Adventure Diving
Since 1973, Adventure Diving has transformed land walkers into underwater explorers with dives and scuba lessons. Its location in the Crystal River puts adventurers on the doorstep of the "Manatee Capital of the World," and regular snorkeling trips lead guests into the crystal-clear waters for a chance to glimpse the adorable creatures. Adventure Diving's scuba-certification courses combine online learning and practical lessons to enable solo excursions. A full slate of above-water activities keep feet dry and collectable water wings in their original packaging, allowing visitors to soak in sunset cruises, airboat rides, horseback adventures, and helicopter tours.


text:
Back by: hansukj on August 21, 2018 09:12 AM
Jang Chang-wook, who is in charge of military service, has been in charge of the 'Shinheung Independent School' from Kanghee to singer Kim Sung-gyu, Onew (Lee Jin Ki) and JoKwon. A demonstration of the 'Shinhung Independent School' was held on the 5th at the BBCH Hall in..... by HyonJoo.Kim
Organized by the Army Headquarters and organized by the Army Creative Musical 'Shinheung Jindo School' produced by Shonot Co., Ltd., concluded the national tour performance last year, and the 100th anniversary of the establishment of the Provisional Government of the Republic ..... by asian
Jo Kwonbid his fans goodbye for now.He'll be enlisting later today on August 6th, and he posted photos of him getting his hair shaved and hanging out withJinwoon. He's chosen not to reveal his enlistment location or time because he wanted to enlist quietly... by heej0130
On August 4, just days before his upcoming mandatory military enlistment,2AM'sJo Kwonhung out with his fellow memberJinwoon, as well as a group of their friends!.. by hansukj
Jo Kwonused his Twitter account to fire back at a rude journalist who recently wrote an article about him with a mocking headline... by ifrit1112
Jo Kwon has been named as a potential candidate for the currently controversial idol 'B', accused of preferential treatmentfromKyunghee University'sGraduate School.Netizens noticed that the photo used bySBSduring their report is the same as Jo Kwon's image for his so..... by hwarang
A representative fromJo Kwon's side spoke with media outletOSENfollowingclaims that Jo Kwon may be the idol 'B', accused of receiving preferential treatment atKyung Hee University's graduate school... by ifrit1112
Jo Kwonspoke out about theKyung Hee University Grad School controversy.On February 7, it wasrevealed by the mediathat Jo Kwon is the popular idol member 'B' accused ofreceiving preferential treatmentat the Institute.The singer shared his side of the story with lengthy pos..... by hwarang
Jo Kwon has released another batch of teaser images for his upcoming solo comeback... by desire
MBC's 'Show! Music Core' is back for its weekly show featuring performances by your favorite artists!On this episode,MXMcame back with "Diamond Girl",Oh My Girlrevealed their "Secret Garden",Block Bsaid "Don't Leave",INFINITEmade a comeb..... by ifrit1112
We welcome your comments, but please be civil, DO NOT SPAM ON TOPIC. Comments deemed inappropriate will be removed and repeat will banned. Commention is a provilege that will be revoked for violations od our Comment Policy .
Comments from our old comments platform are still in the process of moving over. If you notice any comments missing they will likely re-appear soon. Thnk you for your patience.


text:
Auto-recoverable auto-certifiable cryptosystems with unescrowed signature-only keys
A method is provided for digital signature infrastructure that provides public keys which are effective only for verifying digital signatures, and are not effective for encrypting information in a way that is unrecoverable by law-enforcement entities. The method can be implemented in software, thus avoiding the need for tamper-proof hardware. The method has the property that signing private keys are not escrowed, since the corresponding public keys cannot be used effectively for criminal communications. As a result no one can impersonate the user; alternatively users can prove impersonations. Furthermore, the system is shadow public key resistant. A shadow public key is a public key which is not escrowed and which can be used for untappable communications. Therefore, the method presented here cannot be used to publish public keys which are not escrowed. All information displayed by the certificate authorities, and even the digital signatures of users, are shadow public key resistant. The present invention is usefull for any application that requires that messages be verifiably authentic, and is particularly applicable to being used in a national public key infrastructure (PKI), since it is very scalable. It can be combined with Auto Recoverable auto certifiable systems to give a complete solution to encryption (confidentiality) and signature (authentication) in the context of escrow key systems.
The field of this invention is cryptography. This invention relates to digital signature schemes, and in particular to schemes that are compatible with any escrowed encryption system. The scheme introduces a public key/private key system in which the public key is auto-certifiable and is effective only as a digital signature verification key, and is not effective at performing unescrowed encryptions of data. Furthermore, the private signing key in the system is not escrowed. If the public key is ever used to encrypt data then that data is auto-recoverable by trusted authorities. The invention relates to cryptosystems implemented in software, but is also applicable to cryptosystems implemented in hardware. In particular the invention can be employed as the signature and authentication component in conjunction with escrowed encryption schemes.BACKGROUND—Description of Prior Art
Public Key Cryptosystems (PKC's) allow secure communications between two parties who have never met before. The notion of a PKC was put forth in (W. Diffie, M. Hellman, "New directions in cryptography", IEEE Transactions on Information Theory, 22, pages 644-654, 1976). This communication can take place over an insecure channel. In a PKC, each user possesses a public key E and a private key D. E is made publicly available by a key distribution center, also called certification authority (CA), after the registration authority verifies the authenticity of the user (its identification, etc.). The registration authority is part of the certification authority. D is kept private by the user. E is used to encrypt messages, and only D can be used to decrypt messages. It is computationally impossible to derive D from E. To use a PKC, party A obtains party B's public key E from the key distribution center. Party A encrypts a message with E and sends the result to party B. B recovers the message by decrypting with D. The key distribution center is trusted by both parties to give correct public keys upon request. In the same paper by Diffie and Hellman the notion of a digital signature scheme was also proposed. A digital signature scheme allows a user to digitally "sign" a message using the private key known only to the user, to prove that the message comes from the user. To sign a message M, the user computes a signature using the private key D. The signature can then be verified using the public key E. A PKC and digital signature scheme based on the difficulty of computing discrete logarithms was published in (T. ElGamal, "A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms", CRYPTO '84, pages 10-18, Springer-Verlag, 1985).
Since the present invention discloses a method for generating, publishing, and employing public key systems based upond a digital signature algorithm which is based on the problem of computing discrete logarithms, we will cite relevant prior art dealing with discrete log based signature schemes. The first space efficient digital signature scheme based on discrete logarithms is the Digital Signature Algorithm (U.S. Pat. No. 5,231,668). DSA gets its security from the difficulty of computing discrete logs modulo the prime p, where p is at least 512 bits in size. It also gets its security from the difficulty of computing discrete logs in a cyclic subgroup of order q, where q is a 160 bit prime divisor of p−1. DSA is novel in that the signatures that it outputs are 320 bits in length. Nyberg and Rueppel disclosed a set of ElGamal based variants that provide for message recovery (K. Nyberg, R. Rueppel, "Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem, Eurocrypt '94, pages 182-193, 1994). The message recovery feature allows the message to be recovered from the signature itself, hence the message need not be sent along with the signature. Another important feature of digital signature schemes is blindability (D. Chaum, "Blind Signatures for Untraceable Payments", CRYPTO '82, pages 199-203). A scheme is blindable if it is possible for Alice to obtain a Bob's signature on a message of her choice such that Bob remains oblivious as to what he is signing and what the resulting signature is. In (D. Chaum, T. Pedersen, "Wallet Databases with Observers", CRYPTO '92, pages 89-105) a blindable scheme based on ElGamal is disclosed. A good overview of digital signature security is described in (S. Goldwasser, S. Micali, R. Rivest, "A digital Signature Scheme Secure Against Adaptive Chosen Message Attacks", SIAM J. Comput., vol. 17, n. 2, pages 281-308, 1988).
In the U.S. Patent Document entitled "Auto-Escrowable and Auto-Certifiable Cryptosystems" (by Young and Yung), a public key cryptosystem was disclosed that has the following properties. Users of the system can generate a public/private key pair and a certificate of recoverability. This certificate of recoverability can be used to both recover the private key by the escrow authorities, and verify that the private key is recoverable. The present invention draws many of its ideas from the Auto-Escrowable and Auto-Certifiable key escrow solution but concentrates on signature keys that have the feature that encryptions using the public verification key are auto-recoverable. Other methods for conducting key escrow are U.S. Pat. Nos. 5,276,737, and 5,315,658 which are due to Micali (1994). In these patents Micali discloses a Fair Public Key Cryptosystem (FPKC) which is based on the work of P. Feldman (28th annual FOCS). The FPKC solution is not as efficient in terms of use as Auto-Escrowable and Auto-Certifiable Cryptosystems. Furthermore, it has been shown that the Fair RSA PKC does not meet certain needs of law enforcement (J. Kilian, F. Leighton, "Fair Cryptosystems Revisited", CRYPTO '95, pages 208-221, Springer-Verlag, 1995, see also U.S. Pat. No. 5,647,000 to Leighton), since a shadow public key cryptosystem can be embedded within it. A shadow public key system is a system that can be embedded in a key escrow system that permits conspiring users to conduct untappable communications. Kilian and Leighton disclose a Fail-safe Key Escrow system. This system has the drawback that it requires users to engage in a multi-round protocol in order to generate public/private key pairs. Other key escrow systems with similar inneficiencies are by De Santis et al., Walker and Winston (TIS), and the IBM SecureWay document. A "Fraud-Detectable Alternative to Key-Escrow Proposals" based on ElGamal has been described in (E. Verheul, H. van Tilborg, "Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals", Eurocrypt '97, pages 119-133, Springer-Verlag, 1997). This system provides for session level key recoverability, and makes no provision for preventing users from encrypting messages prior to using the Binding ElGamal system. Hence, it permits conspiring criminals to conduct untappable communications. Both Binding ElGamal and the Auto-Escrowable and Auto-Certifiable Cryptosystems solutions employ the use of non-interactive zero-knowledge proofs. More specificly, they employ the Fiat Shamir heuristic which is disclosed in (A. Fiat, A. Shamir, "How to Prove Yourself: Practical Solutions to Identification and Signature Problems", CRYPTO '86, pages 186-194, Springer-Verlag, 1987). An overview of key escrow schemes appears in (D. Denning, D. Branstad, "A Taxonomy for Key Escrow Encryption Systems," Communications of the ACM, v. 39, n. 3, 1996). In (N. Jefferies, C. Mitchell, M. Walker, "A Proposed Architecture for Trusted Third Party Services", Cryptography: Policy and Algorithms, LNCS 1029, Springer, 1996) and (R. Anderson, "The GCHQ Protocol and Its Problems", Eurocrypt '97, pages 134-148, Springer-Verlag, 1997) a trusted third party approach to escrow is described where the trusted third parties of the participating users are involved in every session key establishment stage, and hence provides for another encumbersome solution as well. Such solutions are described in the TIS patent (U.S. Pat. Nos. 5,557,346, 5,557,765, and 5,640,454 to Lipner et al.) and the IBM patents (U.S. Pat. Nos. 5,796,830 and 5,815,573 to Johnson et al.). Adding time limits to keys is given in (U.S. Pat. No. 5,633,928 to Lenstra et al.).
The primary problem with implementing a digital signature scheme suitable for a national usage is that very often the public verifying key can be used as a public encryption key, and the corresponding private signing key can be used as a private decryption key. For law enforcment purposes it is therefore necessary to escrow the signing private keys. But this implies that law enforcement has the capability of forging signatures of users, and also impersonating users in interactive identification protocols. There is no legitimate reason that law enforcement should have this capability. Hence, what is needed is a public and private key system that is usable for digital signatures but not for public key encryptions. This problem was stated informally in a request for comments that was published in the Federal Register ("Announcing Plans to Revise Federal Information Processing Standard 186, Digital Signature Standard", vol. 62, n. 92, Federal Register, pages 26293-26294, May 13, 1997).
We will now give reasons why existing digital signatures schemes fail due to shadow public key vulnerabilities. Consider the ElGamal digital signature algorithm (T. ElGamal, "A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms", CRYPTO '84, pages 10-18, Springer-Verlag, 1985). In ElGamal, the public key is y=gx mod p, where x is the private signing key. Here g is a public generator modulo the public prime p. Suppose that y is an escrowed public key. This insures that it can't be used for unescrowed encryptions. But, now the escrow authorities can forge signatures. Suppose that y isn't escrowed. Then signatures can't be forged by the escrow authorities, but y now consititues a shadow public key. Note that the same situation occurs with DSA, the Schnorr digital signature algorithm, and the ElGamal variants of Nyberg and Rueppel (K. Nyberg, R. Rueppel, "Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem", Eurocrypt '94, pages 182-193, Springer-Verlag, 1994).
Now consider the RSA digital signature algorithm (U.S. Pat. No. 4,405,829 to Rivest et al.). Recall that in RSA n is the product of two large primes p and q. e is a public value such that gcd(e,(p−1)(q−1))=1. e and n are the user's public verification keys, and the inverse of e mod (p−1)(q−1) is the user's private signing key. It is simple enough to revise RSA key generation to preclude shadow public key abuse. It remains to consider the aspects of the digital signature algorithm. Suppose that n is escrowed. It follows that the escrow authorities can forge signatures. Suppose that n is not escrowed. It is clear then that the escrow authorities can't forge, but n is a shadow public key. Thus RSA is subject to the same dichotomy as the discrete log based systems. This abuse applies also to the other algorithms based on the difficulty of factoring. For example, consider Esign (U.S. Pat. No. 4,625,076 to Okamoto et al.). In Esign, n=p2q. It is possible to do RSA like encryptions and decryptions using such a modulus.
In Fiat-Shamir (U.S. Pat. No. 4,748,668 to Shamir et al.), n is the product of two primes and none of the users know the factorization of n. To generate a public key, a user generates k different quadratic residues v1, v2, . . . , vk modulo n. This vector is the public key. The scheme therefore succumbs to the following shadow public key attack. The user's agree on a value (or a set of values) g to be the base for the group Zn* (hopefully it generates a large subgroup). To generate v1 for a public key, a malicious user chooses w at random and sets v1=g2w mod n. Thus, v1 is a quadratic residue, and a shadow public key for ElGamal mod n. The shadow private key is 2w.
To the best of our knowledge all digital signature algorithms aside from Okamoto '92 (T. Okamoto, "Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes", CRYPTO '92, pages 31-53, Springer-Verlag, 1993) fail immediately when viewed in light of the needs for a satisfactory digital signature infrastructure. Recall that in Okamoto, the public verification key is v=g1{circumflex over ( )}(−s2)*g2{circumflex over ( )}(−s2) mod p. The symbol {circumflex over ( )} denotes exponentiation, hence a{circumflex over ( )}b is a raised to the b power. Here g1 and g2 have order q modulo the public prime p. The values for g1, g2, and q are also public. The private key is (s1,s2). Both s1 and s2 are chosen randomly modulo q. Okamoto is based on the representation problem modulo p.
To sign a message m in Okamoto, we choose two values r1 and r2 randomly mod q. We then compute e=H(g1{circumflex over ( )}(r1)*g2{circumflex over ( )}(r2) mod p,m). Here H is a one-way hash function. We then compute y1=r1+es1 mod q and y2=r2+es2 mod q. The signature is the triple (e,y1,y2). To verify the signature we check that e=H(g1{circumflex over ( )}(y1)*g2{circumflex over ( )}(y2)*ve mod p,m).
At first sight it seems like Okamoto is a good candidate for the setting of a national PKI for signatures, which is to be used alongside an escrowed PKI. For, suppose we don't escrow v. Then the escrow authorities can't forge signatures. But, then we need to insure that v cannot be used as a shadow public key. In fact, we need to show that any key based on the representation problem with g1 and g2 can't be used as an encryption public key. To see this, note that the quantity g1{circumflex over ( )}(y1)*g2{circumflex over ( )}(y2)*ve mod p is in fact just g1{circumflex over ( )}(r1)*g2{circumflex over ( )}(r2) mod p. Hence, a modular exponentiation with two bases is displayed during signature verification. Now suppose that there is a public key encryption algorithm for public keys with representations using two bases. Since Okamoto is extendible to three or more bases, maybe there is no encryption algorithm if the representation uses three bases, or four bases, etc.
In fact, there is a public key algorithm that uses public keys based on the representation problem with any number of bases. To public key encrypt a message m using v as in Okamoto, we do the following.
1. choose k randomly from Zq
2. a=g1k mod p
3. b=vk mod p
4. c=g2k*m mod p
5. the ciphertext of m is (a,b,c)
To decrypt we compute:
1. a′=a{circumflex over ( )}(−s1) mod p which equals g1{circumflex over ( )}(−s1*k) mod p
2. b′=b/a′ mod p which equals g2{circumflex over ( )}(−s2*k) mod p
3. m=c/(b′{circumflex over ( )}(−1/s2)) mod p
Note that unlike in ElGamal encryptions, the ciphertext is a triple. This algorithm can be easily extended to handle representations using more bases. The ciphertext is an (m+1)-tuple if m bases are used in the representation of v. Thus, Okamoto and it's exentions using more bases fails to meet the requirements of the system that is needed.
In the pending U.S. patent application entitled "Auto-Recoverable and Auto-Certifiable Cryptosystem with Unescrowed Signing Keys" (A. Young, M. Yung, Ser. No. 08/878,189), a solution was presented that attempted to solve this problem. However, the primary embodiment of that solution, and it's variants, have a drawback that was not addressed. Recall that the solution proposed a three key system which involved a signing private key, a decryption private key, and a public key suitable for public key encryptions and signature verifications. The private signing key and the public verification key are used in a digital signature algorithm that is very similar to the ElGamal digital signature scheme, and its variants. The problem with the system is that in the primary embodiment and it's variants, a signature involves publishing a value which can be used as a shadow public key. For example, in the primary embodiment, the value a=H(m)(g1/Y)−t mod 2q is computed as the first part of the signature on m. Yet this quantity can be used as a shadow public key in an ElGamal-like public key cryptosystem where t is the unescrowed decryption key. To see this, note that all users have access to H(m), so they can compute the public key w=a/H(m) mod 2q. The value (g1/Y)−1 can be used as the base g″ (or generator, if you will) of Z2q. The key pair is thus ((w, g″, 2q),t), which is an ElGamal public/private key pair in the group Z2q . All each malicious collaborator needs to do is publish a single signature to a bulletin board, and retain the unescrowed decryption key. This is a major drawback, since the bulletin board then serves as a shadow public key database, and having it taken down by law-enforcement can be argued to be a violation of the first ammendment in court by the collaborators, in the event that law-enforcment tries to take the bulleten board down. The present invention solves this problem by introducing a digital signature algorithm where no shadow public keys are displayed through the digital signatures that are computed. Indeed, what is needed is a new signature scheme that is secure and does not provide public keys which can be used for unescrowed public key encryption, especially in the context of an escrowed PKI.
Key Recovery Infrastructure with Unescrowed Signatures
The present invention discloses a digital signature mechanism that, unlike all known schemes mentioned above, cannot be used for untappable wire communications. Thus it provides simultaneously for an unescrowed signature scheme and an escrowed encryption scheme. The Auto-Escrowable and Auto-Certifiable solution provides an efficient way to implement a public key infrastructure, thereby allowing privacy for users. The present invention builds on that solution and provides the added functionality of authentication capabilities needed in key escrow environments. Thus users of the present invention can verify the authenticity and origin of message senders.SUMMARY OF THE INVENTION
In order to provide for the above objective the present invention introduces a new idea in cryptography. The present invention introduces a public key which can be used to verify digital signatures but cannot be used to encrypt data in a way that prevents escrow authorities from decrypting the data. The public key has the usual property that it is intractable to derive the corresponding private key from the public key. The present invention also has the property that the escrow authorities and CA's are unable to forge the signatures of users of the system.
The present invention consists of a key certification process, a signing process, a signature verification process, and a key (or information) recovery process. The key certification process can be broken down into two functions which are key generation, and key verification. In the key generation process, a public key, the corresponding private signing key, and information proving that the keys were generated properly is output. In the key certification process, the user transmits this information to the certification authorities (CA) (or registration authority, which is often part of the CA). The certification authority takes this information, processes it, and decides to either publish the public key or not. If the verification information indicates that the keys were generated properly using the key generation algorithm, the certification authority publishes the users public key. Otherwise, the users request for certification is rejected, and the CA may take subsequent action which may include informing the user of this. In the prefered embodiment, public keys that are properly verified by the CA are digitaly signed by the CA and a digital certificate from this information is formed. A public key together with a CA's signature on a string that contains the public key constitutes a certified public key. It is the public key and/or the digital certificate that is made available to other users by the CA. User's sign messages and verify messages in the same manner as in typically digital signature schemes. In the recovery process, information that is encrypted using the public signature verification key of a user is decrypted using information that was sent to the CA during key certification. This may be done without any special authorization, since the public key is only supposed to be used for digital signature verification (another infrastructure should be devoted to ensuring confidentiality, if confidentiality is needed). The method by which the CA certifies and publicizes keys may differ according to the numerous methods available in the art. There are many ways for the CA to act, the ways we adopt in the current description is merely illustrative and there are other variations that are known to the skilled in the art whose implementations does not differ from the current invention.
The present invention is useful in any environment that requires messages to be verifiably authentic. Such environments arise in law enforcement nationally and internationally, in the business sector, in secure file systems, etc. The present invention may involve recovery agents. The present invention is also directly extendable to authentication that is conducted via the use of interactive identification protocols by methods known to those skilled in the art.
The present invention is robust with respect to any underlying technology since it can be implemented in both hardware and software. When implemented in software it can be easily scrutinized to insure that it functions as desired and to insure that it does not compromise the security of its users. The software implementation allows for fast and easy dissemination of the invention, since it can be disseminated in source code form over diskettes or over a computer communication network. The invention does not require changes in communication protocols used in typical unescrowed PKI's (e.g., session key establishment, key distribution, secure message transmission, etc.). The invention is therefore compatible with typical PKI's. The present invention thus provides a very efficient way of allowing for digital signatures.THE DRAWING
The present invention will be described with reference to the accompanying FIGS. 1-7.
FIG. 1 is a flow chart of the basic steps of the process of generating a public key, the private signing key, and the information that shows that the keys were generated properly.
FIG. 2 is a data flow diagram of the process of certifying a key using the invention.
FIG. 3 is a data flow diagram of the process of recovering information enciphered using the public verification key.
FIG. 4 describes a generic digital signature system and its main components and operations
FIG. 5 describes the present invention.
FIG. 6 describes the digital signing process
FIG. 7 describes the digital signature verification processDESCRIPTION OF THE INVENTION
The invention describes a mechanism that can be performed in conjunction or parallel with the generation of public keys for encryptions which may be escrowed or recoverable. For example the auto-recoverable auto-certifiable systems of Young and Yung (pending U.S. Ser. No. 08/864,839). This art is incorporated here by reference. The rest of the description will describe the signature part of the system which is used to authenticate users and users in association with messages they send. It is obvious to those skilled in the art that a signature function and its public verification functions can have many uses and applications, we do not further specify these potential uses of the signature component we describe herein.
We will now describe the key generation algorithm that is followed by the users of the system. This process is depicted in FIG. 1. Let e>2 be a small prime (e.g., e=3, 5, 7, etc.). Let M be a security parameter. Choose M/2 bit numbers s and s′ randomly, and choose M/2 bit primes p1, p2, q1, and q2. Let &phgr; denote euler's totient function. These primes adhere to the following mathematical constraints for proper system operation:
1. Each of p1−1, q1−1, p2−1, and q2−1 have a large prime in their factorization.
2. gcd(e,(p1−1)(q1−1)(p2−1)(q2−1))=1.
3. There exists a M1 bit (e.g., M1=31) odd value t1 s.t. p=2t1p1q1+1 is prime and s.t. gcd(e,&phgr;(t1))=1.
4. There exists a M1 bit odd value t2 s.t. q=2t2p2q2+1 is prime and s.t. gcd(e,&phgr;(t2))=1.
We incorporate t1 and t2 in finding p and q to make key generation fast. To provide protection against shadow public key abuse, the following additional constraints are needed to reduce subliminal leakage:
1. H1(s) (or H1(s)+1, see below) is the same as the upper half of the bits in the bit representation of p1q1.
2. H1(s′) (or H1(s′)+1) is the same as the upper half of the bits in the bit representation of p2q2.
To accomplish step 1, the algorithm used in the SETUP attack against RSA keys with an obvious modification is performed (A. Young, M. Yung, "Kleptography: Using Cryptography Against Cryptography", Eurocrypt '97, section 5, pages 62-74, Springer-Verlag, 1997). Thus, either H1(s) is the upper order bits, or H1(s)+1 is the upper order bits due to a borrow bit being taken. Here H1 is a suitable one-way hash function. This step is to avoid the leakage of M/2 bits in the composite p1q1. However, using this approach, we need to perform trial divisions on q1−1 and insure that the resulting value is prime. The same procedure is used to accomplish step 2. The values p, q, t1, and t2 are found to satisfy the above. The key generation algorithm then performs the following computations:
1. Compute the smallest values s1 and s2 that make g1=H2(s,s′,s1) a generator mod p and g2=H3(s,s′,s2) a generator mod q. We insist that s1 and s2 are, say at most 16 bits in length.
2. Chinese remainder g=g1, mod p with g=g2 mod q to get g mod pq (g then has order &lgr;(n), see (Rosen, K. R., "Elementary Number Theory and its Applications", 3rd edition, Theorem 8.21, page 313, Addison Wesley, 1993).
3. n=pq
4. n1=2t1p1q1t2p2q2
5. d=(1/e) mod &phgr;(&phgr;(n))
6. compute T1 to be a non-interactrive zero-knowledge proof of knowledge of the factorization of (p−1)/2t1.
7. compute T2 to be a non-interactive zero-knowledge proof of knowledge of the factorization of (q−1)/2t2.
To prove knowledge of the factorization of a number u into two distinct prime factors, one can query a random oracle hash function on this number u to generate enough random numbers mod u and show a square root of at least ⅜ of these random numbers.
H2 and H3 are suitable one-way hash functions, where the range of H2 is Zp and the range of H3 is Zq. Number (2) above is the last part of step 1000 in FIG. 1. Number (3) above corresponds to step 1005 in FIG. 1. Numbers (4) and (5) above correspond to step 1010 in FIG. 1. Note that n1=&lgr;(n) is the carmichael function &lgr; of n. The public verification key is (g,e,n). The private signing key of the user is (d,n1). Numbers (6) and (7) above correspond to step 1020 in FIG. 1. Note that T1 and T2 can optionally be conducted interactively. To register the public verification key with the CA, the user sends to the CA the tuple (s,s′,p,q,t1,t2,s1,s2,e,T1,T2). The values s1 and S2 must be sent, since we know of no way for the CA to verify that g1, generates Zp and that g2 generates Zq. This corresponds to step 1030 in FIG. 1. To those skilled in the art, steps 6 and 7 above can be replaced by an interactive protocol between the user and the CA.
Step 2000 in FIG. 2 is the user generating the key pair and forming (s,s′,p,q,t1,t2,s1,s2,e,T1,T2). Step 2010 depicts the user sending this string of information to the CA. Step 2020 in FIG. 2 is the CA verifying this string of information. We will now describe this process in detail. The CA receives (s,s′,p,q,t1,t2,s1,s2,e,T1,T2). The CA computes v1 to be (p−1)/2t1 and v2 to be (q−1)/2t2. The CA then sets z to be the upper half of the bit representation of v1, and z′ to be the upper half of the bit representation of v2. The CA computes g1 and g2 in the same way as the user. The CA finds g by Chinese remainding g1 mod p with g2 mod q. The CA also computes n=pq. Let a|b denote that a divides b evenly. Let a{circumflex over ( )}b denote a raised to the b power. The CA verifies all of the following things:
1. p is prime, t1 is odd and the appropriate size, t1|p−1, s is M/2 bits, etc.
2. that pq is hard to factor (e.g., |p-q| is large, etc.)
3. H1(s) or H1(s)+1 equals z and also checks that H1(s′) or H1(s′)+1equals z′.
4. g1{circumflex over ( )}((p−1)/2)≠1, g1{circumflex over ( )}((p−1)/t1)≠1, g1{circumflex over ( )}((p−1)/v1)≠1 all mod p and that g2{circumflex over ( )}{(q−1)/2}≠1, g2{circumflex over ( )}((q−1)/t2)≠1, g2{circumflex over ( )}((q−1)/v2)≠1 all mod q (hence, the CA is sure that g generates a large subgroup).
5. checks that T1 and T2 are valid.
Step 5 convinces the CA that the user knows the signing private key. If all the verifications pass then the CA publishes (g,e,n) as the user's public verification key. If an escrowed PKI is also in use, then (p,q) is forwarded to the escrow authorities to permit key recovery. Either way, the CA may opt to store all of the information received by users for future purposes.
In the event that the law-enforcement (or whatever body is in charge of investigating rogue use of n) suspects that a given users modulus n was used to encipher data using a public key encryption algorithm, the factors (p,q) of n are used to recover the encrypted information. This process is depicted in FIG. 3. In step 3000 of FIG. 3. The recovery agent (which may be law enforcment) obtains the enciphered communications of the suspected criminal. In step 3010, the recovery agent obtains the factors (p,q) of n from the CA. Here n is the modulus corresponding to the public key of the message recipient. In step 3020, the recovery agent deciphers the communications using the factors (p,q) of n. The encrypted information may be a session key that is needed to decrypt the actual criminal communications. Hopefully, law-enforcement knows exactly what algorithm was used to encipher the information.
FIG. 4. depicts a typical public key cryptosystem (PKC) when used for digital signatures. In step 1 a user of the system reads the CA's adress and other information. In step 2, the user generates a public/private key pair and gives the public key to the CA. Step 3 corresponds to normal system operation. In this step, a sender signs a message using the sender's own private key, as depicted in step 4. The sender sends the message along with the signature to the receiver in step 5. In step 6, the receiver obtains the message and signature and obtains the public key of the sender from the CA. In step 7, the receiver verifies the authenticity of the received message using the message, the signature, and the sender's public key. Variations on usages of signatures and technologies built upon the availability of digital signatures are applicable.
FIG. 5 describes our digital signature system. Steps 1 through 7 are fundamentally unchanged from FIG. 4. Yet, in our system, if the public key of the sender is used to encipher data, a recover agent can recover the information. This process is depicted in steps 8 and 9. In step 8, the recovery agent gets recovery information from the CA, corresponding to the factors of the senders public modulus n. In step 9 the recovery agents obtains and deciphers the message that is suspected to have been enciphered using the public key of the sender. Art describing the operation of the recovery agents is described in publications that pertain to the specific encryption algorithm used by the malicious user (e.g., RSA in U.S. Pat. No. 4,405,829).
The signing algorithm is depicted in FIG. 6. To sign an arbitrary message m, the user computes gH(m) mod n as depicted in step 6000 of FIG. 6. Having computed this quantity, the signer proceeds to step 6010 and computes c=(H(m))d mod n1. Here H is a random oracle (e.g., implemented via one-way hash functions). c is the output of the signing algorithm, and is the signature on m.
FIG. 7 depicts the process that is followed to verify the authenticity of a signature c on message m. In an alternate embodiment, the signature c includes redundancy and/or randomness in addition to the message being signed. In step 7000 of FIG. 7, the verifier computes gH(m) mod n. In step 7010 the verifier computes g{circumflex over ( )}(ce) mod n. In step 7020 the verifier checks that:
gH(m) mod n=g{circumflex over ( )}(ce) mod n
If this equality holds, then 1 is output, indicating that c is a valid signature on m. Otherwise, zero is output, indicating that c is not a valid signature on m. Note that if, for example, e=3, the only way to verify the signature is to compute the right side as follows:
g{circumflex over ( )}(ce) mod n=((gc mod n)cmod n)cmod n
This is necessary because the modulus in the exponent is unknown to the verifier, thus the verifier cannot first compute c3 mod n1 and then use this as the exponent for g. Note that if e were a value other than 3, we would simply perform e modular exponentiations to compute the right side of the verification equation. The reason we insist e is small (which is of size polynomial in the logarithm of the size of n) is therefore to make signature verification efficient.
This system constitutes a nested trapdoor system involving three domains, F1, F2, and F3. In particular, domain F3 is the integers mod &phgr;2(n), F2 is the integers mod &lgr;(n), and F1 is the integers mod n. If another encryption key is available (namely, the public encryption key of the receiver of the signature), it can be used to encrypt the message and signature being sent.
Thus, there has been described a new and improved unescrowed auto-certifiable signature infrastructure which allows for digital signatures, its variants, and applications. It is to be understood that the prefered embodiment is merely illustrative of some of the many specific embodiments which represent applications of the principles and paradigms of the present invention. Clearly, numerous and alternate arrangements can be readily devised by those who are skilled in the art without departing from the scope of the present invention.
In a secondary embodiment of the above method, one can view a system where users or other system entities have signature keys and if the CA or key recovery authorities or law enforcement try to impersonate a user, there is a way for the user to prove a-posteriori that forgery.
If retroactive security is acceptable in a system that operates along side an escrowed one, the following simpler solution can be used. By being retroactively secure we mean that under normal system operation, users assume that the escrow authorities will not forge signatures, but if they do forge signatures, then users have a retroactive way of verifying this. This solution has now small sized signatures and efficient signature verification algorithms. In this solution, the user generates two public/private key pairs (y1,x1) and (y2,x2) and escrows x1 (e.g., as in the pending patent Ser. No. 08/878,189 of Young and Yung). Provided that the CA is convinced that x1 is escrowed and that y1 doesn't contain a shadow public key, the CA chooses a number r randomly and computes v=H(r,y2). The CA publishes (y1,v). Here H is a one-way hash function. Note that v has no subliminal channel from the user, hence it has no shadow public key. This value forms a public commitment of y2.
Let c=sig(x,m) be the signature on m using the private key x. To sign a message m, the user computes c1=sig(x1,m), and c2′=sig(x2,m). The user computes c2=H′(c2′). The range of H′ could be say {0,1}64. The signature is (c1,c2). Alternatively, c2 can be a parameter in computing c1, extending the message m. To verify a signature a user checks that c1 is the proper signature on m using y1 . The value c2 goes unchecked under normal system operation. If a user suspects that the escrow authorities forged a signature, the user can demand that the signer send him y2. Once y2 is obtained, the verifier checks that v=H(r,y2), c2′ is the signature on m using y2, and checks that c2=H′(c2′). If equality does not hold, it constitutes a proof of forgery. The reason this is only a partial solution is that to check if the escrow authorities forged the signature, a shadow public key y2 is sent to the verifier. Also, a malicious user could choose C2 to leak information, hoping it will never be verified (hence, why we restrict it to being small, say 64 bits). However, for many applications this may suffice.
1. A method for generating a public key and a proof that the key was generated by a specific algorithm comprising the steps of:
- the user's system generating a random string of bits;
- the user running a key generation algorithm to get a private signing key, and a corresponding public key using the random string, where said public key can be used to verify digital signatures;
- the user constructing a proof being a string of bits which provides confidence to another entity that said key was generated properly by the specified algorithm;
- the user constructing a proof which involves the user engaging in a protocol with said another entity whereby the said another entity repeatedly sends a challenge string and said user sends a response based on the challenge and the public and private keys such that the public availability of said challenges and responses does not compromise the private keys, but at the same time provides confidence to said another entity that said user know's the private key corresponding to the public key that was generated.
2. A method as in claim 1 where said public key is made available publicly.
3. A method for registering users into a Public Key Infrastructure (PKI) such that a user and his key is registered only upon verifying that the key was generated according to a specific algorithm comprising the steps of:
- the user generating the keys as in claim 1, and in addition:
- the user sending to the registration authority the public key and a proof of the fact that the said user knows the corresponding private key and that both keys were generated according to a specific algorithm;
- if the registration authority is convinced of the validity of said fact and of the user's identity, then a certification authority issues a certificate for user's said public key and publicizes said public key.
4. A method as in claim 3 wherein the registration authority, after verifying the validity of said public key, publishes said public key together with a string which identifies the user in the system according to the system's identification convention.
5. A method as in claim 4 wherein the registration authority certifies the public key of said user by signing at least user's said public key using said registration authority's private key.
6. A method as in claim 3 with the further steps of:
- user employing their private keys corresponding to registered public key for signing messages or authenticating themselves;
- user employing receiver's public keys for encrypting messages sent to said receiver.
7. A method as in claim 3 with the further step of the user generating and registering an additional encryption key for confidentiality.
8. The method as described in claim 7 where user's encryption key or information encrypted under it can be monitored by key recovery agents.
9. The method described in claim 8, with the further provision that said key recovery agent or anyone else but the said user cannot produce valid signatures of said user to impersonate the user.
10. The method described in claim 8, with the further provision that said key recovery agent or anyone else but the said user cannot forge valid signatures of said user without said user being able to prove this forgery.
11. A method as in claim 8 with the further step of: characterizing the user's activities as unlawful if the agent is unable to monitor the user's communications.
|April 29, 1980
|Hellman et al.
|August 19, 1980
|Hellman et al.
|September 20, 1983
|Rivest et al.
|January 3, 1984
|Hellman et al.
|November 25, 1986
|Okamoto et al.
|February 3, 1987
|Clark et al.
|May 31, 1988
|Shamir et al.
|November 14, 1989
|June 12, 1990
|February 19, 1991
|April 2, 1991
|March 17, 1992
|Camion et al.
|July 27, 1993
|January 4, 1994
|May 24, 1994
|September 17, 1996
|Lipner et al.
|September 17, 1996
|Lipner et al.
|May 27, 1997
|Lenstra et al.
|May 27, 1997
|Kaliski, Jr.
|June 17, 1997
|Lipner et al.
|July 8, 1997
|August 18, 1998
|Johnson et al.
|September 29, 1998
|Johnson et al.
- Schneier, Bruce. Applied Cryptography: Protocols, Algorithms, and Source Code in C. 10/95. sections 2.6 and 19.6.*
- R. Anderson, M. Roe, "The GCHQ Protocol and Its Problems", Eurocrypt '97, pp. 134-148, Springer-Verlag, 1997.
- M. Belare, P. Ragaway, "Optimal Asymmetric Encryption", Eurocrypt '94, pp. 92-111, Springer-Verlag, 1994.
- D. Chaum, "Blind Signatures For Untraceable Payments".
- D. Chaum, T.P. Pedersen, "Wallet Databases with Observers".
- D. Denning, D. Branstad, "A Taxonomy for Key Escrow Encryption Systems", Communications of the ACM, v.39, n. 3, 1996.
- A. De Santis, Y. Desmedt, Y. Frankel, M. Yung, "How to Share a Function Securely", ACM STOC '94, pp. 522-533, 1994.
- Y. Desmedt, Y. Frankel, "Threshold Cryptosystems", CRYPTO '89, pp. 307-315, Springer-Verlag, 1989.
- Y. Desmedt, "Securing Traceability of Ciphertexts-Towards a Secure Software Key Escrow System", Eurocrypt '95, pp. 147-157, Springer-Verlag, 1995.
- W. Diffie, M. Hellman, "New Directions in Cryptography", IEEE Transactions on Information Theroy, 22, pp. 644-654, 1976.
- T. ElGamal, "A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms", CRYPTO '84, pp. 10-18, Springer-Verlag, 1985.
- P. Feldman, "A Practical Scheme for Non-Interactive Verifiable Secret Sharing", 28th annual FOCS, pp. 427-437, 1987.
- A. Fiat, A. Shamir, "How to Prove Yourself: Practical Solutions to Identification and Signature Problems", CRYPTO '86, pp. 186-194, Springer-Verlag, 1987.
- Y. Frankel, M. Yung, "Escrow Encryption Systems Visited: Attacks, Analysis and Designs", CRYPTO '95, Springer-Verlag, 1995.
- R. Ganesan, "How To Use Key Escrow", Communications of the ACM, v. 39, n. 3, p. 33, 1996.
- S. Goldwasser, S. Micali, R. Rivest, "A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks", SIAM Journal of Computing, vol. 17, n. 2, 1988.
- IBM, SecureWay, key recovery technology document, available at http://www.ibm.com/Security/html/wp-keyrec.html (downloaded May 25, 1997).
- N. Jefferies, C. Mitchell, M. Walker, "A Proposed Architecture for Trusted Third Party Services", Cryptography: Policy and Algorithms, LNCS 1029, Springer, 1996.
- J. Killian, F. Leighton, "Fair Cryptosystems, Revisted", CRYPTO '95, pp. 208-221, Springer-Verlag, 1995.
- L. Lacy, D. Mitchell, W. Schell, "CryptoLib: Cryptography in Software", AT&T Bell Labs, firstname.lastname@example.com.
- A. Lenstra, P. Winkler, Y. Yacobi, "A Key Escrow System with Warrant Bounds", CRYPTO '95, pp. 197-207, Springer-Verlag, 1995.
- S. Micali, "Fair Public-Key Cryptosystems", CRYPTO '92, pp. 113-138, Springer-Verlag, 1992.
- K. Nyberg, R. Rueppel, "Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem".
- T.P. Pedersen, "A Threshold Cryptosystme without a Trusted Party".
- E. Verheul, H. Tilborg, "Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals", Eurocrypt '97, pp. 119-133, Springer-Verlag, 1997.
- S. Walker, J. Winston, "Principles for Use of Encryption and Key Recovery", availalble at http://www.tis.com/docs/products/recoverkey/recoverykey.html(downloaded May 25, 1997).
- A. Young, M. Yung, "Kleptography: Using Cryptography Against Cryptography", Eurocrypt '97, pp. 62-74, Springer-Verlag, 1997.
- "Digital Systems", CRC Handbook of Applied Cryptography, Ch 11, pp. 425-444.
- "Digital Systems", CRC Handbook of Applied Cryptograpy, Ch 11, pp. 445-464.
- "Digital Systems", CRC Handbook of Applied Cryptography, Ch 11, pp. 465-481.
- "Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes", Tatsuaki Okamoto pp. 32-53.
- Federal Register/vol. 62, No. 92/Tuesday, May 13, 1997/Notices, pp. 26293,26294.
Type: Grant
Filed: Dec 22, 1998
Date of Patent: Oct 29, 2002
Inventors: Adam Lucas Young (New York, NY), Marcel Mordechay Yung (New York, NY)
Primary Examiner: Gail Hayes
Assistant Examiner: Ho S. Song
Attorney, Agent or Law Firm: Schweitzer Cornman Gross & Bondell LLP
Application Number: 09/218,219
International Classification: H04K/100;


text:
Fresh Traditions VIII Fashion Show0
ST. PAUL (Sept. 4, 2014) — The Center for Hmong Arts & Talent (CHAT) is celebrating eight years of culturally infused Hmong fashion at the Fresh Traditions VIII Fashion Show on Saturday, Sept. 27, 2014, at the Grain Belt Studios, 79 — 13th Ave, NE, Minneapolis, MN 55413.
Doors open at 6 p.m. The show starts at 7 p.m.
Fresh Traditions Fashion Show is the Twin Cities' first and only Hmong inspired fashion event exhibiting the creativity, originality, and quality of work by Hmong fashion designers.
Fresh Traditions VIII Fashion Show culminates from eight months of planning and organizing with six Hmong American designers and the Fresh Traditions committee. This one-of-a kind fashion show gives guests the opportunity to view new and exclusive collections from six emerging Hmong American designers as they take on the featured challenge—creating a garment in which traditional Hmong textiles must be incorporated.
We are excited to announce that Fresh Traditions VIII Fashion Show will be an exclusive event. Admission tickets will only be available as online pre-sale membership perks. Registration can be found at ft8.aboutchat.org.
This year's featured designers are Hill Tribe Fusion, Kia Moua Kehrer, Mai Ceceil Lee, Maisee Heurh, PaFoua Vang Xiong, and Vanessa Vu.
Fresh Traditions VIII Fashion Show is sponsored by Western Bank, Project SUCCESS, KPNP 1600AM/Hmong Diverse Radio, In Progress, Craw Daddy's Yummy Kitchen.
The history of Hmong art is rooted and sewn into the fabrics of traditional Hmong clothing where the unique combination of vibrant colors and textures makes the Hmong identifiable. Fresh Traditions was created in 2006, as a result of the increasing interest in the fashion industry by Hmong artists.
CHAT is the first and only multidisciplinary Hmong arts organization in the United States. CHAT exists to nurture, explore and illuminate the Hmong American experience through artistic expressions. CHAT envisions a vibrant community where Hmong American artists are inspired to share their perspectives, valued for their creative contributions, and empowered to challenge life's boundaries.
For more information, please visit www.aboutchat.org.


text:
Hey all, I'm an R6 enthusiast and tinkerer who would like to figure out how to flash the ECU myself. I'm currently working as a motorcycle designer, but I was a programmer in a previous career (C++) so I can understand the technical stuff.
Is there any info on how I can build my own cable to flash my ECU? Thanks!


text:
On Feb 25, 2008, Congressional Representatives Lois Capps (D-CA) and Steven LaTourette(R-OH) began circulating a "Dear Colleagues" letter in the House of Representatives seeking support of funding the Title VIII Nursing Workforce Development Program at a level of $200 million for FY 2009.
The American Nurses Association and the National League for Nursing are asking nurses for help. Nurses are encouraged to contact(by phone, FAX. or Email) their Congressional Representative to encourage him/her to co-sign this letter by Wednesday, March 12, 2008. Find your Representative at Congress.org.
President Bush's proposed budget for FY 2009 reduces the funding for Title VIII by 30% ($46.1 million) from FY2008. He accomplished this by completely eliminating the funding for "Advanced Education Nursing." (At a time when more nurse educators are needed!)
According to the National League for Nursing, more than 30 years ago, also during a (far less serious) nursing shortage, Congress appropriated $153.6 million for nurse education programs to help ease the nursing shortage (which it did).
If you factor in inflation and adjust that number for the current dollar value, it would be $634 million today. That's four times the amount being appropriated today for Title VIII programs! And this nursing shortage is at a crisis level, and the President wants to cut funds even more!
Read more about this issue from the National League for Nursing.


text:
Wolf Vinyl Sticker – SELECT SIZE
- Size: 7″ x 7″
- High quality strong outdoor grade vinyl sticker
- Great for any flat surface: car window & bumper, boat, guitar case, surfboard, wall, etc.
- Simple peel & stick application. Outdoor life – 3 -5 years.
Before installation, clean the surface, peel off the backing and apply. Indoor or outdoor use – printed on all weather outdoor grade vinyl. Great for any flat surface – use on car window & bumper, boat, jet ski, snowboard, guitar case, surfboard, wall, etc. Will not peel or fade for 3-5 years or more.
List Price: $ 7.99
Like this Post? Subscribe to Our Feed! Delivered by eMail. Unsubscribe anytime.
Famous Quotes of Inspiration..."Every government is a scoundrel."


text:
Pfister Chef's TableLive Item
1 Bid
Want to bid on this item? Be sure not to miss our live auction.
Already have an account?
1 Watcher
Experience a night with friends over a just-for-you created dinner and art tours. The Pfister's Executive Chef Brian Frakes will create a dinner to remember for you and seven (7) friends at a Chef's Table. This five (5) course dinner will include wine pairings, private Art Tour and presentation from our Artist in Residence. Expires 5/6/18.
Donated By Marcus Corporation


text:
Excited to share the newest Peace Love n Seasonal Fruit Design
Sugar Mama!
This shirt has an awesome 80's feel with the neon Peace Love n Seasonal Fruit on the top, the big glowing bowl of fruit and Sugar Mama larger than life on the bottom!
Enjoy this Soft and Comfortable Organic Cotton Slim Fitting scoop neck T-shirt 🙂
Wishing you much


text:
Instinct tile from the Lowitz & Company studio is made of stoneware clay and glazed with colored glass. Shown glazed in Moonlight, Shadow, Driftwood, Sunlight and Marigold, the tiles are long-lasting and can help projects qualify for LEED credits.
Available in 30 motifs and made from post-consumer recycled materials, Trend USA's FEEL collection has a design for every environment.
Handmade in Morocco by Popham Design, Hex Arrow tiles are created using a 150-year-old technique.
Motawi Tileworks' Tree to Tree tiles provide a way to bring Charley Harper's drawings into your home.
Half Hex Mix (shown here in fog) is part of Heath Ceramics' Dwell Pattern collection, produced with the help of Dwell's design team.
With Maruja Fuentes' Green Pocket Tiles, fresh herbs can grow year-round as they are insulated by kitchen or living room walls.
It's not easy being green. Those wishing to design sustainably might consider cork mosaic tile by Habitus. Made from the waste of the cork bottle-stop industry, cork mosaic tile comes in over 100 colors.


text:
Special Educational Needs
Click here to download the SEND handbook for parents
Click here to download the SEND information report April 2020
Click here to download SEND Policy
Click here to download the SEND Single Equality Scheme and Accessibility plan
The North Yorkshire local offer can be found at:
Special Educational Needs and Disability Information, Advice and Support Service
The SENDIASS co-ordinator for our area is Jane Clark. She is available to offer advice, listen to worries or concerns, offer home visits, attend review meetings or support transition to a new school. Her advice is impartial and she can be contacted on 01609 536198
For more information about SENDIASS see:
Another support service for local families is NYPACT. NYPACT is the parent carer forum for North Yorkshire and aim to provide a collective voice for parents of children with disabilities and additional needs. They are a voluntary organisation run by a management committee of volunteer parent carers and is supported by a part time paid member of staff based at North Yorkshire and York Forum.
For information about NYPACT see:
Dyslexia Network Plus
Dyslexia Network Plus is a local Not-for-Profit organisation, run by parents to support families with dyslexic type difficulties.
For information about Dyslexia Network Plus see:


text:
Just a quick note to say, don't expect me around for the next week to 10 days; I have no idea whether I will even have internet access at all.
I expect this comment thread to be full of wonderful stuff when I get back. That's a reasonable expectation for an internet comment thread, isn't it?


text:
Buy to let property insurance
We are an independent insurance broker, meaning we are not tied to any particular insurer, so we search the market for the right insurance policy for your property.
We offer tailor-made buy to let house insurance policies, so if you have any particular requirements for your cover, then we are the broker for you. Our team of friendly, knowledgeable advisors really do know the market inside out and will happily run through your insurance options, ensuring you clearly understand the intricacies of all the policies available.
Our buy to let home insurance policies include:
- Landlord Insurance
- Tenant Insurance
- Vacant / unoccupied property insurance
We offer a range of buy to let house insurance options
A typical insurance policy offered by many other brokers will offer contents insurance, buildings insurance and landlord liability cover. That's all well and good, we offer these terms in our policies as well, however, we also regularly arrange:
- Discounts for multiple properties on one policy
- Accidental damage cover
- Loss of rent cover
- Insurance for student tenants, DSS, asylum seeker lets, etc
- Unoccupied property cover with 'full perils'
Would you like a free no obligation quote?
Call us today: 029 2062 6226 or Arrange a Callback


text:
* C$ rebounds to 96.48 U.S. cents
* Bonds mixed as equity markets make gains
* U.S. retail sales tepid, inflation at 40-year low (Adds details)
By Ka Yan Ng
OTTAWA, Aug 13 (Reuters) - The Canadian dollar rebounded against the greenback on Friday morning after being pulled down early in the day by the initial reaction to U.S. July data for inflation and retail sales.
The currency CAD=D4 slid to C$1.0440 to the U.S. dollar, or 95.79 U.S. cents, as the U.S. dollar rose after the release of figures that showed U.S. retail sales and consumer prices rose in July. But the U.S. dollar then fell back against the Canadian currency because the data was "not enough to derail anybody's view" on the fragile state of the economy, said Jack Spitz, managing director of foreign exchange at National Bank Financial.
Higher energy costs helped lift U.S. consumer prices, the first rise in four months, in a report that could ease concerns about deflation. [ID:nN13179718]
The rise in U.S. retail sales was concentrated in auto and gasoline station sales, suggesting underlying momentum in consumer spending remains tame. A separate report showed U.S. consumer sentiment inched up in early August from July. [ID:nN12179325] [ID:nN13177086]
By 10:40 a.m. (1440 GMT), the Canadian currency had recovered to C$1.0365 to the U.S. dollar, or 96.48 U.S. cents, up from Thursday's finish at C$1.0428 to the U.S. dollar, or 95.90 U.S. cents.
Aside from the U.S. data, the day's influences could come from equity market movements, while the day's range has likely already been established, Spitz said.
"It's unlikely to trade through C$1.0360 today, but momentum can be a game changer as we've seen over the last number of sessions," he said.
"All in all, it's likely to hold between C$1.0360 and C$1.0440 ... but again, unless there's a huge move up or down in equities, we're unlikely to probe through either end of that range."
Canadian bond prices were up but off highs in long-dated issues, and weaker in short-dated maturities, after the U.S. consumer confidence data was a bit above expectations.
Moderate gains in equity markets also took favor away from an earlier safe-haven bid to debt.
The two-year bond CA2YT=RR was down 5 Canadian cents to yield 1.383 percent, while the 10-year bond CA10YT=RR was up 1 Canadian cent to yield 3.011 percent. (Reporting by Ka Yan Ng; editing by Peter Galloway)


text: Project managers play a vital role in the IT sector, overseeing the planning, development and installation of various computer systems within organisations of all shapes and sizes. Good IT project management can be key to successfully rolling out important business initiatives. This means employers are always on the lookout for top talent, searching for candidates that possess a unique mix of both technical know-how and soft skills. Morson has been involved in recruiting individuals for roles in the IT sector for many years, across a broad range of different disciplines. Our specialist IT division has...read more


text:
Welcome to Arora Law P.C.
Welcome to Arora Law P.C. A Tax Law Firm with focus on State, Federal, International tax and related Immigration issues. We can help with issues related to federal income tax, state income tax, federal & state tax audit and preparing related tax return.
At Arora Law P.C. we understand the need of an Immigrant who wants to invest in the United States and obtain immigration benefits. Please call us today to find out how we can help you to reach your goals. We help our clients to apply for the proper visa and related materials. Our goal is to provide one window solutions to our clients. It includes: business structure, tax treaty rules, immigration filing requirements and any other business, immigration and tax needs.
We are dedicated to providing advice and help with International tax issues. Due to the recent tax reform there are several…Read More
It is very important to have proper timing when filing with federal and state level. Under U.S. Tax law and state there are…Read More
State tax audit and sales/use tax audit is without a doubt one of the challenged and confusing area. All the applicable states…Read More
At Arora Law P.C. we understand the need of an immigrant can be complex. Do you need help to apply for a Green Card…Read More


text:
CHRIS COOKEWorkshop - Digital distribution
CHRIS COOKE is MD and Business Editor of CMU, a service provider to the music industry. Best known for its media – the CMU Daily, CMU Podcast, CMU Digest and CMU Trends – the CMU business also provides training and consultancy to music companies, hosts the CMU Insights, The Great Escape conference, and runs the CMU:DIY education programme for new talent.
CMU is part of Chris's company 3CM UnLimited, through which he also publishes cultural recommendations service ThisWeek London, its sister magazine ThreeWeeks Edinburgh and the TW:TALKS podcast; and helps run award winning PR training charity the Taylor Bennett Foundation.
With degrees in English and Law, Chris regularly writes about, discusses and comments on media and media law, music and comedy, and the music and communication industries. He authored the report 'Dissecting The Digital Dollar' for the UK's Music Managers Forum and occasionally performs spoken word show 'Chris Cooke's Free Speech'.


text:
Istripper Natalia
All the way from across the Atlantic ocean, meet Natalia. An English girl through and through, Natalia has quiet grace and refinement as well as a seductive wild side that she regularly sets free during her exciting on stage performances. Watch Natalia sizzle in a variety of sensual outfits that truly accentuate her scrumptious all natural curves.


text:
These old things that I love
These old things that I love: my Selfridges shoe story entry.
Posted by lucygranville on August 3, 2010 · Leave a Comment
These old things that I love: my Selfridges shoe story entry.
Category Gally, Selfridges Shoe Emporium, Shoe Story · Tagged with Creative
Error: Please make sure the Twitter account is public.
As the fig-leaf identifies Adam, so may the chaperon twisted into a cockscomb mark Richard II. As the curled and scented hair of Alcibiades occurs to our mind, so shall Beau Nash manage his clouded cane. Elizabeth shall be helped to the memory by her Picadilly ruff; square Henry VIII by his broad-toed shoes and his little flat cap; Anne Boleyn by her black satin nightdress; James be called up as padded trucks; Maximilian as puffs and slashes; D'Orsay by the curve of his hat; Tennyson as a dingy brigand; Gladstone as a collar; and even more recent examples, as the Whistlerian lock and the Burns blue suit. And what romantic incidents may we not hang upon our clothes line! The cloak of Samuel Pepys ('Dapper Dick', as he signed himself to a certain lady) sheltering four ladies from the rain; Sir Walter Raleigh spreading his cloak over the mud to protect the shoes of that great humorist Elizabeth I never think of her apart from the saying, 'Ginger for pluck'); Mary, Queen of Scots, ordering false attires of hair during her captivity - all these scenes clinched into reality by the knowledge of the dress proper to them.


text:
The GenHERation Leaderiship conference in Toronto was a memorable experience for all those present. On Tuesday July 21st, young women from all over the Greater Toronto Area came to the MaRS Discovery District to learn about leadership, network with fascinating women, and participate in interactive activities. This conference also gave the participants an opportunity to pitch their own community project to a judge in order to win five hundred dollars to get it started. During this conference there was a panel of women who answered questions about their lives, occupation, and road to their current position. All the women were in different leadership positions ranging from the technology to the toy industry. Katlyn Grasso, a remarkable, driven young woman who was responsible for this conference asked questions to the panel first, and then it was opened to the audience. From the question and answer period all those present learned something new. The women on the panel discussed how they got to their current positions. What was truly interesting was that not one woman on that panel had a linear path to success. There were many different pathways from where they started to where they ended up.
Each path to success was different. Some had more bumps along the road than others. For some of the young women present, it was nice to know that the path to success is not formulaic, but fluid and dependent on each individual. For others, it taught them that the path to success was a long one, but the destination was worth the journey. We live in a society that seems to fear failure, and only focuses on the successes of an individual. However, none of the women on the panel were shy when discussing the many pitfalls in their career; the failures that they had to overcome. In fact, most women attributed their successes to the failures in their lives. They found that their failures made them realize that they had to do something differently in order to achieve their dreams. The panel discussion was inspiring, and an excellent way to learn from other women in leadership positions. The conference had more in store for the participants after the panel discussion. There was a challenge activity that required the participants to get into groups to create a product with given materials and pitch it to a judge. Each group was given the same materials; pipe cleaners, marshmallows, a bowl, string, and tape. Yet all five groups had different product ideas, which demonstrated the amount of creative juices flowing through the room that evening. For example, one group wanted to create a high school starter pack, while another created a compliment tree to promote positivity within schools. What made this conference notable were the friends made, the lessons learned, and the opportunities given to young women so they could make a difference in their community.
Contributor: Nisha Telesford


text:
Specific guidance for sub-metering of thermal energy in multi-unit buildings (implementation of Articles 9-11 of Directive 2012/27/EU on energy efficiency (updated version))
Upon request by the European Commission, a series of guidelines were published to support Member States authorities and building owners in implementing art. 9-11 of the Energy Efficiency Directive (EED 2012/27/EU) concerning the consumption of thermal energy for heating, cooling and hot water in multi-apartment and multi-purpose buildings.
The general idea is to ensure that users of such buildings have the right incentives and sufficient information to adopt energy-efficient practices. Inducing energy-efficient behaviour among building users should be seen as a complement rather than an alternative to actions aimed to improve energy efficiency at building level, such as improvements in the envelope or the central heating system.
More specifically, the guidance aims to:
- ensure that individual heat meters or heat cost allocators are installed in existing buildings (EED Art. 9(3) 2nd subparagraph) enabling consumption-based allocation of costs (EED Art. 9(3) last subparagraph), and
- ensure provision of consumption based billing and "frequent"/sub-annual billing information in respect of thermal energy for space heating, space cooling and hot tap water (EED Art. 10(1) & Annex VII).
The guidelines deal with the specification of building classes, and the assessment of the cost-effectiveness of action in respect of individual buildings ("building assessment"). The same approach is recommended both for testing/defining exempted building classes and for assessing individual buildings (as is required in open building classes). Guidance on the use of reference prices, the use of competitive prices discovered in the market, and the use of the current evidence base of research on energy saving. The guidelines also include recommendations for cost allocation and examples from regulatory practice.
For further information, see the relevant links. See also the relevant BUILD UP News.


text:
You are here
Our Solution: Coexistence
Beavers are widely misunderstood across Canada, with the reported stories of occasional flooding vastly outnumbering the stories about improving soil and water quality, preventing drought, as well as providing critical habitat to 50% of the world's threatened or endangered species. At APFA, we don't just talk about non-lethal alternatives for beavers, we implement them in municipalities across the country.
Our approach is focused around a set of principles that we call the 4 S's:
Success-oriented: While trappers and hunters will be satisfied as long as they can continue killing beavers, APFA is satisfied only when both the wildlife and the public benefit from a specific approach to wildlife management.
Solution-driven: While animal protection groups are often accused of 'complaining' by animal-use industries, our entire organization is solution-driven, interested only in the above-mentioned success for both animals and people.
Science-based: Business-as-usual is often what's recommended to municipalities confronted with beaver issues, despite the obvious scientific evidence showing how ineffective trapping/hunting, and dam destruction is. We provide critical information that shows lethal control measures simply create a vacuum in the environment, into which new beavers quickly move.
Sustainable: Rather than allowing a municipality to simply kill a 'nuisance' animal and their family, our efforts focus on helping them implement measures that strike at the root of the human-wildlife conflict. Implementing non-lethal devices and technologies not only strike at this root, they are truly sustainable in a multitude of ways. The devices themselves last a long time, they are an extremely cost-effective option for municipalities, and they protect beaver dams, which are so vital for the sustainability of our environment.
A bit about non-lethal devices and technologies for damming issues:
We have a program that offers our services to municipalities wishing to implement these devices/technologies, and are happy to lend our expertise to communities. To co-exist with beavers, several proven non-lethal and cost-effective devices are available such as the Beaver Deceivers™, Round Fence™, and Castor Master™ (developed by Skip Lisle), as well as the Beaver Stop®, Flexible Pond Leveller®, "Clemson Leveler", and CulverClear™ (designed by Mike Callahan).
Photos above show various models of flow devices (left to right): "Castor Master™", "Beaver Deceivers™", and "Double Filter System". Models created by Sherri Tippie.
A bit about non-lethal devices and technologies for tree-chewing issues:
The simplest way to protect trees from beavers is to set free-standing cylinders of heavy gauge wire mesh (or galvanized welded wire) around each tree (2x2 or 3x3 is recommended). These materials can typically be found in any large hardware store, usually as fencing. The fencing will need to be about 4 feet high, with about 5-6 inches between the tree trunk and the mesh. Unlike groundhogs, beavers won't burrow under mesh fencing, so staking is not necessary, but you may still wish to pin guards to the ground around larger trees. Helpful hint: you may wish to mulch within the guard to prevent weeds from becoming an issue. For more detail on this, and different options for tree-chewing issues (paint and sand mixture, cylindrical cages), please click here.
Are these approaches effective? What about the cost?
In addition to being the humane choice, they are effective because they are the only approach that is long-term. These approaches strike at the root of the damming and chewing issues, and do so in a way that respects (and even works with) the beavers' natural impulses. These devices also offer significant financial savings to municipalities, not only because they are built to last, but because lethal approaches carry with them the burden of repeatedly hiring trappers and/or paying to have dams destroyed.
For more information contact us at firstname.lastname@example.com.


text:
This is more of an idea than a recipe.
I had never thought to dress tomatoes with soy sauce until I came across a simple tomato wedges with soy sauce recipe in my friend Nancy Hachisu's Japanese Farm Food cookbook. It's so easy and good!
Tomatoes love salt, and they really love the flavorful saltiness of soy sauce. Nancy's recipe uses rapeseed (canola) oil and shiso leaves. The salad works just as well with olive oil and sliced basil, which is what I've used here.
Here's a tip for working with fresh raw tomatoes. Don't refrigerate them!
The cold temperatures of the refrigerator will make your tomatoes mealy, and will adversely affect their flavor. If you pick a garden tomato and it isn't quite ripe, just let it sit on a counter for a few days. It will ripen on its own.
Tomato Salad with Soy Sauce Recipe
Make sure the soy sauce you are using truly is made from soy. Much of what is labeled soy sauce in America is just flavored water, not true soy sauce, which is made from fermented soybeans. Check the label to make sure you are getting the real deal!
There are no measurements in this recipe. Just sprinkle the ingredients over the cut tomatoes and adjust to your liking.
- Fresh garden tomatoes
- Extra virgin olive oil
- Seasoned rice vinegar
- Soy sauce or tamari (use gluten-free soy sauce if avoiding gluten)
- Kosher salt or fleur de sel or other finishing salt
- Thinly sliced basil for garnish
1 Core the tomatoes and cut them into wedges. Arrange on a serving plate.
2 Lightly drizzle olive oil over the tomatoes. Sprinkle with seasoned rice vinegar. Sprinkle well with soy sauce. Sprinkle with salt. Toss a few thinly sliced basil leaves over the tomatoes.
Serve at room temperature.
Hello! All photos and content are copyright protected. Please do not use our photos without prior written permission. Thank you!
This post may contain links to Amazon or other partners; your purchases via these links can benefit Simply Recipes. Read more about our affiliate linking policy.